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.5.2.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-00a8621 [2018-09-30 10:54:26,547 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:54:26,549 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:54:26,561 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:54:26,561 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:54:26,562 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:54:26,564 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:54:26,565 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:54:26,567 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:54:26,568 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:54:26,569 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:54:26,569 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:54:26,570 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:54:26,571 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:54:26,572 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:54:26,573 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:54:26,574 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:54:26,576 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:54:26,578 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:54:26,579 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:54:26,581 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:54:26,582 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:54:26,585 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:54:26,585 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:54:26,585 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:54:26,586 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:54:26,587 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:54:26,588 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:54:26,589 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:54:26,590 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:54:26,590 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:54:26,591 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:54:26,591 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:54:26,591 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:54:26,593 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:54:26,593 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:54:26,594 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-09-30 10:54:26,610 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:54:26,611 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:54:26,612 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:54:26,612 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:54:26,613 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:54:26,614 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:54:26,614 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:54:26,615 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:54:26,615 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:54:26,615 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:54:26,615 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:54:26,615 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:54:26,616 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:54:26,616 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:54:26,616 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:54:26,616 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:54:26,616 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:54:26,618 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:54:26,618 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:54:26,618 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:54:26,618 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:54:26,619 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:54:26,619 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:54:26,619 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:54:26,619 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:54:26,620 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:54:26,620 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:54:26,620 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:54:26,620 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:54:26,620 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:54:26,621 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 10:54:26,681 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:54:26,694 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:54:26,701 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:54:26,703 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:54:26,703 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:54:26,704 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.5.2.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-30 10:54:26,704 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl' [2018-09-30 10:54:26,788 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:54:26,795 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:54:26,796 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:54:26,796 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:54:26,796 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:54:26,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:54:26" (1/1) ... [2018-09-30 10:54:26,836 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:54:26" (1/1) ... [2018-09-30 10:54:26,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:54:26,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:54:26,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:54:26,847 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:54:26,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:54:26" (1/1) ... [2018-09-30 10:54:26,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:54:26" (1/1) ... [2018-09-30 10:54:26,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:54:26" (1/1) ... [2018-09-30 10:54:26,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:54:26" (1/1) ... [2018-09-30 10:54:26,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:54:26" (1/1) ... [2018-09-30 10:54:26,875 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:54:26" (1/1) ... [2018-09-30 10:54:26,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:54:26" (1/1) ... [2018-09-30 10:54:26,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:54:26,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:54:26,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:54:26,890 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:54:26,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:54:26" (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-09-30 10:54:26,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 10:54:26,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 10:54:27,614 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 10:54:27,615 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:54:27 BoogieIcfgContainer [2018-09-30 10:54:27,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:54:27,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:54:27,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:54:27,619 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:54:27,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:54:26" (1/2) ... [2018-09-30 10:54:27,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ca3d80 and model type pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:54:27, skipping insertion in model container [2018-09-30 10:54:27,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:54:27" (2/2) ... [2018-09-30 10:54:27,623 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-30 10:54:27,632 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:54:27,640 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 10:54:27,684 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:54:27,684 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:54:27,685 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:54:27,685 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:54:27,685 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:54:27,685 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:54:27,685 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:54:27,685 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:54:27,686 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:54:27,701 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-09-30 10:54:27,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:54:27,708 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:54:27,709 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:54:27,710 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:54:27,717 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:54:27,717 INFO L82 PathProgramCache]: Analyzing trace with hash -417618663, now seen corresponding path program 1 times [2018-09-30 10:54:27,720 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:54:27,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:54:27,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:27,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:54:27,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:54:27,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:54:27,988 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:54:27,988 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:54:27,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:54:28,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:54:28,009 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:54:28,012 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-09-30 10:54:28,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:54:28,090 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2018-09-30 10:54:28,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:54:28,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-30 10:54:28,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:54:28,104 INFO L225 Difference]: With dead ends: 51 [2018-09-30 10:54:28,104 INFO L226 Difference]: Without dead ends: 33 [2018-09-30 10:54:28,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:54:28,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-30 10:54:28,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-09-30 10:54:28,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-30 10:54:28,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-09-30 10:54:28,151 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 16 [2018-09-30 10:54:28,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:54:28,151 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-09-30 10:54:28,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:54:28,151 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-09-30 10:54:28,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:54:28,152 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:54:28,152 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:54:28,153 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:54:28,153 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:54:28,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1428735913, now seen corresponding path program 1 times [2018-09-30 10:54:28,153 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:54:28,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:54:28,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:28,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:54:28,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:54:28,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:54:28,305 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:54:28,305 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:54:28,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:54:28,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:54:28,307 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:54:28,307 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 3 states. [2018-09-30 10:54:28,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:54:28,477 INFO L93 Difference]: Finished difference Result 91 states and 127 transitions. [2018-09-30 10:54:28,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:54:28,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-30 10:54:28,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:54:28,482 INFO L225 Difference]: With dead ends: 91 [2018-09-30 10:54:28,482 INFO L226 Difference]: Without dead ends: 61 [2018-09-30 10:54:28,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:54:28,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-30 10:54:28,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-09-30 10:54:28,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-30 10:54:28,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2018-09-30 10:54:28,514 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 16 [2018-09-30 10:54:28,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:54:28,515 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2018-09-30 10:54:28,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:54:28,515 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-09-30 10:54:28,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:54:28,516 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:54:28,516 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:54:28,517 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:54:28,517 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:54:28,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1821762923, now seen corresponding path program 1 times [2018-09-30 10:54:28,517 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:54:28,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:54:28,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:28,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:54:28,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:54:28,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:54:28,687 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:54:28,688 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:54:28,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:54:28,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:54:28,689 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:54:28,689 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 3 states. [2018-09-30 10:54:28,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:54:28,808 INFO L93 Difference]: Finished difference Result 175 states and 244 transitions. [2018-09-30 10:54:28,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:54:28,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-30 10:54:28,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:54:28,814 INFO L225 Difference]: With dead ends: 175 [2018-09-30 10:54:28,814 INFO L226 Difference]: Without dead ends: 117 [2018-09-30 10:54:28,815 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:54:28,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-09-30 10:54:28,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-09-30 10:54:28,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-30 10:54:28,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions. [2018-09-30 10:54:28,842 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 158 transitions. Word has length 16 [2018-09-30 10:54:28,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:54:28,843 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 158 transitions. [2018-09-30 10:54:28,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:54:28,843 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 158 transitions. [2018-09-30 10:54:28,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:54:28,844 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:54:28,844 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:54:28,844 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:54:28,845 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:54:28,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1012416297, now seen corresponding path program 1 times [2018-09-30 10:54:28,845 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:54:28,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:54:28,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:28,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:54:28,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:54:28,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:54:28,968 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:54:28,969 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:54:28,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:54:28,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:54:28,970 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:54:28,970 INFO L87 Difference]: Start difference. First operand 115 states and 158 transitions. Second operand 3 states. [2018-09-30 10:54:29,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:54:29,071 INFO L93 Difference]: Finished difference Result 343 states and 472 transitions. [2018-09-30 10:54:29,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:54:29,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-30 10:54:29,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:54:29,074 INFO L225 Difference]: With dead ends: 343 [2018-09-30 10:54:29,075 INFO L226 Difference]: Without dead ends: 229 [2018-09-30 10:54:29,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:54:29,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-09-30 10:54:29,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2018-09-30 10:54:29,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-09-30 10:54:29,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 306 transitions. [2018-09-30 10:54:29,126 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 306 transitions. Word has length 16 [2018-09-30 10:54:29,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:54:29,126 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 306 transitions. [2018-09-30 10:54:29,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:54:29,130 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 306 transitions. [2018-09-30 10:54:29,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:54:29,131 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:54:29,131 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:54:29,132 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:54:29,132 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:54:29,132 INFO L82 PathProgramCache]: Analyzing trace with hash -955157995, now seen corresponding path program 1 times [2018-09-30 10:54:29,132 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:54:29,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:54:29,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:29,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:54:29,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:54:29,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:54:29,214 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:54:29,214 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:54:29,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:54:29,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:54:29,215 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:54:29,215 INFO L87 Difference]: Start difference. First operand 227 states and 306 transitions. Second operand 3 states. [2018-09-30 10:54:29,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:54:29,453 INFO L93 Difference]: Finished difference Result 569 states and 770 transitions. [2018-09-30 10:54:29,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:54:29,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-30 10:54:29,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:54:29,459 INFO L225 Difference]: With dead ends: 569 [2018-09-30 10:54:29,459 INFO L226 Difference]: Without dead ends: 343 [2018-09-30 10:54:29,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:54:29,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-09-30 10:54:29,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2018-09-30 10:54:29,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-09-30 10:54:29,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 456 transitions. [2018-09-30 10:54:29,536 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 456 transitions. Word has length 16 [2018-09-30 10:54:29,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:54:29,536 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 456 transitions. [2018-09-30 10:54:29,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:54:29,537 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 456 transitions. [2018-09-30 10:54:29,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:54:29,537 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:54:29,537 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:54:29,538 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:54:29,538 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:54:29,538 INFO L82 PathProgramCache]: Analyzing trace with hash -955217577, now seen corresponding path program 1 times [2018-09-30 10:54:29,538 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:54:29,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:54:29,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:29,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:54:29,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:54:29,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:54:29,722 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:54:29,723 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:54:29,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:54:29,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:54:29,723 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:54:29,723 INFO L87 Difference]: Start difference. First operand 341 states and 456 transitions. Second operand 4 states. [2018-09-30 10:54:30,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:54:30,183 INFO L93 Difference]: Finished difference Result 610 states and 805 transitions. [2018-09-30 10:54:30,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:54:30,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-09-30 10:54:30,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:54:30,190 INFO L225 Difference]: With dead ends: 610 [2018-09-30 10:54:30,191 INFO L226 Difference]: Without dead ends: 608 [2018-09-30 10:54:30,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:54:30,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-09-30 10:54:30,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 373. [2018-09-30 10:54:30,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-09-30 10:54:30,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 480 transitions. [2018-09-30 10:54:30,267 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 480 transitions. Word has length 16 [2018-09-30 10:54:30,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:54:30,268 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 480 transitions. [2018-09-30 10:54:30,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:54:30,268 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 480 transitions. [2018-09-30 10:54:30,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-30 10:54:30,270 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:54:30,270 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:54:30,271 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:54:30,271 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:54:30,271 INFO L82 PathProgramCache]: Analyzing trace with hash 509433139, now seen corresponding path program 1 times [2018-09-30 10:54:30,271 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:54:30,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:54:30,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:30,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:54:30,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:54:30,389 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:54:30,390 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:54:30,390 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:54:30,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:54:30,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:54:30,391 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:54:30,391 INFO L87 Difference]: Start difference. First operand 373 states and 480 transitions. Second operand 3 states. [2018-09-30 10:54:30,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:54:30,694 INFO L93 Difference]: Finished difference Result 1113 states and 1434 transitions. [2018-09-30 10:54:30,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:54:30,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-09-30 10:54:30,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:54:30,702 INFO L225 Difference]: With dead ends: 1113 [2018-09-30 10:54:30,702 INFO L226 Difference]: Without dead ends: 743 [2018-09-30 10:54:30,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:54:30,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-09-30 10:54:30,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2018-09-30 10:54:30,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-09-30 10:54:30,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 932 transitions. [2018-09-30 10:54:30,813 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 932 transitions. Word has length 30 [2018-09-30 10:54:30,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:54:30,814 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 932 transitions. [2018-09-30 10:54:30,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:54:30,814 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 932 transitions. [2018-09-30 10:54:30,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-30 10:54:30,819 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:54:30,819 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:54:30,822 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:54:30,822 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:54:30,823 INFO L82 PathProgramCache]: Analyzing trace with hash 251267701, now seen corresponding path program 1 times [2018-09-30 10:54:30,823 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:54:30,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:54:30,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:30,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:54:30,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:54:31,176 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:54:31,176 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:54:31,177 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-09-30 10:54:31,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:54:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:54:31,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:54:32,286 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 10:54:32,317 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:54:32,317 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-30 10:54:32,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:54:32,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:54:32,318 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:54:32,318 INFO L87 Difference]: Start difference. First operand 741 states and 932 transitions. Second operand 7 states. [2018-09-30 10:54:36,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:54:36,273 INFO L93 Difference]: Finished difference Result 2109 states and 2642 transitions. [2018-09-30 10:54:36,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 10:54:36,274 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-09-30 10:54:36,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:54:36,281 INFO L225 Difference]: With dead ends: 2109 [2018-09-30 10:54:36,282 INFO L226 Difference]: Without dead ends: 1371 [2018-09-30 10:54:36,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:54:36,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2018-09-30 10:54:36,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 933. [2018-09-30 10:54:36,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-09-30 10:54:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1156 transitions. [2018-09-30 10:54:36,502 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1156 transitions. Word has length 30 [2018-09-30 10:54:36,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:54:36,502 INFO L480 AbstractCegarLoop]: Abstraction has 933 states and 1156 transitions. [2018-09-30 10:54:36,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:54:36,502 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1156 transitions. [2018-09-30 10:54:36,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-30 10:54:36,506 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:54:36,507 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-30 10:54:36,507 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:54:36,507 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:54:36,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1989135149, now seen corresponding path program 2 times [2018-09-30 10:54:36,507 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:54:36,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:54:36,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:36,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:54:36,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:54:36,628 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-09-30 10:54:36,629 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:54:36,629 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:54:36,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:54:36,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:54:36,630 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:54:36,630 INFO L87 Difference]: Start difference. First operand 933 states and 1156 transitions. Second operand 3 states. [2018-09-30 10:54:37,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:54:37,093 INFO L93 Difference]: Finished difference Result 2161 states and 2654 transitions. [2018-09-30 10:54:37,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:54:37,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-09-30 10:54:37,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:54:37,099 INFO L225 Difference]: With dead ends: 2161 [2018-09-30 10:54:37,099 INFO L226 Difference]: Without dead ends: 975 [2018-09-30 10:54:37,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:54:37,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-09-30 10:54:37,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 797. [2018-09-30 10:54:37,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-09-30 10:54:37,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 959 transitions. [2018-09-30 10:54:37,280 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 959 transitions. Word has length 58 [2018-09-30 10:54:37,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:54:37,281 INFO L480 AbstractCegarLoop]: Abstraction has 797 states and 959 transitions. [2018-09-30 10:54:37,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:54:37,281 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 959 transitions. [2018-09-30 10:54:37,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-30 10:54:37,283 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:54:37,283 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-09-30 10:54:37,283 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:54:37,283 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:54:37,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1225807471, now seen corresponding path program 3 times [2018-09-30 10:54:37,284 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:54:37,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:54:37,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:37,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:54:37,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:54:37,344 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-30 10:54:37,345 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:54:37,345 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:54:37,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:54:37,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:54:37,346 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:54:37,346 INFO L87 Difference]: Start difference. First operand 797 states and 959 transitions. Second operand 3 states. [2018-09-30 10:54:37,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:54:37,365 INFO L93 Difference]: Finished difference Result 799 states and 961 transitions. [2018-09-30 10:54:37,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:54:37,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-09-30 10:54:37,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:54:37,366 INFO L225 Difference]: With dead ends: 799 [2018-09-30 10:54:37,366 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 10:54:37,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:54:37,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 10:54:37,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 10:54:37,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 10:54:37,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 10:54:37,368 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-09-30 10:54:37,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:54:37,368 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 10:54:37,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:54:37,368 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 10:54:37,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 10:54:37,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 10:54:37,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:37,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:38,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:54:40,389 WARN L178 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-09-30 10:54:40,626 WARN L178 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-30 10:54:40,987 WARN L178 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 10:54:41,286 WARN L178 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-09-30 10:54:41,717 WARN L178 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-09-30 10:54:41,820 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-09-30 10:54:42,041 WARN L178 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-09-30 10:54:42,188 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-09-30 10:54:42,475 WARN L178 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-09-30 10:54:42,666 WARN L178 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 10:54:43,244 WARN L178 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-09-30 10:54:43,434 WARN L178 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-09-30 10:54:43,646 WARN L178 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-09-30 10:54:44,019 WARN L178 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-09-30 10:54:44,022 INFO L422 ceAbstractionStarter]: At program point L353(lines 344 354) the Hoare annotation is: (let ((.cse6 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~mode4 (* 256 (div ~mode4 256)))) (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_check_~tmp~128) .cse5 (<= 1 ULTIMATE.start_assert_~arg) .cse6 .cse7) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse7))) [2018-09-30 10:54:44,022 INFO L422 ceAbstractionStarter]: At program point L378(lines 378 387) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6 (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-09-30 10:54:44,023 INFO L422 ceAbstractionStarter]: At program point L440(lines 435 441) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-09-30 10:54:44,023 INFO L422 ceAbstractionStarter]: At program point L358(lines 358 368) the Hoare annotation is: (let ((.cse6 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~mode4 (* 256 (div ~mode4 256)))) (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_check_~tmp~128) .cse5 (<= 1 ULTIMATE.start_assert_~arg) .cse6 .cse7) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse7))) [2018-09-30 10:54:44,023 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 91 462) no Hoare annotation was computed. [2018-09-30 10:54:44,023 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 91 462) no Hoare annotation was computed. [2018-09-30 10:54:44,023 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 461) no Hoare annotation was computed. [2018-09-30 10:54:44,023 INFO L422 ceAbstractionStarter]: At program point L429(lines 429 436) the Hoare annotation is: (let ((.cse0 (not (= ~p2_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse6 .cse7))) [2018-09-30 10:54:44,024 INFO L422 ceAbstractionStarter]: At program point L330(lines 325 331) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2) (and (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (= ~mode2 (* 256 (div ~mode2 256)))))) [2018-09-30 10:54:44,024 INFO L422 ceAbstractionStarter]: At program point L450(lines 450 457) the Hoare annotation is: (and (<= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (<= 1 ULTIMATE.start_check_~tmp~128) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg)) [2018-09-30 10:54:44,024 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 91 462) no Hoare annotation was computed. [2018-09-30 10:54:44,024 INFO L422 ceAbstractionStarter]: At program point L413(lines 407 414) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 10:54:44,024 INFO L422 ceAbstractionStarter]: At program point L314(lines 314 326) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-30 10:54:44,024 INFO L422 ceAbstractionStarter]: At program point L335(lines 335 345) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2) (and (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (= ~mode2 (* 256 (div ~mode2 256)))))) [2018-09-30 10:54:44,025 INFO L422 ceAbstractionStarter]: At program point L459(lines 307 459) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-30 10:54:44,025 INFO L422 ceAbstractionStarter]: At program point L393(lines 386 394) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-09-30 10:54:44,025 INFO L422 ceAbstractionStarter]: At program point L373(lines 367 374) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6 (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-09-30 10:54:44,025 INFO L422 ceAbstractionStarter]: At program point L398(lines 398 408) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-09-30 10:54:44,025 INFO L422 ceAbstractionStarter]: At program point L456(lines 456 460) the Hoare annotation is: false [2018-09-30 10:54:44,035 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,036 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,043 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,044 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,050 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,050 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,053 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,056 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,062 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,062 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,068 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,068 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,076 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,078 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,080 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,080 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,088 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,088 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,090 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,090 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,091 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,092 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,093 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,093 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,094 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,095 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,096 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,096 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,098 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,098 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,100 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,100 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,103 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:54:44 BoogieIcfgContainer [2018-09-30 10:54:44,103 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:54:44,104 INFO L168 Benchmark]: Toolchain (without parser) took 17314.71 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 176.2 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -113.2 MB). Peak memory consumption was 621.5 MB. Max. memory is 7.1 GB. [2018-09-30 10:54:44,105 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:54:44,106 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:54:44,106 INFO L168 Benchmark]: Boogie Preprocessor took 39.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:54:44,107 INFO L168 Benchmark]: RCFGBuilder took 725.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-30 10:54:44,108 INFO L168 Benchmark]: TraceAbstraction took 16486.98 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 176.2 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -144.9 MB). Peak memory consumption was 589.8 MB. Max. memory is 7.1 GB. [2018-09-30 10:54:44,112 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 50.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 725.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16486.98 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 176.2 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -144.9 MB). Peak memory consumption was 589.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 461]: 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: 398]: Loop Invariant [2018-09-30 10:54:44,123 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,123 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,124 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,125 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || (((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= check_~tmp~128) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 429]: Loop Invariant [2018-09-30 10:54:44,126 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,126 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,127 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,127 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 450]: Loop Invariant Derived loop invariant: (((((((((assert_~arg <= 1 && !(~p2_old == ~nomsg)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 1 <= check_~tmp~128) && 0 == ~nomsg + 1) && 1 <= assert_~arg - InvariantResult [Line: 344]: Loop Invariant [2018-09-30 10:54:44,128 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,128 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,129 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,130 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) || ((((((((((assert_~arg <= 1 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 1 <= check_~tmp~128) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: ((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 367]: Loop Invariant [2018-09-30 10:54:44,131 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,132 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,133 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,133 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || ((((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256))) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) || (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~mode2 == 256 * (~mode2 / 256)) - InvariantResult [Line: 386]: Loop Invariant [2018-09-30 10:54:44,134 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,134 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,138 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,139 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || (((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 407]: Loop Invariant [2018-09-30 10:54:44,140 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,140 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,140 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,141 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 358]: Loop Invariant [2018-09-30 10:54:44,142 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,142 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,146 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,146 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) || ((((((((((assert_~arg <= 1 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 1 <= check_~tmp~128) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: ((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 378]: Loop Invariant [2018-09-30 10:54:44,149 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,149 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,150 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:54:44,150 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || ((((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256))) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) || (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~mode2 == 256 * (~mode2 / 256)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. SAFE Result, 16.3s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 6.0s AutomataDifference, 0.0s DeadEndRemovalTime, 6.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 300 SDtfs, 277 SDslu, 248 SDs, 0 SdLazy, 185 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=933occurred in iteration=8, 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.7s AutomataMinimizationTime, 10 MinimizatonAttempts, 863 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 275 NumberOfFragments, 1391 HoareAnnotationTreeSize, 15 FomulaSimplifications, 34986 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 15 FomulaSimplificationsInter, 364 FormulaSimplificationTreeSizeReductionInter, 5.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 302 NumberOfCodeBlocks, 302 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 291 ConstructedInterpolants, 10 QuantifiedInterpolants, 30797 SizeOfPredicates, 1 NumberOfNonLiveVariables, 294 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 194/210 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.5.2.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_10-54-44-156.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_10-54-44-156.csv Received shutdown request...