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-1cc990c [2018-09-30 20:45:45,551 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:45:45,553 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:45:45,566 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:45:45,566 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:45:45,568 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:45:45,570 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:45:45,572 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:45:45,575 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:45:45,584 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:45:45,585 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:45:45,585 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:45:45,586 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:45:45,590 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:45:45,592 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:45:45,592 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:45:45,593 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:45:45,597 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:45:45,600 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:45:45,604 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:45:45,608 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:45:45,609 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:45:45,613 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:45:45,613 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:45:45,613 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:45:45,614 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:45:45,615 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:45:45,617 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:45:45,618 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:45:45,619 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:45:45,619 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:45:45,620 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:45:45,622 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:45:45,622 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:45:45,623 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:45:45,624 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:45:45,624 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 20:45:45,641 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:45:45,641 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:45:45,642 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:45:45,642 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:45:45,643 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:45:45,643 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:45:45,643 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:45:45,643 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:45:45,643 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:45:45,644 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:45:45,644 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:45:45,644 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:45:45,644 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:45:45,644 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:45:45,645 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:45:45,645 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:45:45,645 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:45:45,646 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:45:45,646 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:45:45,646 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:45:45,647 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:45:45,647 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:45:45,647 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:45:45,647 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:45:45,647 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:45:45,648 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:45:45,648 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:45:45,648 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:45:45,648 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:45:45,648 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:45:45,649 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 20:45:45,715 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:45:45,730 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:45:45,737 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:45:45,739 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:45:45,739 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:45:45,740 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 20:45:45,740 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 20:45:45,835 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:45:45,838 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:45:45,839 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:45:45,839 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:45:45,839 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:45:45,857 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 08:45:45" (1/1) ... [2018-09-30 20:45:45,875 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 08:45:45" (1/1) ... [2018-09-30 20:45:45,883 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:45:45,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:45:45,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:45:45,884 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:45:45,895 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 08:45:45" (1/1) ... [2018-09-30 20:45:45,895 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 08:45:45" (1/1) ... [2018-09-30 20:45:45,899 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 08:45:45" (1/1) ... [2018-09-30 20:45:45,900 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 08:45:45" (1/1) ... [2018-09-30 20:45:45,909 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 08:45:45" (1/1) ... [2018-09-30 20:45:45,912 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 08:45:45" (1/1) ... [2018-09-30 20:45:45,915 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 08:45:45" (1/1) ... [2018-09-30 20:45:45,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:45:45,919 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:45:45,920 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:45:45,920 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:45:45,921 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 08:45:45" (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 20:45:45,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 20:45:45,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 20:45:46,678 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 20:45:46,679 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 08:45:46 BoogieIcfgContainer [2018-09-30 20:45:46,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:45:46,680 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:45:46,680 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:45:46,683 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:45:46,683 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 08:45:45" (1/2) ... [2018-09-30 20:45:46,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0f9f19 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 08:45:46, skipping insertion in model container [2018-09-30 20:45:46,685 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 08:45:46" (2/2) ... [2018-09-30 20:45:46,686 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-30 20:45:46,696 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:45:46,705 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 20:45:46,756 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:45:46,757 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:45:46,758 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:45:46,758 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:45:46,758 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:45:46,758 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:45:46,758 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:45:46,759 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:45:46,759 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:45:46,775 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-09-30 20:45:46,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:45:46,782 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:45:46,783 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:45:46,784 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:45:46,791 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:45:46,791 INFO L82 PathProgramCache]: Analyzing trace with hash -417618663, now seen corresponding path program 1 times [2018-09-30 20:45:46,793 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:45:46,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:45:46,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:45:46,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:45:46,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:45:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:45:47,105 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 20:45:47,108 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:45:47,109 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:45:47,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:45:47,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:45:47,126 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:45:47,128 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-09-30 20:45:47,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:45:47,256 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2018-09-30 20:45:47,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:45:47,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-30 20:45:47,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:45:47,271 INFO L225 Difference]: With dead ends: 51 [2018-09-30 20:45:47,271 INFO L226 Difference]: Without dead ends: 33 [2018-09-30 20:45:47,275 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 20:45:47,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-30 20:45:47,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-09-30 20:45:47,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-30 20:45:47,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-09-30 20:45:47,330 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 16 [2018-09-30 20:45:47,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:45:47,330 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-09-30 20:45:47,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:45:47,331 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-09-30 20:45:47,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:45:47,332 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:45:47,332 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:45:47,332 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:45:47,332 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:45:47,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1428735913, now seen corresponding path program 1 times [2018-09-30 20:45:47,333 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:45:47,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:45:47,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:45:47,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:45:47,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:45:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:45:47,493 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 20:45:47,493 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:45:47,493 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:45:47,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:45:47,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:45:47,496 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:45:47,496 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 3 states. [2018-09-30 20:45:47,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:45:47,562 INFO L93 Difference]: Finished difference Result 91 states and 127 transitions. [2018-09-30 20:45:47,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:45:47,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-30 20:45:47,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:45:47,565 INFO L225 Difference]: With dead ends: 91 [2018-09-30 20:45:47,565 INFO L226 Difference]: Without dead ends: 61 [2018-09-30 20:45:47,566 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 20:45:47,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-30 20:45:47,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-09-30 20:45:47,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-30 20:45:47,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2018-09-30 20:45:47,585 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 16 [2018-09-30 20:45:47,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:45:47,585 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2018-09-30 20:45:47,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:45:47,586 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-09-30 20:45:47,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:45:47,586 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:45:47,587 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:45:47,587 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:45:47,587 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:45:47,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1821762923, now seen corresponding path program 1 times [2018-09-30 20:45:47,588 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:45:47,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:45:47,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:45:47,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:45:47,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:45:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:45:47,707 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 20:45:47,707 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:45:47,708 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:45:47,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:45:47,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:45:47,709 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:45:47,709 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 3 states. [2018-09-30 20:45:47,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:45:47,804 INFO L93 Difference]: Finished difference Result 175 states and 244 transitions. [2018-09-30 20:45:47,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:45:47,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-30 20:45:47,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:45:47,808 INFO L225 Difference]: With dead ends: 175 [2018-09-30 20:45:47,808 INFO L226 Difference]: Without dead ends: 117 [2018-09-30 20:45:47,809 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 20:45:47,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-09-30 20:45:47,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-09-30 20:45:47,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-30 20:45:47,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions. [2018-09-30 20:45:47,837 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 158 transitions. Word has length 16 [2018-09-30 20:45:47,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:45:47,837 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 158 transitions. [2018-09-30 20:45:47,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:45:47,838 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 158 transitions. [2018-09-30 20:45:47,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:45:47,838 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:45:47,839 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:45:47,839 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:45:47,839 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:45:47,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1012416297, now seen corresponding path program 1 times [2018-09-30 20:45:47,840 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:45:47,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:45:47,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:45:47,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:45:47,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:45:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:45:47,991 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 20:45:47,992 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:45:47,992 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:45:47,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:45:47,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:45:47,993 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:45:47,993 INFO L87 Difference]: Start difference. First operand 115 states and 158 transitions. Second operand 3 states. [2018-09-30 20:45:48,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:45:48,159 INFO L93 Difference]: Finished difference Result 343 states and 472 transitions. [2018-09-30 20:45:48,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:45:48,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-30 20:45:48,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:45:48,167 INFO L225 Difference]: With dead ends: 343 [2018-09-30 20:45:48,167 INFO L226 Difference]: Without dead ends: 229 [2018-09-30 20:45:48,172 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 20:45:48,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-09-30 20:45:48,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2018-09-30 20:45:48,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-09-30 20:45:48,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 306 transitions. [2018-09-30 20:45:48,245 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 306 transitions. Word has length 16 [2018-09-30 20:45:48,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:45:48,249 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 306 transitions. [2018-09-30 20:45:48,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:45:48,250 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 306 transitions. [2018-09-30 20:45:48,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:45:48,251 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:45:48,251 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:45:48,251 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:45:48,251 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:45:48,252 INFO L82 PathProgramCache]: Analyzing trace with hash -955157995, now seen corresponding path program 1 times [2018-09-30 20:45:48,252 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:45:48,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:45:48,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:45:48,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:45:48,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:45:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:45:48,357 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 20:45:48,357 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:45:48,357 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:45:48,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:45:48,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:45:48,358 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:45:48,358 INFO L87 Difference]: Start difference. First operand 227 states and 306 transitions. Second operand 3 states. [2018-09-30 20:45:48,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:45:48,545 INFO L93 Difference]: Finished difference Result 569 states and 770 transitions. [2018-09-30 20:45:48,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:45:48,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-30 20:45:48,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:45:48,549 INFO L225 Difference]: With dead ends: 569 [2018-09-30 20:45:48,549 INFO L226 Difference]: Without dead ends: 343 [2018-09-30 20:45:48,551 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 20:45:48,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-09-30 20:45:48,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2018-09-30 20:45:48,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-09-30 20:45:48,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 456 transitions. [2018-09-30 20:45:48,603 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 456 transitions. Word has length 16 [2018-09-30 20:45:48,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:45:48,603 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 456 transitions. [2018-09-30 20:45:48,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:45:48,604 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 456 transitions. [2018-09-30 20:45:48,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:45:48,604 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:45:48,605 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:45:48,605 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:45:48,605 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:45:48,605 INFO L82 PathProgramCache]: Analyzing trace with hash -955217577, now seen corresponding path program 1 times [2018-09-30 20:45:48,606 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:45:48,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:45:48,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:45:48,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:45:48,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:45:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:45:48,837 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 20:45:48,838 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:45:48,838 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:45:48,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 20:45:48,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 20:45:48,839 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:45:48,839 INFO L87 Difference]: Start difference. First operand 341 states and 456 transitions. Second operand 4 states. [2018-09-30 20:45:49,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:45:49,413 INFO L93 Difference]: Finished difference Result 610 states and 805 transitions. [2018-09-30 20:45:49,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 20:45:49,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-09-30 20:45:49,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:45:49,420 INFO L225 Difference]: With dead ends: 610 [2018-09-30 20:45:49,420 INFO L226 Difference]: Without dead ends: 608 [2018-09-30 20:45:49,420 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:45:49,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-09-30 20:45:49,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 373. [2018-09-30 20:45:49,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-09-30 20:45:49,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 480 transitions. [2018-09-30 20:45:49,495 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 480 transitions. Word has length 16 [2018-09-30 20:45:49,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:45:49,496 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 480 transitions. [2018-09-30 20:45:49,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 20:45:49,497 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 480 transitions. [2018-09-30 20:45:49,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-30 20:45:49,499 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:45:49,499 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 20:45:49,500 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:45:49,500 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:45:49,500 INFO L82 PathProgramCache]: Analyzing trace with hash 509433139, now seen corresponding path program 1 times [2018-09-30 20:45:49,502 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:45:49,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:45:49,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:45:49,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:45:49,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:45:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:45:49,646 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 20:45:49,646 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:45:49,646 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:45:49,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:45:49,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:45:49,647 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:45:49,647 INFO L87 Difference]: Start difference. First operand 373 states and 480 transitions. Second operand 3 states. [2018-09-30 20:45:49,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:45:49,939 INFO L93 Difference]: Finished difference Result 1113 states and 1434 transitions. [2018-09-30 20:45:49,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:45:49,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-09-30 20:45:49,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:45:49,948 INFO L225 Difference]: With dead ends: 1113 [2018-09-30 20:45:49,948 INFO L226 Difference]: Without dead ends: 743 [2018-09-30 20:45:49,949 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 20:45:49,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-09-30 20:45:50,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2018-09-30 20:45:50,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-09-30 20:45:50,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 932 transitions. [2018-09-30 20:45:50,061 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 932 transitions. Word has length 30 [2018-09-30 20:45:50,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:45:50,061 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 932 transitions. [2018-09-30 20:45:50,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:45:50,062 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 932 transitions. [2018-09-30 20:45:50,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-30 20:45:50,065 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:45:50,065 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 20:45:50,069 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:45:50,069 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:45:50,070 INFO L82 PathProgramCache]: Analyzing trace with hash 251267701, now seen corresponding path program 1 times [2018-09-30 20:45:50,070 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:45:50,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:45:50,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:45:50,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:45:50,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:45:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:45:50,236 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 20:45:50,237 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:45:50,237 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 20:45:50,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:45:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:45:50,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:45:51,438 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 20:45:51,473 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:45:51,474 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-30 20:45:51,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:45:51,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:45:51,476 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:45:51,476 INFO L87 Difference]: Start difference. First operand 741 states and 932 transitions. Second operand 7 states. [2018-09-30 20:45:57,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:45:57,250 INFO L93 Difference]: Finished difference Result 2109 states and 2642 transitions. [2018-09-30 20:45:57,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 20:45:57,251 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-09-30 20:45:57,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:45:57,258 INFO L225 Difference]: With dead ends: 2109 [2018-09-30 20:45:57,258 INFO L226 Difference]: Without dead ends: 1371 [2018-09-30 20:45:57,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time [2018-09-30 20:45:57,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2018-09-30 20:45:57,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 933. [2018-09-30 20:45:57,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-09-30 20:45:57,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1156 transitions. [2018-09-30 20:45:57,469 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1156 transitions. Word has length 30 [2018-09-30 20:45:57,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:45:57,470 INFO L480 AbstractCegarLoop]: Abstraction has 933 states and 1156 transitions. [2018-09-30 20:45:57,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:45:57,470 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1156 transitions. [2018-09-30 20:45:57,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-30 20:45:57,474 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:45:57,474 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 20:45:57,474 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:45:57,474 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:45:57,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1989135149, now seen corresponding path program 2 times [2018-09-30 20:45:57,475 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:45:57,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:45:57,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:45:57,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:45:57,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:45:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:45:57,630 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 20:45:57,630 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:45:57,631 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:45:57,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:45:57,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:45:57,631 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:45:57,632 INFO L87 Difference]: Start difference. First operand 933 states and 1156 transitions. Second operand 3 states. [2018-09-30 20:45:58,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:45:58,011 INFO L93 Difference]: Finished difference Result 2161 states and 2654 transitions. [2018-09-30 20:45:58,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:45:58,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-09-30 20:45:58,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:45:58,017 INFO L225 Difference]: With dead ends: 2161 [2018-09-30 20:45:58,017 INFO L226 Difference]: Without dead ends: 975 [2018-09-30 20:45:58,019 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 20:45:58,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-09-30 20:45:58,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 797. [2018-09-30 20:45:58,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-09-30 20:45:58,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 959 transitions. [2018-09-30 20:45:58,186 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 959 transitions. Word has length 58 [2018-09-30 20:45:58,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:45:58,187 INFO L480 AbstractCegarLoop]: Abstraction has 797 states and 959 transitions. [2018-09-30 20:45:58,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:45:58,187 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 959 transitions. [2018-09-30 20:45:58,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-30 20:45:58,188 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:45:58,189 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 20:45:58,189 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:45:58,189 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:45:58,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1225807471, now seen corresponding path program 3 times [2018-09-30 20:45:58,189 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:45:58,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:45:58,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:45:58,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:45:58,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:45:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:45:58,275 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 20:45:58,276 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:45:58,276 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:45:58,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:45:58,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:45:58,280 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:45:58,280 INFO L87 Difference]: Start difference. First operand 797 states and 959 transitions. Second operand 3 states. [2018-09-30 20:45:58,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:45:58,296 INFO L93 Difference]: Finished difference Result 799 states and 961 transitions. [2018-09-30 20:45:58,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:45:58,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-09-30 20:45:58,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:45:58,296 INFO L225 Difference]: With dead ends: 799 [2018-09-30 20:45:58,297 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 20:45:58,298 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 20:45:58,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 20:45:58,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 20:45:58,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 20:45:58,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 20:45:58,299 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-09-30 20:45:58,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:45:58,299 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 20:45:58,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:45:58,299 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 20:45:58,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 20:45:58,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 20:45:58,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:58,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:59,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:59,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:59,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:59,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:59,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:45:59,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:01,067 WARN L178 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-09-30 20:46:01,294 WARN L178 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-30 20:46:02,177 WARN L178 SmtUtils]: Spent 881.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 20:46:02,511 WARN L178 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-09-30 20:46:02,618 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-09-30 20:46:02,819 WARN L178 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-09-30 20:46:02,979 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-09-30 20:46:03,254 WARN L178 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-09-30 20:46:03,472 WARN L178 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 20:46:03,715 WARN L178 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-09-30 20:46:03,981 WARN L178 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-09-30 20:46:04,209 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-09-30 20:46:04,212 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 20:46:04,213 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 20:46:04,213 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 20:46:04,213 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 461) no Hoare annotation was computed. [2018-09-30 20:46:04,213 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 20:46:04,214 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 91 462) no Hoare annotation was computed. [2018-09-30 20:46:04,214 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 91 462) no Hoare annotation was computed. [2018-09-30 20:46:04,214 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 20:46:04,214 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 20:46:04,214 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 20:46:04,214 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 91 462) no Hoare annotation was computed. [2018-09-30 20:46:04,215 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 20:46:04,215 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 20:46:04,215 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 20:46:04,215 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 20:46:04,215 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 20:46:04,216 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 20:46:04,216 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 20:46:04,216 INFO L422 ceAbstractionStarter]: At program point L456(lines 456 460) the Hoare annotation is: false [2018-09-30 20:46:04,224 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,225 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,232 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,232 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,235 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,235 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,237 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,237 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,240 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,241 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,243 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,243 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,247 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,247 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,249 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,249 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,252 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,253 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,255 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,255 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,257 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,257 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,259 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,259 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,261 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,261 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,263 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,264 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,267 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,267 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,269 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,269 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,272 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 08:46:04 BoogieIcfgContainer [2018-09-30 20:46:04,273 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 20:46:04,274 INFO L168 Benchmark]: Toolchain (without parser) took 18438.30 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 125.8 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -40.7 MB). Peak memory consumption was 597.8 MB. Max. memory is 7.1 GB. [2018-09-30 20:46:04,275 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:46:04,276 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:46:04,277 INFO L168 Benchmark]: Boogie Preprocessor took 35.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:46:04,277 INFO L168 Benchmark]: RCFGBuilder took 759.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-30 20:46:04,278 INFO L168 Benchmark]: TraceAbstraction took 17592.77 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 125.8 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -83.0 MB). Peak memory consumption was 555.5 MB. Max. memory is 7.1 GB. [2018-09-30 20:46:04,284 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 759.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17592.77 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 125.8 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -83.0 MB). Peak memory consumption was 555.5 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 20:46:04,294 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,295 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,296 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,296 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 20:46:04,298 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,298 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,299 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,301 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 20:46:04,303 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,306 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,307 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,307 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 20:46:04,312 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,312 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,313 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,313 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 20:46:04,318 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,318 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,319 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,319 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 20:46:04,320 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,320 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,321 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,321 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 20:46:04,322 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,322 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,323 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,323 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 20:46:04,324 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,324 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,325 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:04,325 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, 17.4s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 7.7s AutomataDifference, 0.0s DeadEndRemovalTime, 5.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 300 SDtfs, 277 SDslu, 248 SDs, 0 SdLazy, 185 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s 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.7s HoareSimplificationTime, 15 FomulaSimplificationsInter, 364 FormulaSimplificationTreeSizeReductionInter, 5.1s 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_20-46-04-331.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_20-46-04-331.csv Received shutdown request...