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/20170304-DifficultPathPrograms/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:51:42,467 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:51:42,469 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:51:42,488 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:51:42,489 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:51:42,490 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:51:42,492 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:51:42,494 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:51:42,496 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:51:42,503 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:51:42,504 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:51:42,504 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:51:42,508 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:51:42,509 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:51:42,510 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:51:42,514 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:51:42,515 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:51:42,520 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:51:42,525 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:51:42,529 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:51:42,530 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:51:42,531 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:51:42,537 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:51:42,537 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:51:42,538 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:51:42,539 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:51:42,540 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:51:42,541 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:51:42,542 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:51:42,543 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:51:42,543 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:51:42,544 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:51:42,544 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:51:42,544 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:51:42,545 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:51:42,547 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:51:42,548 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 12:51:42,571 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:51:42,571 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:51:42,572 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:51:42,572 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:51:42,574 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:51:42,574 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:51:42,574 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:51:42,576 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:51:42,576 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:51:42,576 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:51:42,576 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:51:42,576 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:51:42,577 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:51:42,577 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:51:42,577 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:51:42,577 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:51:42,577 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:51:42,579 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:51:42,579 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:51:42,579 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:51:42,579 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:51:42,580 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:51:42,580 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:51:42,580 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:51:42,580 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:51:42,581 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:51:42,581 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:51:42,581 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:51:42,581 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:51:42,581 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:51:42,582 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:51:42,639 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:51:42,659 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:51:42,664 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:51:42,665 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:51:42,666 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:51:42,667 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl [2018-10-04 12:51:42,667 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl' [2018-10-04 12:51:42,772 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:51:42,773 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:51:42,774 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:51:42,774 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:51:42,774 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:51:42,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:51:42" (1/1) ... [2018-10-04 12:51:42,812 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:51:42" (1/1) ... [2018-10-04 12:51:42,821 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:51:42,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:51:42,822 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:51:42,822 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:51:42,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:51:42" (1/1) ... [2018-10-04 12:51:42,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:51:42" (1/1) ... [2018-10-04 12:51:42,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:51:42" (1/1) ... [2018-10-04 12:51:42,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:51:42" (1/1) ... [2018-10-04 12:51:42,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:51:42" (1/1) ... [2018-10-04 12:51:42,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:51:42" (1/1) ... [2018-10-04 12:51:42,864 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:51:42" (1/1) ... [2018-10-04 12:51:42,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:51:42,872 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:51:42,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:51:42,875 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:51:42,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:51:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:51:42,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:51:42,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:51:43,449 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:51:43,450 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:51:43 BoogieIcfgContainer [2018-10-04 12:51:43,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:51:43,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:51:43,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:51:43,454 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:51:43,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:51:42" (1/2) ... [2018-10-04 12:51:43,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73cc425d and model type pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:51:43, skipping insertion in model container [2018-10-04 12:51:43,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:51:43" (2/2) ... [2018-10-04 12:51:43,457 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl [2018-10-04 12:51:43,467 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:51:43,475 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:51:43,525 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:51:43,526 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:51:43,526 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:51:43,526 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:51:43,526 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:51:43,526 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:51:43,527 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:51:43,527 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:51:43,527 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:51:43,543 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2018-10-04 12:51:43,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:51:43,550 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:43,550 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:51:43,552 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:43,558 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:43,559 INFO L82 PathProgramCache]: Analyzing trace with hash -100896173, now seen corresponding path program 1 times [2018-10-04 12:51:43,561 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:43,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:43,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:43,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:51:43,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:43,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:51:43,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:51:43,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:51:43,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:51:43,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:51:43,870 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:43,872 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2018-10-04 12:51:43,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:43,952 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2018-10-04 12:51:43,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:51:43,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-10-04 12:51:43,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:43,966 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:51:43,966 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 12:51:43,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:51:43,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 12:51:44,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-10-04 12:51:44,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-04 12:51:44,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2018-10-04 12:51:44,009 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 12 [2018-10-04 12:51:44,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:44,010 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2018-10-04 12:51:44,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:51:44,010 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2018-10-04 12:51:44,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:51:44,011 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:44,011 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:51:44,011 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:44,012 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:44,012 INFO L82 PathProgramCache]: Analyzing trace with hash -100955755, now seen corresponding path program 1 times [2018-10-04 12:51:44,012 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:44,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:44,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:44,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:51:44,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:44,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:51:44,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:51:44,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:51:44,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:51:44,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:51:44,173 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:44,173 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 4 states. [2018-10-04 12:51:44,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:44,311 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2018-10-04 12:51:44,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:51:44,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-10-04 12:51:44,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:44,313 INFO L225 Difference]: With dead ends: 46 [2018-10-04 12:51:44,313 INFO L226 Difference]: Without dead ends: 44 [2018-10-04 12:51:44,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 3 [2018-10-04 12:51:44,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-04 12:51:44,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 25. [2018-10-04 12:51:44,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-04 12:51:44,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2018-10-04 12:51:44,327 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 12 [2018-10-04 12:51:44,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:44,328 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-10-04 12:51:44,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:51:44,328 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2018-10-04 12:51:44,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:51:44,329 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:44,329 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:51:44,330 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:44,330 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:44,330 INFO L82 PathProgramCache]: Analyzing trace with hash -493923183, now seen corresponding path program 1 times [2018-10-04 12:51:44,330 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:44,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:44,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:44,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:51:44,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:44,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:51:44,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:51:44,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:51:44,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:51:44,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:51:44,467 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:44,467 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 3 states. [2018-10-04 12:51:44,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:44,490 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2018-10-04 12:51:44,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:51:44,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-10-04 12:51:44,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:44,492 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:51:44,492 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:51:44,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:51:44,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:51:44,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-10-04 12:51:44,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-04 12:51:44,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2018-10-04 12:51:44,508 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 12 [2018-10-04 12:51:44,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:44,509 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-10-04 12:51:44,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:51:44,509 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2018-10-04 12:51:44,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 12:51:44,510 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:44,510 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:51:44,511 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:44,511 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:44,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1628792711, now seen corresponding path program 1 times [2018-10-04 12:51:44,511 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:44,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:44,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:44,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:51:44,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:44,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:51:44,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:51:44,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:51:44,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:51:44,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:51:44,677 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:44,677 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand 3 states. [2018-10-04 12:51:44,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:44,743 INFO L93 Difference]: Finished difference Result 111 states and 144 transitions. [2018-10-04 12:51:44,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:51:44,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-04 12:51:44,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:44,746 INFO L225 Difference]: With dead ends: 111 [2018-10-04 12:51:44,746 INFO L226 Difference]: Without dead ends: 75 [2018-10-04 12:51:44,747 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:51:44,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-04 12:51:44,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-10-04 12:51:44,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-04 12:51:44,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 93 transitions. [2018-10-04 12:51:44,765 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 93 transitions. Word has length 22 [2018-10-04 12:51:44,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:44,766 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 93 transitions. [2018-10-04 12:51:44,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:51:44,766 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2018-10-04 12:51:44,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 12:51:44,767 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:44,767 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:51:44,768 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:44,768 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:44,768 INFO L82 PathProgramCache]: Analyzing trace with hash -819446085, now seen corresponding path program 1 times [2018-10-04 12:51:44,768 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:44,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:44,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:44,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:51:44,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:44,843 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:51:44,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:51:44,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:51:44,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:51:44,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:51:44,844 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:44,845 INFO L87 Difference]: Start difference. First operand 73 states and 93 transitions. Second operand 3 states. [2018-10-04 12:51:44,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:44,905 INFO L93 Difference]: Finished difference Result 213 states and 273 transitions. [2018-10-04 12:51:44,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:51:44,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-04 12:51:44,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:44,909 INFO L225 Difference]: With dead ends: 213 [2018-10-04 12:51:44,909 INFO L226 Difference]: Without dead ends: 143 [2018-10-04 12:51:44,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:51:44,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-04 12:51:44,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-10-04 12:51:44,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-04 12:51:44,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 176 transitions. [2018-10-04 12:51:44,942 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 176 transitions. Word has length 22 [2018-10-04 12:51:44,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:44,943 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 176 transitions. [2018-10-04 12:51:44,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:51:44,943 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 176 transitions. [2018-10-04 12:51:44,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 12:51:44,944 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:44,944 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:51:44,945 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:44,945 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:44,945 INFO L82 PathProgramCache]: Analyzing trace with hash -762187783, now seen corresponding path program 1 times [2018-10-04 12:51:44,945 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:44,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:44,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:44,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:51:44,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:45,218 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:51:45,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:51:45,219 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:51:45,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:51:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:45,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:51:45,731 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:51:45,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:51:45,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-04 12:51:45,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:51:45,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:51:45,756 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:45,756 INFO L87 Difference]: Start difference. First operand 141 states and 176 transitions. Second operand 7 states. [2018-10-04 12:51:46,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:46,831 INFO L93 Difference]: Finished difference Result 311 states and 390 transitions. [2018-10-04 12:51:46,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:51:46,835 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-10-04 12:51:46,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:46,837 INFO L225 Difference]: With dead ends: 311 [2018-10-04 12:51:46,837 INFO L226 Difference]: Without dead ends: 213 [2018-10-04 12:51:46,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.5s impTime 13 [2018-10-04 12:51:46,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-10-04 12:51:46,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 177. [2018-10-04 12:51:46,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-04 12:51:46,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 212 transitions. [2018-10-04 12:51:46,891 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 212 transitions. Word has length 22 [2018-10-04 12:51:46,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:46,891 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 212 transitions. [2018-10-04 12:51:46,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:51:46,892 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 212 transitions. [2018-10-04 12:51:46,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-04 12:51:46,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:46,894 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-10-04 12:51:46,894 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:46,895 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:46,895 INFO L82 PathProgramCache]: Analyzing trace with hash 518092167, now seen corresponding path program 2 times [2018-10-04 12:51:46,895 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:46,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:46,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:46,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:51:46,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:46,991 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-04 12:51:46,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:51:46,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:51:46,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:51:46,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:51:46,993 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:46,993 INFO L87 Difference]: Start difference. First operand 177 states and 212 transitions. Second operand 3 states. [2018-10-04 12:51:47,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:47,082 INFO L93 Difference]: Finished difference Result 325 states and 390 transitions. [2018-10-04 12:51:47,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:51:47,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-10-04 12:51:47,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:47,084 INFO L225 Difference]: With dead ends: 325 [2018-10-04 12:51:47,084 INFO L226 Difference]: Without dead ends: 151 [2018-10-04 12:51:47,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:51:47,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-10-04 12:51:47,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 133. [2018-10-04 12:51:47,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-04 12:51:47,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 152 transitions. [2018-10-04 12:51:47,123 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 152 transitions. Word has length 42 [2018-10-04 12:51:47,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:47,124 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 152 transitions. [2018-10-04 12:51:47,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:51:47,124 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 152 transitions. [2018-10-04 12:51:47,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-04 12:51:47,126 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:47,126 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2018-10-04 12:51:47,126 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:47,127 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:47,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1324768879, now seen corresponding path program 3 times [2018-10-04 12:51:47,127 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:47,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:47,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:47,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:51:47,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:47,248 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-10-04 12:51:47,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:51:47,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:51:47,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:51:47,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:51:47,250 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:47,250 INFO L87 Difference]: Start difference. First operand 133 states and 152 transitions. Second operand 3 states. [2018-10-04 12:51:47,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:47,274 INFO L93 Difference]: Finished difference Result 151 states and 171 transitions. [2018-10-04 12:51:47,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:51:47,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-10-04 12:51:47,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:47,276 INFO L225 Difference]: With dead ends: 151 [2018-10-04 12:51:47,276 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:51:47,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:51:47,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:51:47,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:51:47,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:51:47,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:51:47,277 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2018-10-04 12:51:47,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:47,278 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:51:47,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:51:47,278 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:51:47,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:51:47,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:51:47,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:51:47,560 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2018-10-04 12:51:48,068 WARN L178 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-10-04 12:51:48,325 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-10-04 12:51:48,565 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 57 309) no Hoare annotation was computed. [2018-10-04 12:51:48,565 INFO L421 ceAbstractionStarter]: At program point L287(lines 282 288) the Hoare annotation is: (and (<= ~send3 127) (<= 1 ~mode1) (<= ~mode1 1) (<= 1 ULTIMATE.start_check_~tmp~76) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-10-04 12:51:48,566 INFO L421 ceAbstractionStarter]: At program point L221(lines 212 222) the Hoare annotation is: (and (<= ~send3 127) (= ~mode3 (* 256 (div ~mode3 256))) (<= 1 ~mode1) (<= ~mode1 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3)) [2018-10-04 12:51:48,566 INFO L421 ceAbstractionStarter]: At program point L246(lines 246 258) the Hoare annotation is: (and (<= ~send3 127) (= ~mode3 (* 256 (div ~mode3 256))) (<= 1 ~mode1) (<= ~mode1 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3)) [2018-10-04 12:51:48,566 INFO L421 ceAbstractionStarter]: At program point L306(lines 198 306) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= ~r1 (* 256 (div ~r1 256)))) (.cse3 (<= 0 ~send3))) (or (and .cse0 (<= 1 ~mode1) (<= ~mode1 1) (<= ~mode3 1) (<= 1 ~mode3) .cse1 .cse2 .cse3 (not (= ~p3_old ~nomsg))) (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 .cse2 .cse3))) [2018-10-04 12:51:48,566 INFO L421 ceAbstractionStarter]: At program point L205(lines 205 213) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= ~r1 (* 256 (div ~r1 256)))) (.cse3 (<= 0 ~send3))) (or (and .cse0 (<= 1 ~mode1) (<= ~mode1 1) (<= ~mode3 1) (<= 1 ~mode3) .cse1 .cse2 .cse3 (not (= ~p3_old ~nomsg))) (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 .cse2 .cse3))) [2018-10-04 12:51:48,567 INFO L421 ceAbstractionStarter]: At program point L226(lines 226 236) the Hoare annotation is: (and (<= ~send3 127) (= ~mode3 (* 256 (div ~mode3 256))) (<= 1 ~mode1) (<= ~mode1 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3)) [2018-10-04 12:51:48,567 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 57 309) no Hoare annotation was computed. [2018-10-04 12:51:48,567 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 57 309) no Hoare annotation was computed. [2018-10-04 12:51:48,567 INFO L421 ceAbstractionStarter]: At program point L276(lines 276 283) the Hoare annotation is: (and (<= ~send3 127) (<= 1 ~mode1) (<= ~mode1 1) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-10-04 12:51:48,567 INFO L421 ceAbstractionStarter]: At program point L241(lines 235 242) the Hoare annotation is: (and (<= ~send3 127) (= ~mode3 (* 256 (div ~mode3 256))) (<= 1 ~mode1) (<= ~mode1 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3)) [2018-10-04 12:51:48,568 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 308) no Hoare annotation was computed. [2018-10-04 12:51:48,568 INFO L421 ceAbstractionStarter]: At program point L303(lines 303 307) the Hoare annotation is: false [2018-10-04 12:51:48,568 INFO L421 ceAbstractionStarter]: At program point L297(lines 297 304) the Hoare annotation is: (and (<= ULTIMATE.start_assert_~arg 1) (<= (mod ~r1 256) 0) (<= ~send3 127) (<= 1 ~mode1) (<= ~mode1 1) (<= 1 ULTIMATE.start_check_~tmp~76) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-10-04 12:51:48,568 INFO L421 ceAbstractionStarter]: At program point L264(lines 257 265) the Hoare annotation is: (and (<= ~send3 127) (<= 1 ~mode1) (<= ~mode1 1) (<= ~mode3 1) (not (= ~p3_new ~nomsg)) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3)) [2018-10-04 12:51:48,586 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:51:48 BoogieIcfgContainer [2018-10-04 12:51:48,586 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:51:48,587 INFO L168 Benchmark]: Toolchain (without parser) took 5814.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 309.3 MB). Peak memory consumption was 309.3 MB. Max. memory is 7.1 GB. [2018-10-04 12:51:48,589 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:51:48,590 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:51:48,590 INFO L168 Benchmark]: Boogie Preprocessor took 49.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:51:48,591 INFO L168 Benchmark]: RCFGBuilder took 578.19 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-04 12:51:48,593 INFO L168 Benchmark]: TraceAbstraction took 5135.55 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 277.5 MB). Peak memory consumption was 277.5 MB. Max. memory is 7.1 GB. [2018-10-04 12:51:48,598 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.26 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 47.71 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 49.10 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 578.19 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 5135.55 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 277.5 MB). Peak memory consumption was 277.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 308]: 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: 282]: Loop Invariant Derived loop invariant: ((((((((~send3 <= 127 && 1 <= ~mode1) && ~mode1 <= 1) && 1 <= check_~tmp~76) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 246]: Loop Invariant Derived loop invariant: (((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode1) && ~mode1 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: ((((((((~send3 <= 127 && 1 <= ~mode1) && ~mode1 <= 1) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: (((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode1) && ~mode1 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3 - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: (((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode1) && ~mode1 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3 - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: ((((((((~send3 <= 127 && 1 <= ~mode1) && ~mode1 <= 1) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) - InvariantResult [Line: 212]: Loop Invariant Derived loop invariant: (((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode1) && ~mode1 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3 - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((((~send3 <= 127 && 1 <= ~mode1) && ~mode1 <= 1) && ~mode3 <= 1) && !(~p3_new == ~nomsg)) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3 - InvariantResult [Line: 297]: Loop Invariant Derived loop invariant: ((((((((((assert_~arg <= 1 && ~r1 % 256 <= 0) && ~send3 <= 127) && 1 <= ~mode1) && ~mode1 <= 1) && 1 <= check_~tmp~76) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 276]: Loop Invariant Derived loop invariant: (((((((~send3 <= 127 && 1 <= ~mode1) && ~mode1 <= 1) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 1 error locations. SAFE Result, 5.0s OverallTime, 8 OverallIterations, 5 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 168 SDtfs, 136 SDslu, 136 SDs, 0 SdLazy, 142 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred 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, 81 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 11 PreInvPairs, 31 NumberOfFragments, 417 HoareAnnotationTreeSize, 11 FomulaSimplifications, 699 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 62 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 218 NumberOfCodeBlocks, 218 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 209 ConstructedInterpolants, 6 QuantifiedInterpolants, 18623 SizeOfPredicates, 1 NumberOfNonLiveVariables, 195 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 192/200 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-51-48-616.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c_11.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-51-48-616.csv Received shutdown request...