java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:46:33,347 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:46:33,349 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:46:33,362 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:46:33,363 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:46:33,364 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:46:33,365 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:46:33,367 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:46:33,368 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:46:33,369 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:46:33,370 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:46:33,370 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:46:33,371 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:46:33,372 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:46:33,373 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:46:33,374 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:46:33,375 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:46:33,376 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:46:33,378 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:46:33,380 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:46:33,381 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:46:33,382 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:46:33,384 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:46:33,385 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:46:33,385 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:46:33,386 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:46:33,387 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:46:33,387 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:46:33,388 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:46:33,389 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:46:33,389 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:46:33,390 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:46:33,390 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:46:33,391 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:46:33,392 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:46:33,392 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:46:33,392 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 12:46:33,419 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:46:33,419 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:46:33,420 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:46:33,420 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:46:33,424 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:46:33,424 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:46:33,424 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:46:33,425 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:46:33,425 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:46:33,425 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:46:33,425 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:46:33,425 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:46:33,426 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:46:33,427 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:46:33,427 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:46:33,427 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:46:33,427 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:46:33,427 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:46:33,428 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:46:33,428 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:46:33,428 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:46:33,428 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:46:33,429 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:46:33,429 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:46:33,429 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:46:33,429 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:46:33,429 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:46:33,430 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:46:33,431 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:46:33,431 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:46:33,431 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:46:33,491 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:46:33,506 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:46:33,513 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:46:33,515 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:46:33,515 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:46:33,516 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl [2018-10-04 12:46:33,517 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl' [2018-10-04 12:46:33,595 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:46:33,599 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:46:33,600 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:46:33,600 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:46:33,600 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:46:33,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:46:33" (1/1) ... [2018-10-04 12:46:33,639 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:46:33" (1/1) ... [2018-10-04 12:46:33,648 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:46:33,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:46:33,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:46:33,649 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:46:33,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:46:33" (1/1) ... [2018-10-04 12:46:33,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:46:33" (1/1) ... [2018-10-04 12:46:33,672 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:46:33" (1/1) ... [2018-10-04 12:46:33,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:46:33" (1/1) ... [2018-10-04 12:46:33,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:46:33" (1/1) ... [2018-10-04 12:46:33,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:46:33" (1/1) ... [2018-10-04 12:46:33,687 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:46:33" (1/1) ... [2018-10-04 12:46:33,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:46:33,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:46:33,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:46:33,691 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:46:33,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:46:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:46:33,763 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-04 12:46:33,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:46:33,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:46:34,394 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:46:34,395 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:46:34 BoogieIcfgContainer [2018-10-04 12:46:34,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:46:34,396 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:46:34,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:46:34,399 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:46:34,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:46:33" (1/2) ... [2018-10-04 12:46:34,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dff5a8c and model type pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:46:34, skipping insertion in model container [2018-10-04 12:46:34,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:46:34" (2/2) ... [2018-10-04 12:46:34,403 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl [2018-10-04 12:46:34,413 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:46:34,421 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:46:34,472 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:46:34,473 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:46:34,473 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:46:34,473 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:46:34,473 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:46:34,473 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:46:34,473 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:46:34,474 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:46:34,474 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:46:34,489 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-10-04 12:46:34,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:46:34,498 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:46:34,500 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:46:34,504 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:46:34,511 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:46:34,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1823027093, now seen corresponding path program 1 times [2018-10-04 12:46:34,514 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:46:34,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:46:34,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:34,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:46:34,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:46:34,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:46:34,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:46:34,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:46:34,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:46:34,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:46:34,768 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:46:34,770 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-10-04 12:46:34,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:46:34,827 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2018-10-04 12:46:34,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:46:34,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-04 12:46:34,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:46:34,846 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:46:34,846 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 12:46:34,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:46:34,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 12:46:34,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-10-04 12:46:34,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-04 12:46:34,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-10-04 12:46:34,887 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2018-10-04 12:46:34,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:46:34,887 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-10-04 12:46:34,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:46:34,888 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-10-04 12:46:34,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:46:34,888 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:46:34,889 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:46:34,889 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:46:34,889 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:46:34,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1013680467, now seen corresponding path program 1 times [2018-10-04 12:46:34,890 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:46:34,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:46:34,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:34,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:46:34,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:46:35,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:46:35,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:46:35,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:46:35,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:46:35,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:46:35,032 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:46:35,033 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2018-10-04 12:46:35,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:46:35,152 INFO L93 Difference]: Finished difference Result 83 states and 113 transitions. [2018-10-04 12:46:35,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:46:35,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-10-04 12:46:35,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:46:35,154 INFO L225 Difference]: With dead ends: 83 [2018-10-04 12:46:35,154 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:46:35,155 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 3 [2018-10-04 12:46:35,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:46:35,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 31. [2018-10-04 12:46:35,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-04 12:46:35,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2018-10-04 12:46:35,168 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 14 [2018-10-04 12:46:35,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:46:35,168 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2018-10-04 12:46:35,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:46:35,169 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2018-10-04 12:46:35,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:46:35,169 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:46:35,169 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:46:35,171 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:46:35,172 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:46:35,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1013740049, now seen corresponding path program 1 times [2018-10-04 12:46:35,172 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:46:35,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:46:35,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:35,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:46:35,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:35,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:46:35,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:46:35,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:46:35,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:46:35,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:46:35,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:46:35,263 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:46:35,263 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand 4 states. [2018-10-04 12:46:35,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:46:35,420 INFO L93 Difference]: Finished difference Result 75 states and 99 transitions. [2018-10-04 12:46:35,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:46:35,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-10-04 12:46:35,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:46:35,424 INFO L225 Difference]: With dead ends: 75 [2018-10-04 12:46:35,425 INFO L226 Difference]: Without dead ends: 73 [2018-10-04 12:46:35,425 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 3 [2018-10-04 12:46:35,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-04 12:46:35,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 35. [2018-10-04 12:46:35,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 12:46:35,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2018-10-04 12:46:35,441 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 14 [2018-10-04 12:46:35,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:46:35,442 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2018-10-04 12:46:35,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:46:35,442 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2018-10-04 12:46:35,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:46:35,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:46:35,443 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:46:35,444 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:46:35,444 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:46:35,444 INFO L82 PathProgramCache]: Analyzing trace with hash 956422165, now seen corresponding path program 1 times [2018-10-04 12:46:35,444 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:46:35,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:46:35,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:35,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:46:35,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:46:35,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:46:35,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:46:35,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:46:35,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:46:35,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:46:35,541 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:46:35,541 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand 3 states. [2018-10-04 12:46:35,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:46:35,582 INFO L93 Difference]: Finished difference Result 93 states and 120 transitions. [2018-10-04 12:46:35,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:46:35,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-04 12:46:35,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:46:35,584 INFO L225 Difference]: With dead ends: 93 [2018-10-04 12:46:35,584 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:46:35,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:46:35,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:46:35,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-04 12:46:35,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-04 12:46:35,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2018-10-04 12:46:35,603 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 14 [2018-10-04 12:46:35,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:46:35,603 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2018-10-04 12:46:35,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:46:35,603 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2018-10-04 12:46:35,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:46:35,604 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:46:35,605 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:46:35,605 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:46:35,605 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:46:35,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1214587603, now seen corresponding path program 1 times [2018-10-04 12:46:35,606 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:46:35,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:46:35,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:35,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:46:35,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:46:35,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:46:35,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:46:35,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:46:35,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:46:35,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:46:35,672 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:46:35,672 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand 3 states. [2018-10-04 12:46:35,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:46:35,703 INFO L93 Difference]: Finished difference Result 95 states and 121 transitions. [2018-10-04 12:46:35,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:46:35,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-04 12:46:35,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:46:35,710 INFO L225 Difference]: With dead ends: 95 [2018-10-04 12:46:35,710 INFO L226 Difference]: Without dead ends: 61 [2018-10-04 12:46:35,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:46:35,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-04 12:46:35,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-10-04 12:46:35,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-04 12:46:35,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2018-10-04 12:46:35,737 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 14 [2018-10-04 12:46:35,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:46:35,738 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2018-10-04 12:46:35,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:46:35,738 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2018-10-04 12:46:35,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 12:46:35,741 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:46:35,741 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:46:35,741 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:46:35,741 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:46:35,742 INFO L82 PathProgramCache]: Analyzing trace with hash -277256459, now seen corresponding path program 1 times [2018-10-04 12:46:35,742 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:46:35,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:46:35,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:35,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:46:35,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:46:35,878 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:46:35,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:46:35,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:46:35,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:46:35,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:46:35,879 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:46:35,880 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand 3 states. [2018-10-04 12:46:35,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:46:35,909 INFO L93 Difference]: Finished difference Result 121 states and 152 transitions. [2018-10-04 12:46:35,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:46:35,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-04 12:46:35,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:46:35,911 INFO L225 Difference]: With dead ends: 121 [2018-10-04 12:46:35,911 INFO L226 Difference]: Without dead ends: 63 [2018-10-04 12:46:35,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:46:35,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-04 12:46:35,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-10-04 12:46:35,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-04 12:46:35,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2018-10-04 12:46:35,929 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 26 [2018-10-04 12:46:35,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:46:35,930 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2018-10-04 12:46:35,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:46:35,930 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2018-10-04 12:46:35,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 12:46:35,931 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:46:35,931 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:46:35,932 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:46:35,932 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:46:35,932 INFO L82 PathProgramCache]: Analyzing trace with hash 115770551, now seen corresponding path program 1 times [2018-10-04 12:46:35,932 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:46:35,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:46:35,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:35,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:46:35,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:46:35,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:46:36,160 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:46:36,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:46:36,161 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:46:36,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:46:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:46:36,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:46:36,385 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:46:36,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:46:36,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-04 12:46:36,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:46:36,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:46:36,418 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:46:36,419 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand 7 states. [2018-10-04 12:46:37,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:46:37,021 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2018-10-04 12:46:37,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:46:37,024 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-10-04 12:46:37,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:46:37,025 INFO L225 Difference]: With dead ends: 77 [2018-10-04 12:46:37,025 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:46:37,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 8 [2018-10-04 12:46:37,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:46:37,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:46:37,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:46:37,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:46:37,027 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-10-04 12:46:37,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:46:37,028 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:46:37,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:46:37,028 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:46:37,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:46:37,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:46:37,438 WARN L178 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-10-04 12:46:37,846 WARN L178 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2018-10-04 12:46:38,411 WARN L178 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-10-04 12:46:38,731 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-10-04 12:46:38,828 INFO L421 ceAbstractionStarter]: At program point L225(lines 225 235) the Hoare annotation is: (let ((.cse0 (= 0 (+ ~nomsg 1)))) (or (and (<= ~r1 0) .cse0 (<= 0 ~p1_new) (= ~mode3 0)) (and (not (= (+ ~p1_old 1) 0)) (not (= 0 ULTIMATE.start_assert_~arg)) .cse0 (<= ~mode2 1) (<= ~r1 1)))) [2018-10-04 12:46:38,828 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 47 318) no Hoare annotation was computed. [2018-10-04 12:46:38,828 INFO L421 ceAbstractionStarter]: At program point L283(lines 279 284) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode2 1) (<= 1 ULTIMATE.start_check_~tmp~76) (not (= (+ ~p1_old 1) 0)) (= 0 (+ ~nomsg 1))) [2018-10-04 12:46:38,828 INFO L421 ceAbstractionStarter]: At program point L312(lines 193 312) the Hoare annotation is: (let ((.cse0 (<= ~r1 0)) (.cse1 (= 0 (+ ~nomsg 1)))) (or (and (not (= (+ ~p1_old 1) 0)) .cse0 (not (= 0 ULTIMATE.start_assert_~arg)) .cse1 (<= ~mode2 1)) (and .cse0 (<= 512 ~mode1) .cse1 (= ~mode3 0)))) [2018-10-04 12:46:38,829 INFO L421 ceAbstractionStarter]: At program point L240(lines 234 241) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode2 1) (= 0 (+ ~nomsg 1)) (<= 0 ~p1_new) (= ~mode3 0)) [2018-10-04 12:46:38,829 INFO L421 ceAbstractionStarter]: At program point L304(lines 304 313) the Hoare annotation is: (and (<= ~r1 0) (not (= 0 ULTIMATE.start_assert_~arg)) (<= ~mode2 1) (not (= (+ ~p1_old 1) 0)) (= 0 (+ ~nomsg 1)) (not (= 0 |ULTIMATE.start_assert_#in~arg|))) [2018-10-04 12:46:38,829 INFO L421 ceAbstractionStarter]: At program point L300(lines 296 301) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode2 1) (not (= (+ ~p1_old 1) 0)) (= 0 (+ ~nomsg 1)) (not (= 0 |ULTIMATE.start_assert_#in~arg|))) [2018-10-04 12:46:38,829 INFO L421 ceAbstractionStarter]: At program point L199(lines 199 212) the Hoare annotation is: (let ((.cse0 (<= ~r1 0)) (.cse1 (= 0 (+ ~nomsg 1)))) (or (and (not (= (+ ~p1_old 1) 0)) .cse0 (not (= 0 ULTIMATE.start_assert_~arg)) .cse1 (<= ~mode2 1)) (and .cse0 (<= 512 ~mode1) .cse1 (= ~mode3 0)))) [2018-10-04 12:46:38,829 INFO L421 ceAbstractionStarter]: At program point L290(lines 290 297) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode2 1) (<= 1 ULTIMATE.start_check_~tmp~76) (not (= (+ ~p1_old 1) 0)) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_main_~c1~83)) [2018-10-04 12:46:38,830 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 47 318) no Hoare annotation was computed. [2018-10-04 12:46:38,830 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 47 318) no Hoare annotation was computed. [2018-10-04 12:46:38,830 INFO L421 ceAbstractionStarter]: At program point L220(lines 211 221) the Hoare annotation is: (let ((.cse0 (= 0 (+ ~nomsg 1)))) (or (and (<= ~r1 0) .cse0 (<= 0 ~p1_new) (= ~mode3 0)) (and (not (= (+ ~p1_old 1) 0)) (not (= 0 ULTIMATE.start_assert_~arg)) .cse0 (<= ~mode2 1) (<= ~r1 1)))) [2018-10-04 12:46:38,830 INFO L421 ceAbstractionStarter]: At program point L315(lines 315 316) the Hoare annotation is: false [2018-10-04 12:46:38,830 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 317) no Hoare annotation was computed. [2018-10-04 12:46:38,830 INFO L421 ceAbstractionStarter]: At program point L245(lines 245 255) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode2 1) (= 0 (+ ~nomsg 1)) (<= 0 ~p1_new) (= ~mode3 0)) [2018-10-04 12:46:38,830 INFO L421 ceAbstractionStarter]: At program point L272(lines 272 280) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode2 1) (not (= (+ ~p1_old 1) 0)) (= 0 (+ ~nomsg 1))) [2018-10-04 12:46:38,831 INFO L421 ceAbstractionStarter]: At program point L260(lines 254 261) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode2 1) (= 0 (+ ~nomsg 1)) (<= 0 ~p1_new)) [2018-10-04 12:46:38,846 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:46:38 BoogieIcfgContainer [2018-10-04 12:46:38,846 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:46:38,847 INFO L168 Benchmark]: Toolchain (without parser) took 5251.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 224.7 MB). Peak memory consumption was 224.7 MB. Max. memory is 7.1 GB. [2018-10-04 12:46:38,849 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:46:38,851 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:46:38,852 INFO L168 Benchmark]: Boogie Preprocessor took 41.49 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:46:38,852 INFO L168 Benchmark]: RCFGBuilder took 704.35 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-04 12:46:38,854 INFO L168 Benchmark]: TraceAbstraction took 4450.27 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 192.9 MB). Peak memory consumption was 192.9 MB. Max. memory is 7.1 GB. [2018-10-04 12:46:38,859 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 49.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.49 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 704.35 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4450.27 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 192.9 MB). Peak memory consumption was 192.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 317]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 234]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && ~mode2 <= 1) && 0 == ~nomsg + 1) && 0 <= ~p1_new) && ~mode3 == 0 - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: ((~r1 <= 0 && ~mode2 <= 1) && !(~p1_old + 1 == 0)) && 0 == ~nomsg + 1 - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((((!(~p1_old + 1 == 0) && ~r1 <= 0) && !(0 == assert_~arg)) && 0 == ~nomsg + 1) && ~mode2 <= 1) || (((~r1 <= 0 && 512 <= ~mode1) && 0 == ~nomsg + 1) && ~mode3 == 0) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && ~mode2 <= 1) && 1 <= check_~tmp~76) && !(~p1_old + 1 == 0)) && 0 == ~nomsg + 1 - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && 0 == ~nomsg + 1) && 0 <= ~p1_new) && ~mode3 == 0) || ((((!(~p1_old + 1 == 0) && !(0 == assert_~arg)) && 0 == ~nomsg + 1) && ~mode2 <= 1) && ~r1 <= 1) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: ((((!(~p1_old + 1 == 0) && ~r1 <= 0) && !(0 == assert_~arg)) && 0 == ~nomsg + 1) && ~mode2 <= 1) || (((~r1 <= 0 && 512 <= ~mode1) && 0 == ~nomsg + 1) && ~mode3 == 0) - InvariantResult [Line: 245]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && ~mode2 <= 1) && 0 == ~nomsg + 1) && 0 <= ~p1_new) && ~mode3 == 0 - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && 0 == ~nomsg + 1) && 0 <= ~p1_new) && ~mode3 == 0) || ((((!(~p1_old + 1 == 0) && !(0 == assert_~arg)) && 0 == ~nomsg + 1) && ~mode2 <= 1) && ~r1 <= 1) - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && ~mode2 <= 1) && !(~p1_old + 1 == 0)) && 0 == ~nomsg + 1) && !(0 == assert_#in~arg) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((~r1 <= 0 && ~mode2 <= 1) && 1 <= check_~tmp~76) && !(~p1_old + 1 == 0)) && 0 == ~nomsg + 1) && 1 <= main_~c1~83 - InvariantResult [Line: 315]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 304]: Loop Invariant Derived loop invariant: ((((~r1 <= 0 && !(0 == assert_~arg)) && ~mode2 <= 1) && !(~p1_old + 1 == 0)) && 0 == ~nomsg + 1) && !(0 == assert_#in~arg) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: ((~r1 <= 0 && ~mode2 <= 1) && 0 == ~nomsg + 1) && 0 <= ~p1_new - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 4.3s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 1.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 157 SDtfs, 127 SDslu, 136 SDs, 0 SdLazy, 62 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=6, 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.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 66 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 31 NumberOfFragments, 315 HoareAnnotationTreeSize, 13 FomulaSimplifications, 558 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 148 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 148 NumberOfCodeBlocks, 148 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 12366 SizeOfPredicates, 1 NumberOfNonLiveVariables, 227 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 28/36 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-46-38-889.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-46-38-889.csv Received shutdown request...