java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:27:19,557 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:27:19,561 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:27:19,578 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:27:19,579 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:27:19,580 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:27:19,581 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:27:19,584 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:27:19,586 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:27:19,586 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:27:19,589 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:27:19,590 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:27:19,591 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:27:19,592 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:27:19,596 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:27:19,597 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:27:19,598 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:27:19,608 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:27:19,611 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:27:19,614 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:27:19,616 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:27:19,617 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:27:19,619 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:27:19,619 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:27:19,621 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:27:19,622 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:27:19,623 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:27:19,624 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:27:19,625 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:27:19,628 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:27:19,628 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:27:19,630 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:27:19,630 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:27:19,630 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:27:19,633 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:27:19,634 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:27:19,634 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 12:27:19,662 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:27:19,663 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:27:19,664 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:27:19,664 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:27:19,666 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:27:19,666 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:27:19,667 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:27:19,667 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:27:19,667 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:27:19,667 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:27:19,669 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:27:19,669 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:27:19,669 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:27:19,670 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:27:19,670 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:27:19,670 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:27:19,670 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:27:19,671 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:27:19,671 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:27:19,671 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:27:19,671 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:27:19,672 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:27:19,672 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:27:19,672 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:27:19,672 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:27:19,673 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:27:19,674 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:27:19,674 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:27:19,674 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:27:19,675 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:27:19,743 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:27:19,758 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:27:19,764 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:27:19,766 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:27:19,766 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:27:19,767 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.6.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-04 12:27:19,767 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl' [2018-10-04 12:27:19,877 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:27:19,879 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:27:19,880 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:27:19,880 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:27:19,880 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:27:19,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:19" (1/1) ... [2018-10-04 12:27:19,919 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:19" (1/1) ... [2018-10-04 12:27:19,935 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:27:19,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:27:19,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:27:19,936 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:27:19,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:19" (1/1) ... [2018-10-04 12:27:19,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:19" (1/1) ... [2018-10-04 12:27:19,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:19" (1/1) ... [2018-10-04 12:27:19,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:19" (1/1) ... [2018-10-04 12:27:19,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:19" (1/1) ... [2018-10-04 12:27:19,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:19" (1/1) ... [2018-10-04 12:27:19,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:19" (1/1) ... [2018-10-04 12:27:20,002 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:27:20,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:27:20,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:27:20,003 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:27:20,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:27:20,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:27:20,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:27:20,785 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:27:20,786 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:27:20 BoogieIcfgContainer [2018-10-04 12:27:20,786 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:27:20,787 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:27:20,787 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:27:20,790 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:27:20,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:19" (1/2) ... [2018-10-04 12:27:20,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69727c6 and model type pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:27:20, skipping insertion in model container [2018-10-04 12:27:20,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:27:20" (2/2) ... [2018-10-04 12:27:20,794 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-04 12:27:20,803 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:27:20,813 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:27:20,863 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:27:20,864 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:27:20,864 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:27:20,864 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:27:20,865 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:27:20,865 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:27:20,865 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:27:20,865 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:27:20,865 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:27:20,881 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-10-04 12:27:20,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:27:20,888 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:20,889 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:20,891 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:20,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:20,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-10-04 12:27:20,899 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:20,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:20,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:20,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:20,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:21,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:21,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:21,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:21,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:27:21,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:21,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:21,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:21,258 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-10-04 12:27:21,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:21,331 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-10-04 12:27:21,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:21,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-04 12:27:21,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:21,344 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:27:21,345 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:27:21,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:21,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:27:21,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-10-04 12:27:21,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 12:27:21,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-10-04 12:27:21,393 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-10-04 12:27:21,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:21,394 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-10-04 12:27:21,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:21,394 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-10-04 12:27:21,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:27:21,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:21,395 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:21,395 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:21,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:21,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-10-04 12:27:21,396 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:21,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:21,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:21,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:21,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:21,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:21,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:21,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:27:21,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:21,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:21,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:21,557 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-10-04 12:27:21,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:21,600 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-10-04 12:27:21,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:21,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-04 12:27:21,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:21,602 INFO L225 Difference]: With dead ends: 103 [2018-10-04 12:27:21,603 INFO L226 Difference]: Without dead ends: 69 [2018-10-04 12:27:21,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:21,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-04 12:27:21,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-10-04 12:27:21,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-04 12:27:21,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-10-04 12:27:21,640 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-10-04 12:27:21,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:21,641 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-10-04 12:27:21,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:21,641 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-10-04 12:27:21,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:27:21,642 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:21,642 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:21,643 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:21,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:21,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-10-04 12:27:21,643 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:21,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:21,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:21,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:21,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:21,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:21,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:21,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:27:21,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:27:21,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:27:21,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:27:21,803 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-10-04 12:27:22,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:22,079 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-10-04 12:27:22,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:27:22,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-04 12:27:22,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:22,088 INFO L225 Difference]: With dead ends: 141 [2018-10-04 12:27:22,088 INFO L226 Difference]: Without dead ends: 139 [2018-10-04 12:27:22,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:27:22,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-04 12:27:22,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-10-04 12:27:22,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-04 12:27:22,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-10-04 12:27:22,149 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-10-04 12:27:22,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:22,150 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-10-04 12:27:22,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:27:22,150 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-10-04 12:27:22,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:27:22,151 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:22,151 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:22,152 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:22,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:22,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-10-04 12:27:22,153 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:22,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:22,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:22,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:22,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:22,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:22,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:22,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:27:22,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:22,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:22,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:22,315 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-10-04 12:27:22,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:22,429 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-10-04 12:27:22,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:22,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-04 12:27:22,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:22,432 INFO L225 Difference]: With dead ends: 183 [2018-10-04 12:27:22,436 INFO L226 Difference]: Without dead ends: 109 [2018-10-04 12:27:22,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:22,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-04 12:27:22,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-10-04 12:27:22,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-04 12:27:22,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-10-04 12:27:22,479 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-10-04 12:27:22,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:22,480 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-10-04 12:27:22,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:22,480 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-10-04 12:27:22,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:27:22,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:22,482 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:22,483 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:22,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:22,483 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-10-04 12:27:22,483 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:22,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:22,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:22,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:22,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:22,676 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:22,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:22,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:27:22,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:22,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:22,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:22,678 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-10-04 12:27:22,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:22,753 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-10-04 12:27:22,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:22,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 12:27:22,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:22,757 INFO L225 Difference]: With dead ends: 321 [2018-10-04 12:27:22,757 INFO L226 Difference]: Without dead ends: 215 [2018-10-04 12:27:22,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:22,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-04 12:27:22,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-10-04 12:27:22,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-04 12:27:22,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-10-04 12:27:22,802 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-10-04 12:27:22,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:22,803 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-10-04 12:27:22,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:22,803 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-10-04 12:27:22,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:27:22,805 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:22,805 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:22,806 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:22,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:22,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-10-04 12:27:22,806 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:22,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:22,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:22,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:22,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:22,989 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:22,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:22,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:27:22,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:22,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:22,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:22,993 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-10-04 12:27:23,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:23,132 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-10-04 12:27:23,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:23,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 12:27:23,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:23,136 INFO L225 Difference]: With dead ends: 633 [2018-10-04 12:27:23,136 INFO L226 Difference]: Without dead ends: 423 [2018-10-04 12:27:23,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:23,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-04 12:27:23,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-10-04 12:27:23,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-10-04 12:27:23,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-10-04 12:27:23,224 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-10-04 12:27:23,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:23,227 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-10-04 12:27:23,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:23,228 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-10-04 12:27:23,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:27:23,233 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:23,233 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:23,233 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:23,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:23,236 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-10-04 12:27:23,237 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:23,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:23,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:23,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:23,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:23,412 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:23,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:23,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:27:23,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:23,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:23,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:23,414 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-10-04 12:27:23,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:23,591 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-10-04 12:27:23,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:23,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 12:27:23,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:23,600 INFO L225 Difference]: With dead ends: 1257 [2018-10-04 12:27:23,600 INFO L226 Difference]: Without dead ends: 839 [2018-10-04 12:27:23,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:23,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-10-04 12:27:23,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-10-04 12:27:23,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-10-04 12:27:23,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-10-04 12:27:23,726 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-10-04 12:27:23,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:23,727 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-10-04 12:27:23,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:23,727 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-10-04 12:27:23,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:27:23,730 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:23,730 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:23,730 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:23,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:23,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-10-04 12:27:23,731 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:23,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:23,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:23,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:23,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:23,884 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:23,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:23,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:27:23,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:23,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:23,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:23,886 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-10-04 12:27:24,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:24,211 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-10-04 12:27:24,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:24,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 12:27:24,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:24,221 INFO L225 Difference]: With dead ends: 2505 [2018-10-04 12:27:24,222 INFO L226 Difference]: Without dead ends: 1671 [2018-10-04 12:27:24,224 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:24,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-10-04 12:27:24,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-10-04 12:27:24,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-10-04 12:27:24,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-10-04 12:27:24,478 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-10-04 12:27:24,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:24,478 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-10-04 12:27:24,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:24,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-10-04 12:27:24,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:27:24,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:24,482 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, 1, 1, 1, 1] [2018-10-04 12:27:24,486 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:24,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:24,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-10-04 12:27:24,486 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:24,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:24,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:24,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:24,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:24,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:27:24,664 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:27:24,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:24,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:27:25,133 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:27:25,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:27:25,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-04 12:27:25,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:27:25,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:27:25,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:27:25,168 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-10-04 12:27:25,390 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-04 12:27:25,741 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-04 12:27:26,277 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-04 12:27:26,639 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-04 12:27:26,872 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-04 12:27:27,301 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-04 12:27:29,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:29,049 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-10-04 12:27:29,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:27:29,050 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-10-04 12:27:29,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:29,065 INFO L225 Difference]: With dead ends: 4801 [2018-10-04 12:27:29,065 INFO L226 Difference]: Without dead ends: 3135 [2018-10-04 12:27:29,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:27:29,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-10-04 12:27:29,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-10-04 12:27:29,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-10-04 12:27:29,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-10-04 12:27:29,434 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-10-04 12:27:29,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:29,434 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-10-04 12:27:29,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:27:29,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-10-04 12:27:29,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-04 12:27:29,438 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:29,439 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 12:27:29,439 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:29,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:29,439 INFO L82 PathProgramCache]: Analyzing trace with hash 789936545, now seen corresponding path program 2 times [2018-10-04 12:27:29,439 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:29,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:29,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:29,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:29,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:29,611 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-04 12:27:29,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:29,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:27:29,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:29,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:29,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:29,613 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-10-04 12:27:30,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:30,116 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-10-04 12:27:30,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:30,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-04 12:27:30,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:30,127 INFO L225 Difference]: With dead ends: 4873 [2018-10-04 12:27:30,128 INFO L226 Difference]: Without dead ends: 2215 [2018-10-04 12:27:30,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:30,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-10-04 12:27:30,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-10-04 12:27:30,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-10-04 12:27:30,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-10-04 12:27:30,458 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-10-04 12:27:30,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:30,458 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-10-04 12:27:30,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:30,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-10-04 12:27:30,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-04 12:27:30,461 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:30,461 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-10-04 12:27:30,461 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:30,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:30,462 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-10-04 12:27:30,462 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:30,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:30,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:30,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:27:30,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:30,544 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-04 12:27:30,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:30,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:27:30,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:30,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:30,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:30,545 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-10-04 12:27:30,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:30,583 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-10-04 12:27:30,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:30,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-04 12:27:30,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:30,583 INFO L225 Difference]: With dead ends: 1799 [2018-10-04 12:27:30,583 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:27:30,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:30,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:27:30,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:27:30,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:27:30,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:27:30,587 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-10-04 12:27:30,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:30,587 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:27:30,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:30,588 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:27:30,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:27:30,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:27:30,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,739 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 38 [2018-10-04 12:27:30,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:30,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,017 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-10-04 12:27:31,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,627 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-10-04 12:27:31,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:31,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:32,943 WARN L178 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-10-04 12:27:33,618 WARN L178 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:27:33,751 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:27:34,130 WARN L178 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:27:34,478 WARN L178 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-10-04 12:27:34,585 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:27:34,695 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-10-04 12:27:34,821 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-10-04 12:27:34,934 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:27:35,064 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:27:35,195 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:27:35,360 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-10-04 12:27:35,631 WARN L178 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:27:35,635 INFO L421 ceAbstractionStarter]: At program point L411(lines 402 412) the Hoare annotation is: (let ((.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse6 (not (= ~p2_new ~nomsg))) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse4 .cse5 .cse6) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)))) [2018-10-04 12:27:35,636 INFO L421 ceAbstractionStarter]: At program point L539(lines 364 539) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-10-04 12:27:35,636 INFO L421 ceAbstractionStarter]: At program point L436(lines 436 446) 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-10-04 12:27:35,636 INFO L421 ceAbstractionStarter]: At program point L416(lines 416 426) the Hoare annotation is: (let ((.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse6 (not (= ~p2_new ~nomsg))) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse4 .cse5 .cse6) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)))) [2018-10-04 12:27:35,636 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 542) no Hoare annotation was computed. [2018-10-04 12:27:35,636 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 542) no Hoare annotation was computed. [2018-10-04 12:27:35,637 INFO L421 ceAbstractionStarter]: At program point L536(lines 536 540) the Hoare annotation is: false [2018-10-04 12:27:35,637 INFO L421 ceAbstractionStarter]: At program point L371(lines 371 383) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-10-04 12:27:35,637 INFO L421 ceAbstractionStarter]: At program point L491(lines 485 492) 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-10-04 12:27:35,637 INFO L421 ceAbstractionStarter]: At program point L520(lines 515 521) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ULTIMATE.start_check_~tmp~158) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-10-04 12:27:35,638 INFO L421 ceAbstractionStarter]: At program point L388(lines 382 389) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (= ~mode2 (* 256 (div ~mode2 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-10-04 12:27:35,638 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 542) no Hoare annotation was computed. [2018-10-04 12:27:35,638 INFO L421 ceAbstractionStarter]: At program point L471(lines 464 472) 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-10-04 12:27:35,638 INFO L421 ceAbstractionStarter]: At program point L393(lines 393 403) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (= ~mode2 (* 256 (div ~mode2 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-10-04 12:27:35,639 INFO L421 ceAbstractionStarter]: At program point L451(lines 445 452) 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-10-04 12:27:35,639 INFO L421 ceAbstractionStarter]: At program point L509(lines 509 516) 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-10-04 12:27:35,639 INFO L421 ceAbstractionStarter]: At program point L476(lines 476 486) 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-10-04 12:27:35,639 INFO L421 ceAbstractionStarter]: At program point L530(lines 530 537) the Hoare annotation is: (and (= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ULTIMATE.start_check_~tmp~158) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-10-04 12:27:35,640 INFO L421 ceAbstractionStarter]: At program point L431(lines 425 432) 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-10-04 12:27:35,640 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 541) no Hoare annotation was computed. [2018-10-04 12:27:35,640 INFO L421 ceAbstractionStarter]: At program point L456(lines 456 465) 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-10-04 12:27:35,654 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,655 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,658 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,658 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,660 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,660 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,662 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,662 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,664 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,664 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,666 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,666 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,668 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,669 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,671 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,671 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,673 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,673 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,675 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,675 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,678 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,678 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,680 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,680 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,682 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,682 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,684 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,684 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,686 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,687 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,688 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,688 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,691 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,691 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,692 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,693 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,694 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,694 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,697 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,698 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,705 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:27:35 BoogieIcfgContainer [2018-10-04 12:27:35,705 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:27:35,706 INFO L168 Benchmark]: Toolchain (without parser) took 15827.81 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 175.1 MB). Free memory was 1.5 GB in the beginning and 960.0 MB in the end (delta: 498.3 MB). Peak memory consumption was 673.4 MB. Max. memory is 7.1 GB. [2018-10-04 12:27:35,707 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:27:35,709 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.73 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:27:35,709 INFO L168 Benchmark]: Boogie Preprocessor took 66.60 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:27:35,710 INFO L168 Benchmark]: RCFGBuilder took 783.05 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-10-04 12:27:35,711 INFO L168 Benchmark]: TraceAbstraction took 14918.14 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 175.1 MB). Free memory was 1.4 GB in the beginning and 960.0 MB in the end (delta: 456.0 MB). Peak memory consumption was 631.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:27:35,716 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.19 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 55.73 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 66.60 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 783.05 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 14918.14 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 175.1 MB). Free memory was 1.4 GB in the beginning and 960.0 MB in the end (delta: 456.0 MB). Peak memory consumption was 631.1 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] - 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: 541]: 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: 382]: Loop Invariant Derived loop invariant: (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 445]: Loop Invariant [2018-10-04 12:27:35,739 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,741 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,742 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,742 WARN L390 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: 536]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 464]: Loop Invariant [2018-10-04 12:27:35,743 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,744 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,750 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,750 WARN L390 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: 485]: Loop Invariant [2018-10-04 12:27:35,751 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,751 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,752 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,753 WARN L390 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: 416]: Loop Invariant [2018-10-04 12:27:35,756 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,756 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,760 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,760 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || (((((((~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))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) - InvariantResult [Line: 436]: Loop Invariant [2018-10-04 12:27:35,761 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,762 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,763 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,763 WARN L390 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: 393]: Loop Invariant Derived loop invariant: (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 456]: Loop Invariant [2018-10-04 12:27:35,765 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,765 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,766 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,767 WARN L390 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: 515]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= check_~tmp~158) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 509]: Loop Invariant [2018-10-04 12:27:35,768 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,768 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,769 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,769 WARN L390 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: 530]: Loop Invariant Derived loop invariant: ((((((((assert_~arg == 1 && !(~p2_old == ~nomsg)) && 1 <= check_~tmp~158) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 476]: Loop Invariant [2018-10-04 12:27:35,771 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,771 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,772 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,772 WARN L390 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: 364]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 402]: Loop Invariant [2018-10-04 12:27:35,774 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,774 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,775 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,776 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || (((((((~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))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) - InvariantResult [Line: 425]: Loop Invariant [2018-10-04 12:27:35,777 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,777 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,778 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:35,778 WARN L390 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)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. SAFE Result, 14.7s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 5.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 327 SDslu, 307 SDs, 0 SdLazy, 224 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2101occurred in iteration=9, 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: 1.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1528 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 581 NumberOfFragments, 1160 HoareAnnotationTreeSize, 17 FomulaSimplifications, 70439 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 17 FomulaSimplificationsInter, 180 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 408 NumberOfCodeBlocks, 408 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 396 ConstructedInterpolants, 12 QuantifiedInterpolants, 49682 SizeOfPredicates, 1 NumberOfNonLiveVariables, 347 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 270/288 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.6.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-27-35-784.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-27-35-784.csv Received shutdown request...