YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 09:08:24,537 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 09:08:24,539 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 09:08:24,550 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 09:08:24,550 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 09:08:24,551 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 09:08:24,553 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 09:08:24,554 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 09:08:24,556 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 09:08:24,557 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 09:08:24,558 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 09:08:24,558 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 09:08:24,559 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 09:08:24,560 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 09:08:24,561 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 09:08:24,561 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 09:08:24,562 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 09:08:24,564 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 09:08:24,566 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 09:08:24,568 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 09:08:24,569 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 09:08:24,570 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 09:08:24,572 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 09:08:24,572 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 09:08:24,572 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 09:08:24,573 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 09:08:24,573 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 09:08:24,574 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 09:08:24,575 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 09:08:24,575 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 09:08:24,576 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 09:08:24,577 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 09:08:24,577 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 09:08:24,578 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 09:08:24,578 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 09:08:24,579 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 09:08:24,579 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 09:08:24,580 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 09:08:24,580 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 09:08:24,581 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 09:08:24,595 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 09:08:24,595 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 09:08:24,596 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 09:08:24,596 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 09:08:24,596 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 09:08:24,596 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:08:24,597 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 09:08:24,597 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 09:08:24,597 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 09:08:24,597 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 09:08:24,597 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 09:08:24,597 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 09:08:24,598 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 09:08:24,598 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 09:08:24,598 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 09:08:24,598 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 09:08:24,598 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 09:08:24,598 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 09:08:24,599 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 09:08:24,599 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 09:08:24,599 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 09:08:24,599 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 09:08:24,599 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 09:08:24,599 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 09:08:24,599 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:08:24,600 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 09:08:24,600 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 09:08:24,600 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 09:08:24,600 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 09:08:24,626 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 09:08:24,640 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 09:08:24,643 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 09:08:24,645 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 09:08:24,645 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 09:08:24,646 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:08:24,707 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/cfcd0276b5544139b28f9b909685f580/FLAG265529e51 [2020-06-22 09:08:25,054 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 09:08:25,055 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:08:25,055 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 09:08:25,061 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/cfcd0276b5544139b28f9b909685f580/FLAG265529e51 [2020-06-22 09:08:25,549 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/cfcd0276b5544139b28f9b909685f580 [2020-06-22 09:08:25,560 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 09:08:25,562 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 09:08:25,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 09:08:25,563 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 09:08:25,567 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 09:08:25,568 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:08:25" (1/1) ... [2020-06-22 09:08:25,571 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68b7e873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:08:25, skipping insertion in model container [2020-06-22 09:08:25,571 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:08:25" (1/1) ... [2020-06-22 09:08:25,578 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 09:08:25,596 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 09:08:25,811 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:08:25,825 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 09:08:25,842 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:08:25,857 INFO L195 MainTranslator]: Completed translation [2020-06-22 09:08:25,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:08:25 WrapperNode [2020-06-22 09:08:25,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 09:08:25,859 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 09:08:25,859 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 09:08:25,859 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 09:08:25,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:08:25" (1/1) ... [2020-06-22 09:08:25,878 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:08:25" (1/1) ... [2020-06-22 09:08:25,899 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 09:08:25,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 09:08:25,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 09:08:25,900 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 09:08:25,909 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:08:25" (1/1) ... [2020-06-22 09:08:25,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:08:25" (1/1) ... [2020-06-22 09:08:25,911 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:08:25" (1/1) ... [2020-06-22 09:08:25,911 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:08:25" (1/1) ... [2020-06-22 09:08:25,915 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:08:25" (1/1) ... [2020-06-22 09:08:25,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:08:25" (1/1) ... [2020-06-22 09:08:25,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:08:25" (1/1) ... [2020-06-22 09:08:25,922 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 09:08:25,922 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 09:08:25,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 09:08:25,923 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 09:08:25,924 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:08:25" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:08:25,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 09:08:25,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 09:08:25,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 09:08:25,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 09:08:25,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 09:08:25,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 09:08:26,270 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 09:08:26,271 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 09:08:26,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:08:26 BoogieIcfgContainer [2020-06-22 09:08:26,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 09:08:26,273 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 09:08:26,273 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 09:08:26,275 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 09:08:26,276 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:08:26" (1/1) ... [2020-06-22 09:08:26,294 INFO L313 BlockEncoder]: Initial Icfg 47 locations, 48 edges [2020-06-22 09:08:26,295 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 09:08:26,296 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 09:08:26,296 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 09:08:26,297 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:08:26,299 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 09:08:26,299 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 09:08:26,300 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 09:08:26,326 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 09:08:26,363 INFO L200 BlockEncoder]: SBE split 25 edges [2020-06-22 09:08:26,368 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 09:08:26,370 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:08:26,415 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-06-22 09:08:26,419 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 09:08:26,420 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 09:08:26,421 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:08:26,421 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 09:08:26,422 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 09:08:26,422 INFO L313 BlockEncoder]: Encoded RCFG 39 locations, 70 edges [2020-06-22 09:08:26,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:08:26 BasicIcfg [2020-06-22 09:08:26,423 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 09:08:26,424 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 09:08:26,424 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 09:08:26,427 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 09:08:26,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 09:08:25" (1/4) ... [2020-06-22 09:08:26,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@714403e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:08:26, skipping insertion in model container [2020-06-22 09:08:26,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:08:25" (2/4) ... [2020-06-22 09:08:26,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@714403e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:08:26, skipping insertion in model container [2020-06-22 09:08:26,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:08:26" (3/4) ... [2020-06-22 09:08:26,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@714403e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:08:26, skipping insertion in model container [2020-06-22 09:08:26,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:08:26" (4/4) ... [2020-06-22 09:08:26,431 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:08:26,441 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 09:08:26,449 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 24 error locations. [2020-06-22 09:08:26,465 INFO L257 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2020-06-22 09:08:26,493 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:08:26,494 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 09:08:26,494 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 09:08:26,494 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:08:26,494 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:08:26,494 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:08:26,495 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 09:08:26,495 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:08:26,495 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 09:08:26,510 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2020-06-22 09:08:26,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 09:08:26,516 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:08:26,517 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 09:08:26,517 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2020-06-22 09:08:26,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:08:26,523 INFO L82 PathProgramCache]: Analyzing trace with hash 124423, now seen corresponding path program 1 times [2020-06-22 09:08:26,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:08:26,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:08:26,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:08:26,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:08:26,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:08:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:08:26,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:08:26,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:08:26,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:08:26,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:08:26,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:08:26,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:08:26,708 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2020-06-22 09:08:26,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:08:26,853 INFO L93 Difference]: Finished difference Result 43 states and 70 transitions. [2020-06-22 09:08:26,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:08:26,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 09:08:26,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:08:26,868 INFO L225 Difference]: With dead ends: 43 [2020-06-22 09:08:26,869 INFO L226 Difference]: Without dead ends: 39 [2020-06-22 09:08:26,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:08:26,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-06-22 09:08:26,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-06-22 09:08:26,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-06-22 09:08:26,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 66 transitions. [2020-06-22 09:08:26,912 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 66 transitions. Word has length 3 [2020-06-22 09:08:26,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:08:26,913 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 66 transitions. [2020-06-22 09:08:26,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:08:26,913 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 66 transitions. [2020-06-22 09:08:26,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 09:08:26,914 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:08:26,914 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 09:08:26,914 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2020-06-22 09:08:26,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:08:26,915 INFO L82 PathProgramCache]: Analyzing trace with hash 124424, now seen corresponding path program 1 times [2020-06-22 09:08:26,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:08:26,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:08:26,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:08:26,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:08:26,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:08:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:08:26,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:08:26,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:08:26,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:08:26,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:08:26,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:08:26,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:08:26,972 INFO L87 Difference]: Start difference. First operand 39 states and 66 transitions. Second operand 3 states. [2020-06-22 09:08:27,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:08:27,087 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2020-06-22 09:08:27,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:08:27,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 09:08:27,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:08:27,089 INFO L225 Difference]: With dead ends: 39 [2020-06-22 09:08:27,089 INFO L226 Difference]: Without dead ends: 35 [2020-06-22 09:08:27,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:08:27,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-06-22 09:08:27,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-06-22 09:08:27,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-06-22 09:08:27,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 62 transitions. [2020-06-22 09:08:27,095 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 62 transitions. Word has length 3 [2020-06-22 09:08:27,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:08:27,096 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 62 transitions. [2020-06-22 09:08:27,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:08:27,096 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 62 transitions. [2020-06-22 09:08:27,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 09:08:27,096 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:08:27,097 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 09:08:27,097 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2020-06-22 09:08:27,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:08:27,097 INFO L82 PathProgramCache]: Analyzing trace with hash 124421, now seen corresponding path program 1 times [2020-06-22 09:08:27,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:08:27,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:08:27,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:08:27,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:08:27,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:08:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:08:27,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:08:27,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:08:27,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:08:27,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:08:27,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:08:27,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:08:27,131 INFO L87 Difference]: Start difference. First operand 35 states and 62 transitions. Second operand 3 states. [2020-06-22 09:08:27,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:08:27,235 INFO L93 Difference]: Finished difference Result 35 states and 62 transitions. [2020-06-22 09:08:27,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:08:27,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 09:08:27,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:08:27,236 INFO L225 Difference]: With dead ends: 35 [2020-06-22 09:08:27,236 INFO L226 Difference]: Without dead ends: 31 [2020-06-22 09:08:27,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:08:27,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-06-22 09:08:27,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-06-22 09:08:27,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 09:08:27,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 54 transitions. [2020-06-22 09:08:27,241 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 54 transitions. Word has length 3 [2020-06-22 09:08:27,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:08:27,242 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 54 transitions. [2020-06-22 09:08:27,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:08:27,242 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 54 transitions. [2020-06-22 09:08:27,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 09:08:27,242 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:08:27,242 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 09:08:27,243 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2020-06-22 09:08:27,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:08:27,243 INFO L82 PathProgramCache]: Analyzing trace with hash 3855027, now seen corresponding path program 1 times [2020-06-22 09:08:27,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:08:27,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:08:27,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:08:27,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:08:27,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:08:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:08:27,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:08:27,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:08:27,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:08:27,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:08:27,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:08:27,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:08:27,278 INFO L87 Difference]: Start difference. First operand 31 states and 54 transitions. Second operand 3 states. [2020-06-22 09:08:27,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:08:27,376 INFO L93 Difference]: Finished difference Result 31 states and 54 transitions. [2020-06-22 09:08:27,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:08:27,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 09:08:27,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:08:27,377 INFO L225 Difference]: With dead ends: 31 [2020-06-22 09:08:27,378 INFO L226 Difference]: Without dead ends: 27 [2020-06-22 09:08:27,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:08:27,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-06-22 09:08:27,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-06-22 09:08:27,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 09:08:27,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 46 transitions. [2020-06-22 09:08:27,382 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 46 transitions. Word has length 4 [2020-06-22 09:08:27,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:08:27,382 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 46 transitions. [2020-06-22 09:08:27,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:08:27,383 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2020-06-22 09:08:27,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 09:08:27,383 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:08:27,383 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 09:08:27,383 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2020-06-22 09:08:27,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:08:27,384 INFO L82 PathProgramCache]: Analyzing trace with hash 3855029, now seen corresponding path program 1 times [2020-06-22 09:08:27,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:08:27,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:08:27,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:08:27,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:08:27,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:08:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:08:27,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:08:27,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:08:27,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:08:27,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:08:27,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:08:27,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:08:27,413 INFO L87 Difference]: Start difference. First operand 27 states and 46 transitions. Second operand 3 states. [2020-06-22 09:08:27,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:08:27,505 INFO L93 Difference]: Finished difference Result 31 states and 46 transitions. [2020-06-22 09:08:27,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:08:27,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 09:08:27,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:08:27,507 INFO L225 Difference]: With dead ends: 31 [2020-06-22 09:08:27,507 INFO L226 Difference]: Without dead ends: 27 [2020-06-22 09:08:27,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:08:27,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-06-22 09:08:27,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-06-22 09:08:27,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 09:08:27,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 42 transitions. [2020-06-22 09:08:27,512 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 42 transitions. Word has length 4 [2020-06-22 09:08:27,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:08:27,512 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 42 transitions. [2020-06-22 09:08:27,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:08:27,512 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 42 transitions. [2020-06-22 09:08:27,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 09:08:27,513 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:08:27,513 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 09:08:27,513 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2020-06-22 09:08:27,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:08:27,513 INFO L82 PathProgramCache]: Analyzing trace with hash 3855030, now seen corresponding path program 1 times [2020-06-22 09:08:27,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:08:27,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:08:27,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:08:27,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:08:27,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:08:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:08:27,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:08:27,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:08:27,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:08:27,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:08:27,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:08:27,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:08:27,555 INFO L87 Difference]: Start difference. First operand 27 states and 42 transitions. Second operand 3 states. [2020-06-22 09:08:27,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:08:27,623 INFO L93 Difference]: Finished difference Result 27 states and 42 transitions. [2020-06-22 09:08:27,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:08:27,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 09:08:27,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:08:27,625 INFO L225 Difference]: With dead ends: 27 [2020-06-22 09:08:27,625 INFO L226 Difference]: Without dead ends: 23 [2020-06-22 09:08:27,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:08:27,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-06-22 09:08:27,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-06-22 09:08:27,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-06-22 09:08:27,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 38 transitions. [2020-06-22 09:08:27,629 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 38 transitions. Word has length 4 [2020-06-22 09:08:27,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:08:27,629 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 38 transitions. [2020-06-22 09:08:27,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:08:27,629 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2020-06-22 09:08:27,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:08:27,630 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:08:27,630 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:08:27,630 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2020-06-22 09:08:27,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:08:27,630 INFO L82 PathProgramCache]: Analyzing trace with hash 119504158, now seen corresponding path program 1 times [2020-06-22 09:08:27,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:08:27,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:08:27,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:08:27,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:08:27,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:08:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:08:27,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:08:27,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:08:27,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:08:27,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:08:27,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:08:27,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:08:27,665 INFO L87 Difference]: Start difference. First operand 23 states and 38 transitions. Second operand 3 states. [2020-06-22 09:08:27,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:08:27,738 INFO L93 Difference]: Finished difference Result 23 states and 38 transitions. [2020-06-22 09:08:27,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:08:27,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:08:27,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:08:27,739 INFO L225 Difference]: With dead ends: 23 [2020-06-22 09:08:27,739 INFO L226 Difference]: Without dead ends: 19 [2020-06-22 09:08:27,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:08:27,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-06-22 09:08:27,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-06-22 09:08:27,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 09:08:27,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 30 transitions. [2020-06-22 09:08:27,743 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 30 transitions. Word has length 5 [2020-06-22 09:08:27,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:08:27,743 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 30 transitions. [2020-06-22 09:08:27,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:08:27,743 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2020-06-22 09:08:27,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:08:27,744 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:08:27,744 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:08:27,744 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2020-06-22 09:08:27,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:08:27,744 INFO L82 PathProgramCache]: Analyzing trace with hash 119504160, now seen corresponding path program 1 times [2020-06-22 09:08:27,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:08:27,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:08:27,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:08:27,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:08:27,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:08:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:08:27,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:08:27,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:08:27,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:08:27,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:08:27,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:08:27,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:08:27,770 INFO L87 Difference]: Start difference. First operand 19 states and 30 transitions. Second operand 3 states. [2020-06-22 09:08:27,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:08:27,809 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2020-06-22 09:08:27,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:08:27,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:08:27,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:08:27,810 INFO L225 Difference]: With dead ends: 23 [2020-06-22 09:08:27,810 INFO L226 Difference]: Without dead ends: 19 [2020-06-22 09:08:27,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:08:27,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-06-22 09:08:27,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-06-22 09:08:27,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 09:08:27,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2020-06-22 09:08:27,814 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 5 [2020-06-22 09:08:27,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:08:27,814 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2020-06-22 09:08:27,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:08:27,814 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2020-06-22 09:08:27,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:08:27,815 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:08:27,815 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:08:27,815 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2020-06-22 09:08:27,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:08:27,815 INFO L82 PathProgramCache]: Analyzing trace with hash 119504161, now seen corresponding path program 1 times [2020-06-22 09:08:27,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:08:27,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:08:27,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:08:27,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:08:27,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:08:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:08:27,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:08:27,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:08:27,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:08:27,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:08:27,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:08:27,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:08:27,846 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 3 states. [2020-06-22 09:08:27,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:08:27,889 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2020-06-22 09:08:27,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:08:27,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:08:27,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:08:27,890 INFO L225 Difference]: With dead ends: 19 [2020-06-22 09:08:27,890 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 09:08:27,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:08:27,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 09:08:27,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 09:08:27,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 09:08:27,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 09:08:27,892 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2020-06-22 09:08:27,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:08:27,892 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:08:27,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:08:27,892 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:08:27,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 09:08:27,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 09:08:27,930 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2020-06-22 09:08:27,930 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-06-22 09:08:27,930 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 09:08:27,930 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2020-06-22 09:08:27,930 INFO L448 ceAbstractionStarter]: For program point L13-1(lines 13 17) no Hoare annotation was computed. [2020-06-22 09:08:27,931 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2020-06-22 09:08:27,931 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 09:08:27,931 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 09:08:27,931 INFO L444 ceAbstractionStarter]: At program point L13-3(lines 12 17) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (= (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) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base))) [2020-06-22 09:08:27,931 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:08:27,932 INFO L448 ceAbstractionStarter]: For program point L13-4(lines 13 17) no Hoare annotation was computed. [2020-06-22 09:08:27,932 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 09:08:27,932 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 09:08:27,932 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:08:27,932 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 09:08:27,932 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 09:08:27,932 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 09:08:27,932 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 09:08:27,932 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 09:08:27,933 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 09:08:27,933 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 09:08:27,933 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:08:27,933 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 09:08:27,933 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 09:08:27,933 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:08:27,933 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:08:27,933 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:08:27,933 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:08:27,933 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:08:27,934 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:08:27,934 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 09:08:27,934 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:08:27,934 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 09:08:27,934 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2020-06-22 09:08:27,935 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-06-22 09:08:27,935 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2020-06-22 09:08:27,935 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-06-22 09:08:27,935 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2020-06-22 09:08:27,935 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-06-22 09:08:27,935 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 09:08:27,944 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:08:27,945 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:08:27,945 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:08:27,951 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:08:27,951 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:08:27,952 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:08:27,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:08:27 BasicIcfg [2020-06-22 09:08:27,954 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 09:08:27,955 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 09:08:27,955 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 09:08:27,958 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 09:08:27,959 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:08:27,959 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 09:08:25" (1/5) ... [2020-06-22 09:08:27,960 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@421d063e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:08:27, skipping insertion in model container [2020-06-22 09:08:27,960 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:08:27,960 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:08:25" (2/5) ... [2020-06-22 09:08:27,960 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@421d063e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:08:27, skipping insertion in model container [2020-06-22 09:08:27,960 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:08:27,961 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:08:26" (3/5) ... [2020-06-22 09:08:27,961 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@421d063e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:08:27, skipping insertion in model container [2020-06-22 09:08:27,961 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:08:27,961 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:08:26" (4/5) ... [2020-06-22 09:08:27,961 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@421d063e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:08:27, skipping insertion in model container [2020-06-22 09:08:27,961 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:08:27,962 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:08:27" (5/5) ... [2020-06-22 09:08:27,963 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:08:27,984 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:08:27,984 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 09:08:27,984 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 09:08:27,984 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:08:27,984 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:08:27,984 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:08:27,984 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 09:08:27,984 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:08:27,985 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 09:08:27,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states. [2020-06-22 09:08:27,994 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 09:08:27,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:08:27,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:08:27,998 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 09:08:27,998 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:08:27,999 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 09:08:27,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states. [2020-06-22 09:08:28,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 09:08:28,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:08:28,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:08:28,002 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 09:08:28,002 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:08:28,007 INFO L794 eck$LassoCheckResult]: Stem: 33#ULTIMATE.startENTRYtrue [94] 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] 12#L-1true [141] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |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|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |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_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet9_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_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~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~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_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_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~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~ret11=|v_ULTIMATE.start_main_#t~ret11_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet9, 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~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, 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_~c~0.offset, 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~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~ret11, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 13#L10true [72] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (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|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #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_5|, 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_7|, #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_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 29#L10-1true [87] L10-1-->L11: 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_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 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_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, 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_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, 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] 34#L11true [95] L11-->L13-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 31#L13-3true [2020-06-22 09:08:28,008 INFO L796 eck$LassoCheckResult]: Loop: 31#L13-3true [91] L13-3-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, 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~mem3] 38#L13true [101] L13-->L13-1: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 36#L13-1true [100] L13-1-->L14: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem4_6| |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3] 19#L14true [80] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 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)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, 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~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, 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~mem5] 18#L14-1true [191] L14-1-->L15: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_30| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (= (store |v_#memory_int_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15 (store (select |v_#memory_int_21| 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_#t~mem5_6| (- 1)))) |v_#memory_int_20|) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_30|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_30|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, #memory_int] 21#L15true [84] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select |v_#valid_21| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) 1) (= (select (select |v_#memory_int_12| 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~mem6_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_19|, 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_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, 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~mem6] 41#L15-1true [195] L15-1-->L16: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (select |v_#valid_44| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_34| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_15 (store (select |v_#memory_int_26| 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~mem6_6| 1))) |v_#memory_int_25|)) InVars {#valid=|v_#valid_44|, #memory_int=|v_#memory_int_26|, #length=|v_#length_34|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} OutVars{#valid=|v_#valid_44|, #memory_int=|v_#memory_int_25|, #length=|v_#length_34|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem6] 6#L16true [63] L16-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_25| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5))) InVars {#memory_int=|v_#memory_int_15|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 4#L16-1true [196] L16-1-->L13-3: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_35| v_ULTIMATE.start_test_fun_~c~0.base_19)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= 1 (select |v_#valid_45| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= (store |v_#memory_int_28| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_28| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem7_6| 1))) |v_#memory_int_27|)) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_28|, #length=|v_#length_35|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_27|, #length=|v_#length_35|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem7] 31#L13-3true [2020-06-22 09:08:28,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:08:28,009 INFO L82 PathProgramCache]: Analyzing trace with hash 119712640, now seen corresponding path program 1 times [2020-06-22 09:08:28,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:08:28,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:08:28,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:08:28,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:08:28,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:08:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:08:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:08:28,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:08:28,057 INFO L82 PathProgramCache]: Analyzing trace with hash -510456228, now seen corresponding path program 1 times [2020-06-22 09:08:28,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:08:28,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:08:28,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:08:28,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:08:28,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:08:28,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:08:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:08:28,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:08:28,079 INFO L82 PathProgramCache]: Analyzing trace with hash -5250627, now seen corresponding path program 1 times [2020-06-22 09:08:28,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:08:28,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:08:28,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:08:28,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:08:28,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:08:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:08:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:08:28,657 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2020-06-22 09:08:28,814 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-06-22 09:08:28,828 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:08:28,830 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:08:28,830 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:08:28,830 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:08:28,830 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:08:28,830 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:08:28,830 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:08:28,831 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:08:28,831 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 09:08:28,831 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:08:28,831 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:08:28,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:08:28,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:08:28,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:08:28,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:08:28,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:08:29,220 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2020-06-22 09:08:29,335 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2020-06-22 09:08:29,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:08:29,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:08:29,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:08:29,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:08:29,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:08:29,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:08:29,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:08:29,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:08:29,784 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:08:29,789 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:08:29,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:08:29,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:08:29,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:08:29,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:08:29,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:08:29,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:08:29,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:08:29,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:08:29,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:08:29,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:08:29,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:08:29,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:08:29,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:08:29,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:08:29,802 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:08:29,802 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:08:29,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:08:29,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:08:29,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:08:29,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:08:29,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:08:29,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:08:29,808 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:08:29,808 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:08:29,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:08:29,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:08:29,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:08:29,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:08:29,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:08:29,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:08:29,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:08:29,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:08:29,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:08:29,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:08:29,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:08:29,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:08:29,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:08:29,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:08:29,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:08:29,817 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:08:29,817 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:08:29,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:08:29,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:08:29,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:08:29,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:08:29,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:08:29,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:08:29,834 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:08:29,834 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:08:29,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:08:29,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:08:29,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:08:29,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:08:29,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:08:29,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:08:29,866 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:08:29,866 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:08:29,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:08:29,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:08:29,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:08:29,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:08:29,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:08:29,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:08:29,877 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:08:29,878 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:08:29,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:08:29,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:08:29,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:08:29,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:08:29,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:08:29,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:08:29,888 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:08:29,888 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:08:29,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:08:29,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:08:29,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:08:29,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:08:29,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:08:29,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:08:29,893 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:08:29,893 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:08:29,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:08:29,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:08:29,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:08:29,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:08:29,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:08:29,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:08:29,906 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:08:29,907 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:08:29,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:08:29,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:08:29,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:08:29,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:08:29,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:08:29,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:08:29,917 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:08:29,917 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:08:29,933 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:08:29,951 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 09:08:29,951 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2020-06-22 09:08:29,954 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:08:29,956 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:08:29,956 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:08:29,956 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_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 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2020-06-22 09:08:30,047 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 09:08:30,050 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:08:30,050 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:08:30,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:08:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:08:30,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 09:08:30,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:08:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:08:30,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 09:08:30,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:08:30,235 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:08:30,236 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 [2020-06-22 09:08:30,244 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:08:30,272 INFO L497 ElimStorePlain]: treesize reduction 26, result has 53.6 percent of original size [2020-06-22 09:08:30,292 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:08:30,292 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:27 [2020-06-22 09:08:30,356 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:08:30,356 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 34 [2020-06-22 09:08:30,357 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:08:30,364 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2020-06-22 09:08:30,365 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 09:08:30,383 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:08:30,384 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 09:08:30,385 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:47 [2020-06-22 09:08:30,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:08:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:08:30,612 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:08:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:08:30,622 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:08:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:08:30,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 09:08:30,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:08:30,687 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:08:30,688 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 [2020-06-22 09:08:30,694 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:08:30,731 INFO L497 ElimStorePlain]: treesize reduction 43, result has 41.9 percent of original size [2020-06-22 09:08:30,732 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 09:08:30,733 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2020-06-22 09:08:30,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 09:08:30,806 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2020-06-22 09:08:30,807 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:08:30,889 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 09:08:30,889 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 107 [2020-06-22 09:08:30,915 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 09:08:31,063 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 41 [2020-06-22 09:08:31,063 INFO L497 ElimStorePlain]: treesize reduction 144, result has 36.0 percent of original size [2020-06-22 09:08:31,065 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2020-06-22 09:08:31,065 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:77 [2020-06-22 09:08:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:08:31,201 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:08:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:08:31,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 09:08:31,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:08:31,373 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 09:08:31,373 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 105 [2020-06-22 09:08:31,393 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:08:31,496 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 37 [2020-06-22 09:08:31,496 INFO L497 ElimStorePlain]: treesize reduction 134, result has 37.1 percent of original size [2020-06-22 09:08:31,499 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2020-06-22 09:08:31,499 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:70 [2020-06-22 09:09:20,712 WARN L188 SmtUtils]: Spent 40.67 s on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2020-06-22 09:09:20,908 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:09:20,909 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 69 [2020-06-22 09:09:20,913 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:09:20,944 INFO L497 ElimStorePlain]: treesize reduction 26, result has 54.4 percent of original size [2020-06-22 09:09:20,945 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:09:20,945 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:25 [2020-06-22 09:09:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:09:39,929 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:09:39,930 INFO L98 LoopCannibalizer]: 11 predicates before loop cannibalization 20 predicates after loop cannibalization [2020-06-22 09:09:39,934 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 20 loop predicates [2020-06-22 09:09:39,935 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 39 states. Second operand 10 states. [2020-06-22 09:10:20,820 WARN L188 SmtUtils]: Spent 34.99 s on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2020-06-22 09:11:01,394 WARN L188 SmtUtils]: Spent 36.56 s on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2020-06-22 09:11:21,432 WARN L188 SmtUtils]: Spent 12.06 s on a formula simplification. DAG size of input: 48 DAG size of output: 16 [2020-06-22 09:11:34,815 WARN L188 SmtUtils]: Spent 11.79 s on a formula simplification. DAG size of input: 50 DAG size of output: 18 [2020-06-22 09:11:52,545 WARN L188 SmtUtils]: Spent 9.06 s on a formula simplification. DAG size of input: 44 DAG size of output: 20 [2020-06-22 09:12:01,923 WARN L188 SmtUtils]: Spent 9.25 s on a formula simplification. DAG size of input: 47 DAG size of output: 20 [2020-06-22 09:12:14,534 WARN L188 SmtUtils]: Spent 12.50 s on a formula simplification. DAG size of input: 49 DAG size of output: 26 [2020-06-22 09:12:42,095 WARN L188 SmtUtils]: Spent 23.71 s on a formula simplification. DAG size of input: 44 DAG size of output: 20 [2020-06-22 09:13:12,375 WARN L188 SmtUtils]: Spent 26.43 s on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2020-06-22 09:13:12,444 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 39 states.. Second operand 10 states. Result 85 states and 147 transitions. Complement of second has 25 states. [2020-06-22 09:13:12,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 11 non-accepting loop states 2 accepting loop states [2020-06-22 09:13:12,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 09:13:12,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 133 transitions. [2020-06-22 09:13:12,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 133 transitions. Stem has 5 letters. Loop has 9 letters. [2020-06-22 09:13:12,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:13:12,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 133 transitions. Stem has 14 letters. Loop has 9 letters. [2020-06-22 09:13:12,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:13:12,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 133 transitions. Stem has 5 letters. Loop has 18 letters. [2020-06-22 09:13:12,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:13:12,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 147 transitions. [2020-06-22 09:13:12,464 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:13:12,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 0 states and 0 transitions. [2020-06-22 09:13:12,465 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 09:13:12,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 09:13:12,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 09:13:12,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:13:12,466 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:13:12,467 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:13:12,467 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:13:12,467 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 09:13:12,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:13:12,467 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:13:12,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 09:13:12,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:13:12 BasicIcfg [2020-06-22 09:13:12,472 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 09:13:12,473 INFO L168 Benchmark]: Toolchain (without parser) took 286912.04 ms. Allocated memory was 649.6 MB in the beginning and 838.3 MB in the end (delta: 188.7 MB). Free memory was 565.2 MB in the beginning and 506.0 MB in the end (delta: 59.2 MB). Peak memory consumption was 248.0 MB. Max. memory is 50.3 GB. [2020-06-22 09:13:12,474 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:13:12,474 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.37 ms. Allocated memory was 649.6 MB in the beginning and 674.8 MB in the end (delta: 25.2 MB). Free memory was 565.2 MB in the beginning and 638.8 MB in the end (delta: -73.5 MB). Peak memory consumption was 29.1 MB. Max. memory is 50.3 GB. [2020-06-22 09:13:12,474 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.47 ms. Allocated memory is still 674.8 MB. Free memory was 638.8 MB in the beginning and 636.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 09:13:12,475 INFO L168 Benchmark]: Boogie Preprocessor took 22.67 ms. Allocated memory is still 674.8 MB. Free memory was 636.6 MB in the beginning and 635.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 09:13:12,475 INFO L168 Benchmark]: RCFGBuilder took 349.83 ms. Allocated memory is still 674.8 MB. Free memory was 635.5 MB in the beginning and 611.3 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 50.3 GB. [2020-06-22 09:13:12,476 INFO L168 Benchmark]: BlockEncodingV2 took 150.18 ms. Allocated memory is still 674.8 MB. Free memory was 611.3 MB in the beginning and 600.5 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-06-22 09:13:12,476 INFO L168 Benchmark]: TraceAbstraction took 1530.41 ms. Allocated memory is still 674.8 MB. Free memory was 600.5 MB in the beginning and 422.6 MB in the end (delta: 177.9 MB). Peak memory consumption was 177.9 MB. Max. memory is 50.3 GB. [2020-06-22 09:13:12,477 INFO L168 Benchmark]: BuchiAutomizer took 284517.37 ms. Allocated memory was 674.8 MB in the beginning and 838.3 MB in the end (delta: 163.6 MB). Free memory was 421.5 MB in the beginning and 506.0 MB in the end (delta: -84.5 MB). Peak memory consumption was 79.1 MB. Max. memory is 50.3 GB. [2020-06-22 09:13:12,481 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 47 locations, 48 edges - StatisticsResult: Encoded RCFG 39 locations, 70 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 295.37 ms. Allocated memory was 649.6 MB in the beginning and 674.8 MB in the end (delta: 25.2 MB). Free memory was 565.2 MB in the beginning and 638.8 MB in the end (delta: -73.5 MB). Peak memory consumption was 29.1 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.47 ms. Allocated memory is still 674.8 MB. Free memory was 638.8 MB in the beginning and 636.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 22.67 ms. Allocated memory is still 674.8 MB. Free memory was 636.6 MB in the beginning and 635.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 349.83 ms. Allocated memory is still 674.8 MB. Free memory was 635.5 MB in the beginning and 611.3 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 150.18 ms. Allocated memory is still 674.8 MB. Free memory was 611.3 MB in the beginning and 600.5 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1530.41 ms. Allocated memory is still 674.8 MB. Free memory was 600.5 MB in the beginning and 422.6 MB in the end (delta: 177.9 MB). Peak memory consumption was 177.9 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 284517.37 ms. Allocated memory was 674.8 MB in the beginning and 838.3 MB in the end (delta: 163.6 MB). Free memory was 421.5 MB in the beginning and 506.0 MB in the end (delta: -84.5 MB). Peak memory consumption was 79.1 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: 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: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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: 14]: 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: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: 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: 16]: 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: 13]: 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: 12]: Loop Invariant [2020-06-22 09:13:12,490 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:13:12,491 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:13:12,491 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:13:12,492 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:13:12,492 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:13:12,492 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((4 == unknown-#length-unknown[x_ref] && 0 == c) && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[c]) && 1 == \valid[c] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 39 locations, 24 error locations. SAFE Result, 1.4s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 40 SDtfs, 296 SDslu, 6 SDs, 0 SdLazy, 349 SolverSat, 102 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred 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, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 40 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 367 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 -1 * unknown-#memory_int-unknown[y_ref][y_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 284.4s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.5s. Büchi inclusion checks took 281.8s. 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, 269 SDslu, 129 SDs, 0 SdLazy, 796 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital443 mio100 ax100 hnf100 lsp97 ukn42 mio100 lsp39 div100 bol100 ite100 ukn100 eq182 hnf88 smp97 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (1)] Forcibly destroying the process !SESSION 2020-06-22 09:08:22.225 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 09:13:12.719 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check