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.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2eb0a67 [2018-10-03 08:40:10,470 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-03 08:40:10,472 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-03 08:40:10,489 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-03 08:40:10,489 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-03 08:40:10,490 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-03 08:40:10,492 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-03 08:40:10,493 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-03 08:40:10,495 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-03 08:40:10,496 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-03 08:40:10,497 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-03 08:40:10,497 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-03 08:40:10,498 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-03 08:40:10,499 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-03 08:40:10,500 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-03 08:40:10,501 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-03 08:40:10,502 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-03 08:40:10,503 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-03 08:40:10,505 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-03 08:40:10,507 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-03 08:40:10,508 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-03 08:40:10,509 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-03 08:40:10,512 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-03 08:40:10,512 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-03 08:40:10,512 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-03 08:40:10,513 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-03 08:40:10,514 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-03 08:40:10,515 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-03 08:40:10,516 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-03 08:40:10,517 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-03 08:40:10,517 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-03 08:40:10,518 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-03 08:40:10,518 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-03 08:40:10,518 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-03 08:40:10,519 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-03 08:40:10,520 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-03 08:40:10,520 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-03 08:40:10,546 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-03 08:40:10,546 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-03 08:40:10,548 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-03 08:40:10,548 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-03 08:40:10,548 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-03 08:40:10,549 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-03 08:40:10,549 INFO L133 SettingsManager]: * Use SBE=true [2018-10-03 08:40:10,549 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-03 08:40:10,550 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-03 08:40:10,551 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-03 08:40:10,551 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-03 08:40:10,551 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-03 08:40:10,551 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-03 08:40:10,551 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-03 08:40:10,552 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-03 08:40:10,552 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-03 08:40:10,552 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-03 08:40:10,552 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-03 08:40:10,552 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-03 08:40:10,553 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-03 08:40:10,553 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-03 08:40:10,553 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-03 08:40:10,553 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-03 08:40:10,553 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-03 08:40:10,553 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-03 08:40:10,554 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-03 08:40:10,554 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-03 08:40:10,554 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-03 08:40:10,554 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-03 08:40:10,556 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-03 08:40:10,613 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-03 08:40:10,630 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-03 08:40:10,635 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-03 08:40:10,636 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-03 08:40:10,637 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-03 08:40:10,637 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-03 08:40:10,638 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-03 08:40:10,733 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-03 08:40:10,736 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-03 08:40:10,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-03 08:40:10,737 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-03 08:40:10,738 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-03 08:40:10,761 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 03.10 08:40:10" (1/1) ... [2018-10-03 08:40:10,778 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 03.10 08:40:10" (1/1) ... [2018-10-03 08:40:10,785 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-03 08:40:10,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-03 08:40:10,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-03 08:40:10,787 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-03 08:40:10,799 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 03.10 08:40:10" (1/1) ... [2018-10-03 08:40:10,799 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 03.10 08:40:10" (1/1) ... [2018-10-03 08:40:10,811 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 03.10 08:40:10" (1/1) ... [2018-10-03 08:40:10,811 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 03.10 08:40:10" (1/1) ... [2018-10-03 08:40:10,824 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 03.10 08:40:10" (1/1) ... [2018-10-03 08:40:10,830 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 03.10 08:40:10" (1/1) ... [2018-10-03 08:40:10,835 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 03.10 08:40:10" (1/1) ... [2018-10-03 08:40:10,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-03 08:40:10,843 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-03 08:40:10,843 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-03 08:40:10,843 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-03 08:40:10,844 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 03.10 08:40:10" (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-03 08:40:10,927 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-03 08:40:10,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-03 08:40:10,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-03 08:40:11,475 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-03 08:40:11,476 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 03.10 08:40:11 BoogieIcfgContainer [2018-10-03 08:40:11,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-03 08:40:11,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-03 08:40:11,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-03 08:40:11,480 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-03 08:40:11,480 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 03.10 08:40:10" (1/2) ... [2018-10-03 08:40:11,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12975530 and model type pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 08:40:11, skipping insertion in model container [2018-10-03 08:40:11,482 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 03.10 08:40:11" (2/2) ... [2018-10-03 08:40:11,483 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bplTransformedIcfg_BEv2_29.bpl [2018-10-03 08:40:11,494 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-03 08:40:11,504 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-03 08:40:11,557 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-03 08:40:11,558 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-03 08:40:11,559 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-03 08:40:11,559 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-03 08:40:11,559 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-03 08:40:11,559 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-03 08:40:11,559 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-03 08:40:11,560 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-03 08:40:11,560 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-03 08:40:11,581 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-10-03 08:40:11,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-03 08:40:11,597 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:40:11,599 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:40:11,600 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:40:11,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:40:11,607 INFO L82 PathProgramCache]: Analyzing trace with hash 738430141, now seen corresponding path program 1 times [2018-10-03 08:40:11,609 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:40:11,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:40:11,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:40:11,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:40:11,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:40:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:40:11,836 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-03 08:40:11,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:40:11,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 08:40:11,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:40:11,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:40:11,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:40:11,860 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-10-03 08:40:11,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:40:11,930 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-03 08:40:11,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:40:11,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-03 08:40:11,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:40:11,944 INFO L225 Difference]: With dead ends: 35 [2018-10-03 08:40:11,944 INFO L226 Difference]: Without dead ends: 18 [2018-10-03 08:40:11,951 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-03 08:40:11,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-03 08:40:11,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-03 08:40:11,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-03 08:40:11,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2018-10-03 08:40:11,994 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 15 [2018-10-03 08:40:11,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:40:11,994 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-10-03 08:40:11,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:40:11,995 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2018-10-03 08:40:11,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-03 08:40:11,995 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:40:11,996 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:40:11,996 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:40:11,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:40:11,996 INFO L82 PathProgramCache]: Analyzing trace with hash 151624127, now seen corresponding path program 1 times [2018-10-03 08:40:11,997 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:40:11,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:40:11,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:40:11,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:40:11,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:40:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:40:12,079 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-03 08:40:12,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:40:12,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 08:40:12,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:40:12,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:40:12,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:40:12,083 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand 3 states. [2018-10-03 08:40:12,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:40:12,106 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2018-10-03 08:40:12,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:40:12,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-03 08:40:12,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:40:12,107 INFO L225 Difference]: With dead ends: 35 [2018-10-03 08:40:12,108 INFO L226 Difference]: Without dead ends: 20 [2018-10-03 08:40:12,109 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-03 08:40:12,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-03 08:40:12,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-03 08:40:12,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-03 08:40:12,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-10-03 08:40:12,115 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 15 [2018-10-03 08:40:12,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:40:12,115 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-10-03 08:40:12,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:40:12,116 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2018-10-03 08:40:12,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-03 08:40:12,116 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:40:12,117 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:40:12,117 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:40:12,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:40:12,117 INFO L82 PathProgramCache]: Analyzing trace with hash -549440451, now seen corresponding path program 1 times [2018-10-03 08:40:12,118 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:40:12,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:40:12,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:40:12,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:40:12,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:40:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:40:12,232 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-03 08:40:12,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:40:12,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 08:40:12,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:40:12,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:40:12,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:40:12,234 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand 3 states. [2018-10-03 08:40:12,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:40:12,270 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2018-10-03 08:40:12,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:40:12,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-03 08:40:12,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:40:12,272 INFO L225 Difference]: With dead ends: 50 [2018-10-03 08:40:12,272 INFO L226 Difference]: Without dead ends: 35 [2018-10-03 08:40:12,273 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-03 08:40:12,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-03 08:40:12,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-10-03 08:40:12,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-03 08:40:12,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2018-10-03 08:40:12,294 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 15 [2018-10-03 08:40:12,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:40:12,294 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2018-10-03 08:40:12,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:40:12,295 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2018-10-03 08:40:12,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-03 08:40:12,296 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:40:12,296 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:40:12,296 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:40:12,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:40:12,298 INFO L82 PathProgramCache]: Analyzing trace with hash 130617919, now seen corresponding path program 1 times [2018-10-03 08:40:12,298 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:40:12,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:40:12,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:40:12,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:40:12,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:40:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:40:12,435 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-03 08:40:12,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:40:12,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-03 08:40:12,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-03 08:40:12,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-03 08:40:12,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-03 08:40:12,437 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand 4 states. [2018-10-03 08:40:12,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:40:12,546 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2018-10-03 08:40:12,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-03 08:40:12,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-10-03 08:40:12,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:40:12,549 INFO L225 Difference]: With dead ends: 93 [2018-10-03 08:40:12,549 INFO L226 Difference]: Without dead ends: 65 [2018-10-03 08:40:12,550 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-03 08:40:12,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-03 08:40:12,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 37. [2018-10-03 08:40:12,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-03 08:40:12,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2018-10-03 08:40:12,562 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 15 [2018-10-03 08:40:12,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:40:12,563 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2018-10-03 08:40:12,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-03 08:40:12,563 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2018-10-03 08:40:12,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-03 08:40:12,564 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:40:12,564 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:40:12,565 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:40:12,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:40:12,565 INFO L82 PathProgramCache]: Analyzing trace with hash 130677501, now seen corresponding path program 1 times [2018-10-03 08:40:12,565 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:40:12,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:40:12,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:40:12,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:40:12,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:40:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:40:12,692 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-03 08:40:12,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:40:12,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-03 08:40:12,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-03 08:40:12,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-03 08:40:12,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-03 08:40:12,694 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand 4 states. [2018-10-03 08:40:12,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:40:12,907 INFO L93 Difference]: Finished difference Result 80 states and 107 transitions. [2018-10-03 08:40:12,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-03 08:40:12,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-10-03 08:40:12,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:40:12,918 INFO L225 Difference]: With dead ends: 80 [2018-10-03 08:40:12,919 INFO L226 Difference]: Without dead ends: 78 [2018-10-03 08:40:12,919 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-03 08:40:12,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-03 08:40:12,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 41. [2018-10-03 08:40:12,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-03 08:40:12,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2018-10-03 08:40:12,936 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 15 [2018-10-03 08:40:12,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:40:12,937 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2018-10-03 08:40:12,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-03 08:40:12,937 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2018-10-03 08:40:12,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-03 08:40:12,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:40:12,938 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:40:12,941 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:40:12,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:40:12,942 INFO L82 PathProgramCache]: Analyzing trace with hash 187876221, now seen corresponding path program 1 times [2018-10-03 08:40:12,942 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:40:12,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:40:12,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:40:12,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:40:12,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:40:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:40:13,055 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-03 08:40:13,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:40:13,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 08:40:13,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-03 08:40:13,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-03 08:40:13,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-03 08:40:13,057 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand 4 states. [2018-10-03 08:40:13,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:40:13,192 INFO L93 Difference]: Finished difference Result 125 states and 167 transitions. [2018-10-03 08:40:13,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-03 08:40:13,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-10-03 08:40:13,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:40:13,194 INFO L225 Difference]: With dead ends: 125 [2018-10-03 08:40:13,194 INFO L226 Difference]: Without dead ends: 89 [2018-10-03 08:40:13,195 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-03 08:40:13,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-03 08:40:13,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-10-03 08:40:13,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-03 08:40:13,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 111 transitions. [2018-10-03 08:40:13,218 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 111 transitions. Word has length 15 [2018-10-03 08:40:13,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:40:13,218 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 111 transitions. [2018-10-03 08:40:13,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-03 08:40:13,219 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 111 transitions. [2018-10-03 08:40:13,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-03 08:40:13,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:40:13,221 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-03 08:40:13,221 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:40:13,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:40:13,221 INFO L82 PathProgramCache]: Analyzing trace with hash -152842755, now seen corresponding path program 1 times [2018-10-03 08:40:13,222 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:40:13,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:40:13,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:40:13,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:40:13,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:40:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:40:13,342 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-03 08:40:13,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:40:13,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-03 08:40:13,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-03 08:40:13,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-03 08:40:13,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-03 08:40:13,344 INFO L87 Difference]: Start difference. First operand 89 states and 111 transitions. Second operand 4 states. [2018-10-03 08:40:13,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:40:13,746 INFO L93 Difference]: Finished difference Result 152 states and 190 transitions. [2018-10-03 08:40:13,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-03 08:40:13,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-10-03 08:40:13,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:40:13,749 INFO L225 Difference]: With dead ends: 152 [2018-10-03 08:40:13,749 INFO L226 Difference]: Without dead ends: 94 [2018-10-03 08:40:13,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 08:40:13,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-03 08:40:13,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2018-10-03 08:40:13,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-03 08:40:13,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2018-10-03 08:40:13,782 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 41 [2018-10-03 08:40:13,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:40:13,782 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2018-10-03 08:40:13,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-03 08:40:13,783 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2018-10-03 08:40:13,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-03 08:40:13,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:40:13,785 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-03 08:40:13,785 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:40:13,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:40:13,786 INFO L82 PathProgramCache]: Analyzing trace with hash -443020421, now seen corresponding path program 2 times [2018-10-03 08:40:13,786 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:40:13,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:40:13,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:40:13,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:40:13,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:40:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:40:13,877 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-03 08:40:13,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:40:13,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 08:40:13,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:40:13,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:40:13,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:40:13,879 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand 3 states. [2018-10-03 08:40:13,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:40:13,901 INFO L93 Difference]: Finished difference Result 100 states and 119 transitions. [2018-10-03 08:40:13,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:40:13,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-10-03 08:40:13,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:40:13,902 INFO L225 Difference]: With dead ends: 100 [2018-10-03 08:40:13,903 INFO L226 Difference]: Without dead ends: 0 [2018-10-03 08:40:13,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-03 08:40:13,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-03 08:40:13,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-03 08:40:13,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-03 08:40:13,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-03 08:40:13,905 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2018-10-03 08:40:13,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:40:13,905 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-03 08:40:13,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:40:13,905 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-03 08:40:13,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-03 08:40:13,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-03 08:40:14,274 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 41 305) no Hoare annotation was computed. [2018-10-03 08:40:14,274 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 41 305) no Hoare annotation was computed. [2018-10-03 08:40:14,275 INFO L421 ceAbstractionStarter]: At program point L218(lines 211 219) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode1 1) (= ~mode3 0)) [2018-10-03 08:40:14,275 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-03 08:40:14,275 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 41 305) no Hoare annotation was computed. [2018-10-03 08:40:14,275 INFO L421 ceAbstractionStarter]: At program point L223(lines 223 233) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode1 1) (= ~mode3 0)) [2018-10-03 08:40:14,276 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-03 08:40:14,276 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-03 08:40:14,276 INFO L421 ceAbstractionStarter]: At program point L302(lines 302 303) the Hoare annotation is: false [2018-10-03 08:40:14,276 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 304) no Hoare annotation was computed. [2018-10-03 08:40:14,277 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-03 08:40:14,277 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-03 08:40:14,277 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-03 08:40:14,277 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-03 08:40:14,277 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-03 08:40:14,278 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-03 08:40:14,278 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-03 08:40:14,278 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-03 08:40:14,293 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 03.10 08:40:14 BoogieIcfgContainer [2018-10-03 08:40:14,294 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-03 08:40:14,295 INFO L168 Benchmark]: Toolchain (without parser) took 3561.51 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 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-03 08:40:14,297 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 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-03 08:40:14,297 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.11 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-03 08:40:14,298 INFO L168 Benchmark]: Boogie Preprocessor took 52.83 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-03 08:40:14,299 INFO L168 Benchmark]: RCFGBuilder took 633.26 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-03 08:40:14,300 INFO L168 Benchmark]: TraceAbstraction took 2816.98 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.9 MB). Peak memory consumption was 126.9 MB. Max. memory is 7.1 GB. [2018-10-03 08:40:14,304 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.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 49.11 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 52.83 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 633.26 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 2816.98 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.9 MB). Peak memory consumption was 126.9 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.7s OverallTime, 8 OverallIterations, 5 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 197 SDtfs, 142 SDslu, 197 SDs, 0 SdLazy, 82 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s 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.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 190 ConstructedInterpolants, 0 QuantifiedInterpolants, 10740 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.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-03_08-40-14-321.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.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-03_08-40-14-321.csv Received shutdown request...