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.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:40:59,645 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:40:59,647 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:40:59,663 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:40:59,663 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:40:59,664 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:40:59,666 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:40:59,667 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:40:59,669 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:40:59,670 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:40:59,671 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:40:59,671 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:40:59,672 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:40:59,673 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:40:59,674 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:40:59,675 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:40:59,677 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:40:59,681 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:40:59,683 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:40:59,688 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:40:59,689 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:40:59,691 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:40:59,693 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:40:59,693 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:40:59,693 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:40:59,694 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:40:59,695 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:40:59,695 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:40:59,696 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:40:59,698 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:40:59,699 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:40:59,700 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:40:59,700 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:40:59,701 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:40:59,704 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:40:59,705 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:40:59,705 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 09:40:59,731 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:40:59,731 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:40:59,732 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:40:59,733 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:40:59,733 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:40:59,733 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:40:59,734 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:40:59,734 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:40:59,734 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:40:59,734 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:40:59,735 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:40:59,735 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:40:59,735 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:40:59,735 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:40:59,735 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:40:59,736 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:40:59,736 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:40:59,736 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:40:59,736 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:40:59,736 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:40:59,737 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:40:59,737 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:40:59,737 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:40:59,737 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:40:59,737 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:40:59,738 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:40:59,738 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:40:59,738 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:40:59,738 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:40:59,738 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:40:59,738 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 09:40:59,786 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:40:59,802 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:40:59,810 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:40:59,811 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:40:59,812 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:40:59,813 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl [2018-10-04 09:40:59,813 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl' [2018-10-04 09:40:59,883 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:40:59,884 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:40:59,885 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:40:59,885 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:40:59,886 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:40:59,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:40:59" (1/1) ... [2018-10-04 09:40:59,922 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:40:59" (1/1) ... [2018-10-04 09:40:59,931 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:40:59,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:40:59,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:40:59,933 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:40:59,944 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:40:59" (1/1) ... [2018-10-04 09:40:59,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:40:59" (1/1) ... [2018-10-04 09:40:59,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:40:59" (1/1) ... [2018-10-04 09:40:59,948 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:40:59" (1/1) ... [2018-10-04 09:40:59,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:40:59" (1/1) ... [2018-10-04 09:40:59,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:40:59" (1/1) ... [2018-10-04 09:40:59,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:40:59" (1/1) ... [2018-10-04 09:40:59,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:40:59,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:40:59,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:40:59,980 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:40:59,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:40:59" (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:41:00,062 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-04 09:41:00,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 09:41:00,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 09:41:00,636 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 09:41:00,637 INFO L202 PluginConnector]: Adding new model pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:41:00 BoogieIcfgContainer [2018-10-04 09:41:00,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:41:00,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:41:00,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:41:00,642 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:41:00,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:40:59" (1/2) ... [2018-10-04 09:41:00,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63bde0eb and model type pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:41:00, skipping insertion in model container [2018-10-04 09:41:00,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:41:00" (2/2) ... [2018-10-04 09:41:00,646 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl [2018-10-04 09:41:00,655 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:41:00,664 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:41:00,709 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:41:00,710 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:41:00,711 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:41:00,711 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:41:00,711 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:41:00,711 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:41:00,711 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:41:00,711 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:41:00,712 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:41:00,728 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-10-04 09:41:00,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:41:00,734 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:41:00,736 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:41:00,737 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:41:00,744 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:41:00,744 INFO L82 PathProgramCache]: Analyzing trace with hash 738430141, now seen corresponding path program 1 times [2018-10-04 09:41:00,746 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:41:00,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:41:00,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:00,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:41:00,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:41:00,937 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:41:00,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:41:00,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:41:00,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:41:00,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:41:00,960 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:41:00,962 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-10-04 09:41:01,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:41:01,026 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 09:41:01,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:41:01,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-04 09:41:01,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:41:01,049 INFO L225 Difference]: With dead ends: 35 [2018-10-04 09:41:01,050 INFO L226 Difference]: Without dead ends: 18 [2018-10-04 09:41:01,053 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 09:41:01,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-04 09:41:01,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-04 09:41:01,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 09:41:01,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2018-10-04 09:41:01,088 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 15 [2018-10-04 09:41:01,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:41:01,088 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-10-04 09:41:01,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:41:01,088 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2018-10-04 09:41:01,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:41:01,089 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:41:01,089 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:41:01,090 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:41:01,090 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:41:01,090 INFO L82 PathProgramCache]: Analyzing trace with hash 151624127, now seen corresponding path program 1 times [2018-10-04 09:41:01,090 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:41:01,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:41:01,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:01,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:41:01,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:41:01,160 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:41:01,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:41:01,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:41:01,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:41:01,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:41:01,163 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:41:01,163 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand 3 states. [2018-10-04 09:41:01,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:41:01,187 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2018-10-04 09:41:01,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:41:01,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-04 09:41:01,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:41:01,188 INFO L225 Difference]: With dead ends: 35 [2018-10-04 09:41:01,189 INFO L226 Difference]: Without dead ends: 20 [2018-10-04 09:41:01,189 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 09:41:01,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-04 09:41:01,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-04 09:41:01,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 09:41:01,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-10-04 09:41:01,195 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 15 [2018-10-04 09:41:01,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:41:01,196 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-10-04 09:41:01,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:41:01,196 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2018-10-04 09:41:01,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:41:01,197 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:41:01,197 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:41:01,198 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:41:01,198 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:41:01,198 INFO L82 PathProgramCache]: Analyzing trace with hash -549440451, now seen corresponding path program 1 times [2018-10-04 09:41:01,198 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:41:01,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:41:01,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:01,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:41:01,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:41:01,299 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:41:01,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:41:01,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:41:01,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:41:01,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:41:01,300 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:41:01,300 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand 3 states. [2018-10-04 09:41:01,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:41:01,350 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2018-10-04 09:41:01,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:41:01,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-04 09:41:01,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:41:01,352 INFO L225 Difference]: With dead ends: 50 [2018-10-04 09:41:01,352 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 09:41:01,353 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 09:41:01,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 09:41:01,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-10-04 09:41:01,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-04 09:41:01,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2018-10-04 09:41:01,373 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 15 [2018-10-04 09:41:01,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:41:01,374 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2018-10-04 09:41:01,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:41:01,374 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2018-10-04 09:41:01,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:41:01,375 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:41:01,375 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:41:01,375 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:41:01,376 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:41:01,376 INFO L82 PathProgramCache]: Analyzing trace with hash 130617919, now seen corresponding path program 1 times [2018-10-04 09:41:01,376 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:41:01,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:41:01,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:01,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:41:01,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:01,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:41:01,512 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:41:01,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:41:01,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:41:01,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:41:01,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:41:01,513 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:41:01,513 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand 4 states. [2018-10-04 09:41:01,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:41:01,663 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2018-10-04 09:41:01,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:41:01,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-10-04 09:41:01,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:41:01,665 INFO L225 Difference]: With dead ends: 93 [2018-10-04 09:41:01,665 INFO L226 Difference]: Without dead ends: 65 [2018-10-04 09:41:01,666 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 09:41:01,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-04 09:41:01,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 37. [2018-10-04 09:41:01,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-04 09:41:01,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2018-10-04 09:41:01,678 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 15 [2018-10-04 09:41:01,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:41:01,678 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2018-10-04 09:41:01,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:41:01,678 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2018-10-04 09:41:01,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:41:01,679 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:41:01,679 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:41:01,680 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:41:01,680 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:41:01,680 INFO L82 PathProgramCache]: Analyzing trace with hash 130677501, now seen corresponding path program 1 times [2018-10-04 09:41:01,680 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:41:01,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:41:01,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:01,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:41:01,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:41:01,818 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:41:01,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:41:01,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:41:01,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:41:01,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:41:01,819 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:41:01,820 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand 4 states. [2018-10-04 09:41:01,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:41:01,907 INFO L93 Difference]: Finished difference Result 80 states and 107 transitions. [2018-10-04 09:41:01,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:41:01,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-10-04 09:41:01,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:41:01,913 INFO L225 Difference]: With dead ends: 80 [2018-10-04 09:41:01,913 INFO L226 Difference]: Without dead ends: 78 [2018-10-04 09:41:01,913 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 09:41:01,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-04 09:41:01,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 41. [2018-10-04 09:41:01,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-04 09:41:01,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2018-10-04 09:41:01,933 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 15 [2018-10-04 09:41:01,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:41:01,935 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2018-10-04 09:41:01,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:41:01,935 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2018-10-04 09:41:01,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:41:01,936 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:41:01,937 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:41:01,937 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:41:01,937 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:41:01,937 INFO L82 PathProgramCache]: Analyzing trace with hash 187876221, now seen corresponding path program 1 times [2018-10-04 09:41:01,938 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:41:01,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:41:01,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:01,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:41:01,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:41:02,047 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:41:02,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:41:02,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:41:02,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:41:02,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:41:02,049 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:41:02,049 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand 4 states. [2018-10-04 09:41:02,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:41:02,203 INFO L93 Difference]: Finished difference Result 125 states and 167 transitions. [2018-10-04 09:41:02,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 09:41:02,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-10-04 09:41:02,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:41:02,205 INFO L225 Difference]: With dead ends: 125 [2018-10-04 09:41:02,206 INFO L226 Difference]: Without dead ends: 89 [2018-10-04 09:41:02,206 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 2 [2018-10-04 09:41:02,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-04 09:41:02,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-10-04 09:41:02,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-04 09:41:02,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 111 transitions. [2018-10-04 09:41:02,228 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 111 transitions. Word has length 15 [2018-10-04 09:41:02,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:41:02,229 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 111 transitions. [2018-10-04 09:41:02,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:41:02,229 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 111 transitions. [2018-10-04 09:41:02,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-04 09:41:02,231 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:41:02,231 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:41:02,231 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:41:02,232 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:41:02,232 INFO L82 PathProgramCache]: Analyzing trace with hash -152842755, now seen corresponding path program 1 times [2018-10-04 09:41:02,232 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:41:02,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:41:02,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:02,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:41:02,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:41:02,334 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-04 09:41:02,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:41:02,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:41:02,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:41:02,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:41:02,336 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:41:02,336 INFO L87 Difference]: Start difference. First operand 89 states and 111 transitions. Second operand 4 states. [2018-10-04 09:41:02,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:41:02,516 INFO L93 Difference]: Finished difference Result 152 states and 190 transitions. [2018-10-04 09:41:02,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:41:02,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-10-04 09:41:02,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:41:02,519 INFO L225 Difference]: With dead ends: 152 [2018-10-04 09:41:02,519 INFO L226 Difference]: Without dead ends: 94 [2018-10-04 09:41:02,520 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 09:41:02,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-04 09:41:02,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2018-10-04 09:41:02,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-04 09:41:02,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2018-10-04 09:41:02,541 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 41 [2018-10-04 09:41:02,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:41:02,542 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2018-10-04 09:41:02,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:41:02,542 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2018-10-04 09:41:02,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-04 09:41:02,545 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:41:02,545 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:41:02,546 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:41:02,546 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:41:02,546 INFO L82 PathProgramCache]: Analyzing trace with hash -443020421, now seen corresponding path program 2 times [2018-10-04 09:41:02,546 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:41:02,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:41:02,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:02,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:41:02,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:41:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:41:02,635 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-04 09:41:02,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:41:02,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:41:02,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:41:02,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:41:02,636 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:41:02,636 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand 3 states. [2018-10-04 09:41:02,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:41:02,662 INFO L93 Difference]: Finished difference Result 100 states and 119 transitions. [2018-10-04 09:41:02,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:41:02,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-10-04 09:41:02,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:41:02,664 INFO L225 Difference]: With dead ends: 100 [2018-10-04 09:41:02,664 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 09:41:02,664 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 09:41:02,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 09:41:02,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 09:41:02,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 09:41:02,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 09:41:02,665 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2018-10-04 09:41:02,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:41:02,666 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 09:41:02,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:41:02,666 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 09:41:02,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 09:41:02,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 09:41:02,998 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-04 09:41:03,466 WARN L178 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-04 09:41:03,647 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 41 305) no Hoare annotation was computed. [2018-10-04 09:41:03,647 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 41 305) no Hoare annotation was computed. [2018-10-04 09:41:03,648 INFO L421 ceAbstractionStarter]: At program point L218(lines 211 219) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode1 1) (= ~mode3 0)) [2018-10-04 09:41:03,648 INFO L421 ceAbstractionStarter]: At program point L280(lines 280 287) the Hoare annotation is: (and (<= ~r1 0) (not (= ~nomsg ~p3_old)) (<= 1 ULTIMATE.start_main_~c1~73) (<= ~mode1 1) (<= 1 ULTIMATE.start_check_~tmp~63)) [2018-10-04 09:41:03,648 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 41 305) no Hoare annotation was computed. [2018-10-04 09:41:03,648 INFO L421 ceAbstractionStarter]: At program point L223(lines 223 233) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode1 1) (= ~mode3 0)) [2018-10-04 09:41:03,648 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 304) no Hoare annotation was computed. [2018-10-04 09:41:03,649 INFO L421 ceAbstractionStarter]: At program point L273(lines 268 274) the Hoare annotation is: (and (<= ~r1 0) (not (= ~nomsg ~p3_old)) (<= ~mode1 1) (<= 1 ULTIMATE.start_check_~tmp~63)) [2018-10-04 09:41:03,649 INFO L421 ceAbstractionStarter]: At program point L174(lines 174 187) the Hoare annotation is: (let ((.cse0 (<= ~r1 0))) (or (and .cse0 (not (= ~nomsg ~p3_old)) (<= ~mode1 1) (<= 1 ULTIMATE.start_assert_~arg)) (and .cse0 (<= 512 ~mode1) (<= (+ ~mode2 256) 0) (= ~mode3 0)))) [2018-10-04 09:41:03,649 INFO L421 ceAbstractionStarter]: At program point L302(lines 302 303) the Hoare annotation is: false [2018-10-04 09:41:03,649 INFO L421 ceAbstractionStarter]: At program point L294(lines 294 300) the Hoare annotation is: (and (<= ~r1 0) (not (= ~nomsg ~p3_old)) (<= ~mode1 1) (<= 1 ULTIMATE.start_assert_~arg) (<= 1 |ULTIMATE.start_assert_#in~arg|)) [2018-10-04 09:41:03,649 INFO L421 ceAbstractionStarter]: At program point L195(lines 186 196) the Hoare annotation is: (and (<= ~r1 0) (<= (+ ~mode2 256) 0) (<= ~mode1 1) (= ~mode3 0)) [2018-10-04 09:41:03,650 INFO L421 ceAbstractionStarter]: At program point L290(lines 286 291) the Hoare annotation is: (and (<= ~r1 0) (not (= ~nomsg ~p3_old)) (<= ~mode1 1) (<= 1 |ULTIMATE.start_assert_#in~arg|)) [2018-10-04 09:41:03,650 INFO L421 ceAbstractionStarter]: At program point L253(lines 253 259) the Hoare annotation is: (and (<= ~r1 0) (not (= ~nomsg ~p3_old)) (<= ~mode1 1)) [2018-10-04 09:41:03,650 INFO L421 ceAbstractionStarter]: At program point L241(lines 232 242) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode1 1) (not (= ~nomsg ~p3_new))) [2018-10-04 09:41:03,650 INFO L421 ceAbstractionStarter]: At program point L299(lines 169 299) the Hoare annotation is: (let ((.cse0 (<= ~r1 0))) (or (and .cse0 (not (= ~nomsg ~p3_old)) (<= ~mode1 1) (<= 1 ULTIMATE.start_assert_~arg)) (and .cse0 (<= 512 ~mode1) (<= (+ ~mode2 256) 0) (= ~mode3 0)))) [2018-10-04 09:41:03,651 INFO L421 ceAbstractionStarter]: At program point L200(lines 200 212) the Hoare annotation is: (and (<= ~r1 0) (<= (+ ~mode2 256) 0) (<= ~mode1 1) (= ~mode3 0)) [2018-10-04 09:41:03,651 INFO L421 ceAbstractionStarter]: At program point L262(lines 258 269) the Hoare annotation is: (and (<= ~r1 0) (not (= ~nomsg ~p3_old)) (<= ~mode1 1)) [2018-10-04 09:41:03,666 INFO L202 PluginConnector]: Adding new model pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:41:03 BoogieIcfgContainer [2018-10-04 09:41:03,666 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:41:03,667 INFO L168 Benchmark]: Toolchain (without parser) took 3783.80 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 158.6 MB). Peak memory consumption was 158.6 MB. Max. memory is 7.1 GB. [2018-10-04 09:41:03,669 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:41:03,670 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.88 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:41:03,671 INFO L168 Benchmark]: Boogie Preprocessor took 43.90 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:41:03,671 INFO L168 Benchmark]: RCFGBuilder took 660.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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:41:03,673 INFO L168 Benchmark]: TraceAbstraction took 3027.83 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 126.8 MB). Peak memory consumption was 126.8 MB. Max. memory is 7.1 GB. [2018-10-04 09:41:03,678 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.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 46.88 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.90 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 660.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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 3027.83 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 126.8 MB). Peak memory consumption was 126.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 304]: 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: 211]: Loop Invariant Derived loop invariant: (~r1 <= 0 && ~mode1 <= 1) && ~mode3 == 0 - InvariantResult [Line: 258]: Loop Invariant Derived loop invariant: (~r1 <= 0 && !(~nomsg == ~p3_old)) && ~mode1 <= 1 - InvariantResult [Line: 294]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && !(~nomsg == ~p3_old)) && ~mode1 <= 1) && 1 <= assert_~arg) && 1 <= assert_#in~arg - InvariantResult [Line: 232]: Loop Invariant Derived loop invariant: (~r1 <= 0 && ~mode1 <= 1) && !(~nomsg == ~p3_new) - InvariantResult [Line: 268]: Loop Invariant Derived loop invariant: ((~r1 <= 0 && !(~nomsg == ~p3_old)) && ~mode1 <= 1) && 1 <= check_~tmp~63 - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: (~r1 <= 0 && !(~nomsg == ~p3_old)) && ~mode1 <= 1 - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: ((~r1 <= 0 && ~mode2 + 256 <= 0) && ~mode1 <= 1) && ~mode3 == 0 - InvariantResult [Line: 223]: Loop Invariant Derived loop invariant: (~r1 <= 0 && ~mode1 <= 1) && ~mode3 == 0 - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && !(~nomsg == ~p3_old)) && ~mode1 <= 1) && 1 <= assert_~arg) || (((~r1 <= 0 && 512 <= ~mode1) && ~mode2 + 256 <= 0) && ~mode3 == 0) - InvariantResult [Line: 286]: Loop Invariant Derived loop invariant: ((~r1 <= 0 && !(~nomsg == ~p3_old)) && ~mode1 <= 1) && 1 <= assert_#in~arg - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && !(~nomsg == ~p3_old)) && 1 <= main_~c1~73) && ~mode1 <= 1) && 1 <= check_~tmp~63 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((~r1 <= 0 && ~mode2 + 256 <= 0) && ~mode1 <= 1) && ~mode3 == 0 - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && !(~nomsg == ~p3_old)) && ~mode1 <= 1) && 1 <= assert_~arg) || (((~r1 <= 0 && 512 <= ~mode1) && ~mode2 + 256 <= 0) && ~mode3 == 0) - InvariantResult [Line: 302]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. SAFE Result, 2.9s OverallTime, 8 OverallIterations, 5 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 197 SDtfs, 142 SDslu, 197 SDs, 0 SdLazy, 82 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred 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, 8 MinimizatonAttempts, 72 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 29 NumberOfFragments, 206 HoareAnnotationTreeSize, 14 FomulaSimplifications, 202 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 190 ConstructedInterpolants, 0 QuantifiedInterpolants, 10796 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 169/169 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.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-41-03-713.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_09-41-03-713.csv Received shutdown request...