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.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:13:02,631 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:13:02,633 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:13:02,646 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:13:02,646 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:13:02,647 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:13:02,648 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:13:02,650 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:13:02,652 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:13:02,653 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:13:02,653 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:13:02,654 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:13:02,655 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:13:02,656 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:13:02,657 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:13:02,658 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:13:02,659 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:13:02,661 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:13:02,663 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:13:02,664 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:13:02,666 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:13:02,667 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:13:02,670 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:13:02,671 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:13:02,671 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:13:02,672 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:13:02,673 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:13:02,674 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:13:02,675 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:13:02,676 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:13:02,676 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:13:02,677 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:13:02,677 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:13:02,677 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:13:02,678 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:13:02,679 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:13:02,679 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 09:13:02,705 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:13:02,709 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:13:02,710 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:13:02,710 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:13:02,711 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:13:02,711 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:13:02,711 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:13:02,712 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:13:02,713 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:13:02,713 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:13:02,713 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:13:02,714 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:13:02,714 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:13:02,714 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:13:02,714 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:13:02,714 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:13:02,715 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:13:02,716 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:13:02,716 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:13:02,716 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:13:02,717 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:13:02,717 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:13:02,717 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:13:02,718 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:13:02,718 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:13:02,718 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:13:02,718 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:13:02,718 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:13:02,719 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:13:02,719 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:13:02,780 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:13:02,798 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:13:02,804 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:13:02,805 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:13:02,806 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:13:02,807 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.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl [2018-10-04 09:13:02,807 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl' [2018-10-04 09:13:02,904 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:13:02,906 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:13:02,907 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:13:02,907 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:13:02,907 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:13:02,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:13:02" (1/1) ... [2018-10-04 09:13:02,945 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:13:02" (1/1) ... [2018-10-04 09:13:02,953 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:13:02,954 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:13:02,954 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:13:02,954 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:13:02,966 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:13:02" (1/1) ... [2018-10-04 09:13:02,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:13:02" (1/1) ... [2018-10-04 09:13:02,969 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:13:02" (1/1) ... [2018-10-04 09:13:02,969 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:13:02" (1/1) ... [2018-10-04 09:13:02,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:13:02" (1/1) ... [2018-10-04 09:13:02,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:13:02" (1/1) ... [2018-10-04 09:13:02,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:13:02" (1/1) ... [2018-10-04 09:13:02,985 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:13:02,986 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:13:02,986 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:13:02,986 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:13:02,987 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:13:02" (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 09:13:03,060 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-04 09:13:03,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 09:13:03,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 09:13:03,659 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 09:13:03,660 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:13:03 BoogieIcfgContainer [2018-10-04 09:13:03,660 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:13:03,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:13:03,661 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:13:03,664 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:13:03,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:13:02" (1/2) ... [2018-10-04 09:13:03,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2601444 and model type pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:13:03, skipping insertion in model container [2018-10-04 09:13:03,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:13:03" (2/2) ... [2018-10-04 09:13:03,668 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl [2018-10-04 09:13:03,678 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:13:03,687 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:13:03,736 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:13:03,737 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:13:03,737 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:13:03,738 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:13:03,738 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:13:03,738 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:13:03,738 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:13:03,738 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:13:03,738 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:13:03,752 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-10-04 09:13:03,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 09:13:03,759 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:13:03,760 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:13:03,761 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:13:03,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:13:03,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1823027031, now seen corresponding path program 1 times [2018-10-04 09:13:03,770 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:13:03,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:13:03,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:13:03,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:13:03,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:13:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:13:04,018 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 09:13:04,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:13:04,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:13:04,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:13:04,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:13:04,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 09:13:04,043 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 4 states. [2018-10-04 09:13:04,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:13:04,158 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2018-10-04 09:13:04,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:13:04,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-10-04 09:13:04,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:13:04,173 INFO L225 Difference]: With dead ends: 43 [2018-10-04 09:13:04,173 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 09:13:04,177 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 09:13:04,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 09:13:04,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 17. [2018-10-04 09:13:04,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-04 09:13:04,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2018-10-04 09:13:04,221 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 14 [2018-10-04 09:13:04,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:13:04,222 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-10-04 09:13:04,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:13:04,222 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2018-10-04 09:13:04,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 09:13:04,223 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:13:04,223 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:13:04,223 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:13:04,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:13:04,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1823086613, now seen corresponding path program 1 times [2018-10-04 09:13:04,224 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:13:04,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:13:04,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:13:04,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:13:04,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:13:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:13:04,382 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 09:13:04,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:13:04,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:13:04,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:13:04,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:13:04,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 09:13:04,385 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand 4 states. [2018-10-04 09:13:04,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:13:04,501 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2018-10-04 09:13:04,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:13:04,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-10-04 09:13:04,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:13:04,503 INFO L225 Difference]: With dead ends: 47 [2018-10-04 09:13:04,503 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 09:13:04,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 09:13:04,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 09:13:04,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-10-04 09:13:04,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 09:13:04,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-10-04 09:13:04,511 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 14 [2018-10-04 09:13:04,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:13:04,512 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-10-04 09:13:04,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:13:04,512 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2018-10-04 09:13:04,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 09:13:04,513 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:13:04,513 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:13:04,513 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:13:04,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:13:04,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1765828311, now seen corresponding path program 1 times [2018-10-04 09:13:04,514 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:13:04,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:13:04,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:13:04,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:13:04,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:13:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:13:04,592 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 09:13:04,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:13:04,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:13:04,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:13:04,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:13:04,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:13:04,594 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 3 states. [2018-10-04 09:13:04,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:13:04,672 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2018-10-04 09:13:04,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:13:04,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-04 09:13:04,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:13:04,674 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:13:04,674 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 09:13:04,675 INFO L605 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 [2018-10-04 09:13:04,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 09:13:04,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-04 09:13:04,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-04 09:13:04,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-10-04 09:13:04,684 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 14 [2018-10-04 09:13:04,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:13:04,684 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-10-04 09:13:04,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:13:04,685 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2018-10-04 09:13:04,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 09:13:04,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:13:04,686 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:13:04,687 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:13:04,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:13:04,687 INFO L82 PathProgramCache]: Analyzing trace with hash 2023993749, now seen corresponding path program 1 times [2018-10-04 09:13:04,688 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:13:04,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:13:04,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:13:04,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:13:04,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:13:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:13:04,774 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 09:13:04,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:13:04,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:13:04,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:13:04,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:13:04,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:13:04,776 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 3 states. [2018-10-04 09:13:04,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:13:04,813 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2018-10-04 09:13:04,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:13:04,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-04 09:13:04,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:13:04,822 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:13:04,822 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 09:13:04,823 INFO L605 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 [2018-10-04 09:13:04,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 09:13:04,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-04 09:13:04,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-04 09:13:04,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2018-10-04 09:13:04,839 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 14 [2018-10-04 09:13:04,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:13:04,840 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-10-04 09:13:04,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:13:04,841 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2018-10-04 09:13:04,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 09:13:04,842 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:13:04,842 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:13:04,842 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:13:04,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:13:04,843 INFO L82 PathProgramCache]: Analyzing trace with hash 550402615, now seen corresponding path program 1 times [2018-10-04 09:13:04,843 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:13:04,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:13:04,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:13:04,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:13:04,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:13:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:13:04,963 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 09:13:04,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:13:04,964 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 09:13:04,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:13:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:13:05,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:13:05,132 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 09:13:05,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 09:13:05,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-10-04 09:13:05,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 09:13:05,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 09:13:05,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-04 09:13:05,158 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand 6 states. [2018-10-04 09:13:05,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:13:05,431 INFO L93 Difference]: Finished difference Result 127 states and 160 transitions. [2018-10-04 09:13:05,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 09:13:05,436 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-10-04 09:13:05,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:13:05,441 INFO L225 Difference]: With dead ends: 127 [2018-10-04 09:13:05,441 INFO L226 Difference]: Without dead ends: 97 [2018-10-04 09:13:05,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-04 09:13:05,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-04 09:13:05,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 79. [2018-10-04 09:13:05,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-04 09:13:05,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 101 transitions. [2018-10-04 09:13:05,463 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 101 transitions. Word has length 26 [2018-10-04 09:13:05,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:13:05,463 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 101 transitions. [2018-10-04 09:13:05,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 09:13:05,463 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 101 transitions. [2018-10-04 09:13:05,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 09:13:05,465 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:13:05,465 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 09:13:05,467 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:13:05,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:13:05,467 INFO L82 PathProgramCache]: Analyzing trace with hash 943429625, now seen corresponding path program 1 times [2018-10-04 09:13:05,467 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:13:05,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:13:05,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:13:05,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:13:05,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:13:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:13:05,616 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 09:13:05,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:13:05,616 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:13:05,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:13:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:13:05,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:13:05,746 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 09:13:05,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 09:13:05,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-04 09:13:05,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 09:13:05,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 09:13:05,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-04 09:13:05,769 INFO L87 Difference]: Start difference. First operand 79 states and 101 transitions. Second operand 6 states. [2018-10-04 09:13:06,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:13:06,384 INFO L93 Difference]: Finished difference Result 233 states and 295 transitions. [2018-10-04 09:13:06,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:13:06,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-10-04 09:13:06,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:13:06,389 INFO L225 Difference]: With dead ends: 233 [2018-10-04 09:13:06,389 INFO L226 Difference]: Without dead ends: 145 [2018-10-04 09:13:06,393 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-04 09:13:06,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-10-04 09:13:06,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 127. [2018-10-04 09:13:06,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-04 09:13:06,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 157 transitions. [2018-10-04 09:13:06,442 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 157 transitions. Word has length 26 [2018-10-04 09:13:06,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:13:06,442 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 157 transitions. [2018-10-04 09:13:06,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 09:13:06,442 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 157 transitions. [2018-10-04 09:13:06,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 09:13:06,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:13:06,444 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 09:13:06,444 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:13:06,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:13:06,444 INFO L82 PathProgramCache]: Analyzing trace with hash -477798729, now seen corresponding path program 1 times [2018-10-04 09:13:06,444 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:13:06,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:13:06,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:13:06,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:13:06,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:13:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:13:06,505 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-04 09:13:06,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:13:06,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:13:06,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:13:06,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:13:06,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:13:06,507 INFO L87 Difference]: Start difference. First operand 127 states and 157 transitions. Second operand 3 states. [2018-10-04 09:13:06,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:13:06,515 INFO L93 Difference]: Finished difference Result 127 states and 157 transitions. [2018-10-04 09:13:06,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:13:06,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-04 09:13:06,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:13:06,515 INFO L225 Difference]: With dead ends: 127 [2018-10-04 09:13:06,516 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 09:13:06,517 INFO L605 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 [2018-10-04 09:13:06,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 09:13:06,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 09:13:06,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 09:13:06,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 09:13:06,518 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-10-04 09:13:06,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:13:06,518 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 09:13:06,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:13:06,519 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 09:13:06,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 09:13:06,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 09:13:06,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:13:06,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:13:06,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:13:07,070 INFO L421 ceAbstractionStarter]: At program point L225(lines 225 235) the Hoare annotation is: (let ((.cse0 (= 0 (+ ~nomsg 1)))) (or (and (<= 1 ~mode2) .cse0 (not (= (+ ~p1_old 1) 0))) (and (= ~mode1 1) (<= ~r1 0) (= ~mode2 0) .cse0 (<= 0 ~p1_new)))) [2018-10-04 09:13:07,070 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 47 318) no Hoare annotation was computed. [2018-10-04 09:13:07,070 INFO L421 ceAbstractionStarter]: At program point L283(lines 279 284) the Hoare annotation is: (and (= ~mode1 1) (<= 1 ULTIMATE.start_check_~tmp~77) (= ~mode1 ~mode2) (= 0 (+ ~nomsg 1)) (not (= (+ ~p1_old 1) 0))) [2018-10-04 09:13:07,070 INFO L421 ceAbstractionStarter]: At program point L240(lines 234 241) the Hoare annotation is: (and (= ~mode1 1) (<= ~r1 0) (= ~mode1 ~mode2) (= 0 (+ ~nomsg 1)) (<= 0 ~p1_new)) [2018-10-04 09:13:07,071 INFO L421 ceAbstractionStarter]: At program point L304(lines 304 310) the Hoare annotation is: (and (= ~mode1 1) (not (= 0 ULTIMATE.start_assert_~arg)) (= ~mode1 ~mode2) (not (= 0 |ULTIMATE.start_assert_#in~arg|)) (= 0 (+ ~nomsg 1)) (not (= (+ ~p1_old 1) 0))) [2018-10-04 09:13:07,071 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 317) no Hoare annotation was computed. [2018-10-04 09:13:07,071 INFO L421 ceAbstractionStarter]: At program point L300(lines 296 301) the Hoare annotation is: (and (= ~mode1 1) (= ~mode1 ~mode2) (not (= 0 |ULTIMATE.start_assert_#in~arg|)) (= 0 (+ ~nomsg 1)) (not (= (+ ~p1_old 1) 0))) [2018-10-04 09:13:07,071 INFO L421 ceAbstractionStarter]: At program point L199(lines 199 212) the Hoare annotation is: (let ((.cse0 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode1 1) (= ~mode1 ~mode2) .cse0 (not (= (+ ~p1_old 1) 0))) (and (<= ~r1 0) (= ~mode2 0) (<= (+ ~mode1 256) 0) .cse0))) [2018-10-04 09:13:07,072 INFO L421 ceAbstractionStarter]: At program point L290(lines 290 297) the Hoare annotation is: (and (= ~mode1 1) (<= 1 ULTIMATE.start_check_~tmp~77) (= ~mode1 ~mode2) (= 0 (+ ~nomsg 1)) (not (= (+ ~p1_old 1) 0)) (<= 1 ULTIMATE.start_main_~c1~84)) [2018-10-04 09:13:07,072 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 47 318) no Hoare annotation was computed. [2018-10-04 09:13:07,072 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 47 318) no Hoare annotation was computed. [2018-10-04 09:13:07,072 INFO L421 ceAbstractionStarter]: At program point L220(lines 211 221) the Hoare annotation is: (let ((.cse0 (= 0 (+ ~nomsg 1)))) (or (and (<= 1 ~mode2) .cse0 (not (= (+ ~p1_old 1) 0))) (and (= ~mode1 1) (<= ~r1 0) (= ~mode2 0) .cse0 (<= 0 ~p1_new)))) [2018-10-04 09:13:07,072 INFO L421 ceAbstractionStarter]: At program point L315(lines 193 315) the Hoare annotation is: (let ((.cse0 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode1 1) (= ~mode1 ~mode2) .cse0 (not (= (+ ~p1_old 1) 0))) (and (<= ~r1 0) (= ~mode2 0) (<= (+ ~mode1 256) 0) .cse0))) [2018-10-04 09:13:07,073 INFO L421 ceAbstractionStarter]: At program point L245(lines 245 254) the Hoare annotation is: (and (= ~mode1 1) (<= ~r1 0) (= ~mode1 ~mode2) (= 0 (+ ~nomsg 1)) (<= 0 ~p1_new)) [2018-10-04 09:13:07,073 INFO L421 ceAbstractionStarter]: At program point L309(lines 309 316) the Hoare annotation is: false [2018-10-04 09:13:07,073 INFO L421 ceAbstractionStarter]: At program point L272(lines 272 280) the Hoare annotation is: (and (= ~mode1 1) (<= ~r1 0) (= ~mode1 ~mode2) (= 0 (+ ~nomsg 1)) (not (= (+ ~p1_old 1) 0))) [2018-10-04 09:13:07,073 INFO L421 ceAbstractionStarter]: At program point L260(lines 253 261) the Hoare annotation is: (and (= ~mode1 1) (<= ~r1 0) (= ~mode1 ~mode2) (= 0 (+ ~nomsg 1)) (<= 0 ~p1_new)) [2018-10-04 09:13:07,088 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:13:07 BoogieIcfgContainer [2018-10-04 09:13:07,088 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:13:07,089 INFO L168 Benchmark]: Toolchain (without parser) took 4184.21 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 09:13:07,091 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 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 09:13:07,092 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.53 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 09:13:07,093 INFO L168 Benchmark]: Boogie Preprocessor took 31.45 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 09:13:07,093 INFO L168 Benchmark]: RCFGBuilder took 674.43 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 09:13:07,094 INFO L168 Benchmark]: TraceAbstraction took 3427.63 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: 193.0 MB). Peak memory consumption was 193.0 MB. Max. memory is 7.1 GB. [2018-10-04 09:13:07,098 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.22 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 46.53 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 31.45 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 674.43 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 3427.63 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: 193.0 MB). Peak memory consumption was 193.0 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: (((~mode1 == 1 && ~r1 <= 0) && ~mode1 == ~mode2) && 0 == ~nomsg + 1) && 0 <= ~p1_new - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: (((~mode1 == 1 && ~r1 <= 0) && ~mode1 == ~mode2) && 0 == ~nomsg + 1) && !(~p1_old + 1 == 0) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((~mode1 == 1 && 1 <= check_~tmp~77) && ~mode1 == ~mode2) && 0 == ~nomsg + 1) && !(~p1_old + 1 == 0) - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: ((1 <= ~mode2 && 0 == ~nomsg + 1) && !(~p1_old + 1 == 0)) || ((((~mode1 == 1 && ~r1 <= 0) && ~mode2 == 0) && 0 == ~nomsg + 1) && 0 <= ~p1_new) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: (((~mode1 == 1 && ~mode1 == ~mode2) && 0 == ~nomsg + 1) && !(~p1_old + 1 == 0)) || (((~r1 <= 0 && ~mode2 == 0) && ~mode1 + 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 245]: Loop Invariant Derived loop invariant: (((~mode1 == 1 && ~r1 <= 0) && ~mode1 == ~mode2) && 0 == ~nomsg + 1) && 0 <= ~p1_new - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: ((1 <= ~mode2 && 0 == ~nomsg + 1) && !(~p1_old + 1 == 0)) || ((((~mode1 == 1 && ~r1 <= 0) && ~mode2 == 0) && 0 == ~nomsg + 1) && 0 <= ~p1_new) - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: (((~mode1 == 1 && ~mode1 == ~mode2) && !(0 == assert_#in~arg)) && 0 == ~nomsg + 1) && !(~p1_old + 1 == 0) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((~mode1 == 1 && 1 <= check_~tmp~77) && ~mode1 == ~mode2) && 0 == ~nomsg + 1) && !(~p1_old + 1 == 0)) && 1 <= main_~c1~84 - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((~mode1 == 1 && ~mode1 == ~mode2) && 0 == ~nomsg + 1) && !(~p1_old + 1 == 0)) || (((~r1 <= 0 && ~mode2 == 0) && ~mode1 + 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 304]: Loop Invariant Derived loop invariant: ((((~mode1 == 1 && !(0 == assert_~arg)) && ~mode1 == ~mode2) && !(0 == assert_#in~arg)) && 0 == ~nomsg + 1) && !(~p1_old + 1 == 0) - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: (((~mode1 == 1 && ~r1 <= 0) && ~mode1 == ~mode2) && 0 == ~nomsg + 1) && 0 <= ~p1_new - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 3.3s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 158 SDtfs, 212 SDslu, 275 SDs, 0 SdLazy, 119 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred 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, 70 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 39 NumberOfFragments, 310 HoareAnnotationTreeSize, 13 FomulaSimplifications, 521 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 111 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 177 ConstructedInterpolants, 0 QuantifiedInterpolants, 10068 SizeOfPredicates, 0 NumberOfNonLiveVariables, 451 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 56/60 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.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-13-07-116.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_09-13-07-116.csv Received shutdown request...