java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d19836b [2018-09-26 21:52:43,527 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:52:43,529 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:52:43,544 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:52:43,544 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:52:43,545 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:52:43,546 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:52:43,548 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:52:43,550 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:52:43,551 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:52:43,552 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:52:43,552 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:52:43,553 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:52:43,554 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:52:43,555 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:52:43,556 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:52:43,558 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:52:43,560 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:52:43,564 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:52:43,566 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:52:43,570 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:52:43,571 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:52:43,576 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:52:43,576 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:52:43,576 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:52:43,577 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:52:43,578 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:52:43,579 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:52:43,579 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:52:43,580 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:52:43,581 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:52:43,581 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:52:43,582 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:52:43,582 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:52:43,583 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:52:43,583 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:52:43,584 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-09-26 21:52:43,598 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:52:43,600 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:52:43,601 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:52:43,602 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:52:43,602 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:52:43,603 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:52:43,604 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:52:43,604 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:52:43,604 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:52:43,604 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:52:43,604 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:52:43,605 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:52:43,605 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:52:43,605 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:52:43,606 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:52:43,606 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:52:43,606 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:52:43,607 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:52:43,607 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:52:43,607 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:52:43,607 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:52:43,607 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:52:43,608 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:52:43,608 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:52:43,609 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:52:43,610 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:52:43,610 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:52:43,610 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:52:43,610 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:52:43,610 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:52:43,610 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-26 21:52:43,662 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:52:43,675 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:52:43,679 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:52:43,680 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:52:43,681 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:52:43,682 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-09-26 21:52:43,682 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-09-26 21:52:43,781 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:52:43,786 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:52:43,788 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:52:43,788 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:52:43,788 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:52:43,808 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 26.09 09:52:43" (1/1) ... [2018-09-26 21:52:43,828 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 26.09 09:52:43" (1/1) ... [2018-09-26 21:52:43,836 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:52:43,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:52:43,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:52:43,837 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:52:43,849 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 26.09 09:52:43" (1/1) ... [2018-09-26 21:52:43,850 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 26.09 09:52:43" (1/1) ... [2018-09-26 21:52:43,853 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 26.09 09:52:43" (1/1) ... [2018-09-26 21:52:43,854 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 26.09 09:52:43" (1/1) ... [2018-09-26 21:52:43,864 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 26.09 09:52:43" (1/1) ... [2018-09-26 21:52:43,868 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 26.09 09:52:43" (1/1) ... [2018-09-26 21:52:43,871 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 26.09 09:52:43" (1/1) ... [2018-09-26 21:52:43,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:52:43,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:52:43,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:52:43,876 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:52:43,877 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 26.09 09:52:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:52:43,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 21:52:43,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 21:52:44,766 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 21:52:44,766 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 26.09 09:52:44 BoogieIcfgContainer [2018-09-26 21:52:44,767 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:52:44,768 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:52:44,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:52:44,772 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:52:44,772 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 26.09 09:52:43" (1/2) ... [2018-09-26 21:52:44,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303f2d97 and model type pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:52:44, skipping insertion in model container [2018-09-26 21:52:44,773 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 26.09 09:52:44" (2/2) ... [2018-09-26 21:52:44,775 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-26 21:52:44,786 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:52:44,795 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 21:52:44,843 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:52:44,844 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:52:44,844 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:52:44,845 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:52:44,845 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:52:44,845 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:52:44,845 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:52:44,845 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:52:44,846 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:52:44,862 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-09-26 21:52:44,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:52:44,870 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:52:44,871 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:52:44,872 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:52:44,880 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:52:44,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-09-26 21:52:44,882 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:52:44,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:52:44,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:44,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:52:44,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:45,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:52:45,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:52:45,183 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:52:45,184 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:52:45,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:52:45,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:52:45,201 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:52:45,203 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-09-26 21:52:45,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:52:45,352 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-09-26 21:52:45,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:52:45,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-26 21:52:45,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:52:45,365 INFO L225 Difference]: With dead ends: 57 [2018-09-26 21:52:45,366 INFO L226 Difference]: Without dead ends: 37 [2018-09-26 21:52:45,370 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:52:45,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-26 21:52:45,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-09-26 21:52:45,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 21:52:45,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-09-26 21:52:45,415 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-09-26 21:52:45,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:52:45,415 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-09-26 21:52:45,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:52:45,416 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-09-26 21:52:45,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:52:45,417 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:52:45,417 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:52:45,417 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:52:45,418 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:52:45,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-09-26 21:52:45,418 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:52:45,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:52:45,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:45,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:52:45,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:52:45,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:52:45,520 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:52:45,520 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:52:45,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:52:45,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:52:45,523 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:52:45,523 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-09-26 21:52:45,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:52:45,599 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-09-26 21:52:45,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:52:45,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-26 21:52:45,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:52:45,603 INFO L225 Difference]: With dead ends: 103 [2018-09-26 21:52:45,603 INFO L226 Difference]: Without dead ends: 69 [2018-09-26 21:52:45,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:52:45,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-26 21:52:45,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-09-26 21:52:45,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 21:52:45,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-09-26 21:52:45,644 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-09-26 21:52:45,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:52:45,644 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-09-26 21:52:45,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:52:45,645 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-09-26 21:52:45,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:52:45,646 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:52:45,646 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:52:45,649 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:52:45,649 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:52:45,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-09-26 21:52:45,650 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:52:45,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:52:45,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:45,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:52:45,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:52:45,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:52:45,875 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:52:45,875 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:52:45,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 21:52:45,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 21:52:45,876 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:52:45,876 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-09-26 21:52:46,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:52:46,299 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-09-26 21:52:46,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 21:52:46,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-09-26 21:52:46,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:52:46,310 INFO L225 Difference]: With dead ends: 141 [2018-09-26 21:52:46,310 INFO L226 Difference]: Without dead ends: 139 [2018-09-26 21:52:46,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:52:46,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-26 21:52:46,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-09-26 21:52:46,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-26 21:52:46,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-09-26 21:52:46,350 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-09-26 21:52:46,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:52:46,350 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-09-26 21:52:46,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 21:52:46,350 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-09-26 21:52:46,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:52:46,351 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:52:46,351 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:52:46,351 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:52:46,352 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:52:46,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-09-26 21:52:46,353 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:52:46,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:52:46,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:46,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:52:46,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:52:46,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:52:46,456 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:52:46,456 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:52:46,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:52:46,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:52:46,457 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:52:46,457 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-09-26 21:52:46,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:52:46,576 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-09-26 21:52:46,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:52:46,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-26 21:52:46,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:52:46,584 INFO L225 Difference]: With dead ends: 183 [2018-09-26 21:52:46,587 INFO L226 Difference]: Without dead ends: 109 [2018-09-26 21:52:46,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:52:46,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-26 21:52:46,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-26 21:52:46,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-26 21:52:46,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-09-26 21:52:46,629 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-09-26 21:52:46,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:52:46,630 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-09-26 21:52:46,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:52:46,630 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-09-26 21:52:46,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 21:52:46,635 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:52:46,635 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-09-26 21:52:46,635 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:52:46,636 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:52:46,636 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-09-26 21:52:46,636 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:52:46,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:52:46,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:46,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:52:46,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:52:46,797 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:52:46,797 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:52:46,797 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:52:46,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:52:46,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:52:46,798 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:52:46,799 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-09-26 21:52:47,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:52:47,106 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-09-26 21:52:47,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:52:47,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-26 21:52:47,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:52:47,111 INFO L225 Difference]: With dead ends: 321 [2018-09-26 21:52:47,111 INFO L226 Difference]: Without dead ends: 215 [2018-09-26 21:52:47,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:52:47,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-26 21:52:47,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-09-26 21:52:47,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-26 21:52:47,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-09-26 21:52:47,157 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-09-26 21:52:47,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:52:47,158 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-09-26 21:52:47,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:52:47,158 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-09-26 21:52:47,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 21:52:47,160 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:52:47,160 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-09-26 21:52:47,161 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:52:47,161 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:52:47,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-09-26 21:52:47,161 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:52:47,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:52:47,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:47,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:52:47,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:52:47,254 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:52:47,254 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:52:47,255 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:52:47,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:52:47,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:52:47,255 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:52:47,256 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-09-26 21:52:47,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:52:47,543 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-09-26 21:52:47,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:52:47,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-26 21:52:47,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:52:47,547 INFO L225 Difference]: With dead ends: 633 [2018-09-26 21:52:47,547 INFO L226 Difference]: Without dead ends: 423 [2018-09-26 21:52:47,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:52:47,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-09-26 21:52:47,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-09-26 21:52:47,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-09-26 21:52:47,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-09-26 21:52:47,629 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-09-26 21:52:47,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:52:47,629 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-09-26 21:52:47,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:52:47,629 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-09-26 21:52:47,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 21:52:47,632 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:52:47,633 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-09-26 21:52:47,633 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:52:47,633 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:52:47,633 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-09-26 21:52:47,634 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:52:47,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:52:47,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:47,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:52:47,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:52:47,771 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:52:47,771 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:52:47,772 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:52:47,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:52:47,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:52:47,772 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:52:47,773 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-09-26 21:52:48,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:52:48,086 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-09-26 21:52:48,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:52:48,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-26 21:52:48,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:52:48,092 INFO L225 Difference]: With dead ends: 1257 [2018-09-26 21:52:48,092 INFO L226 Difference]: Without dead ends: 839 [2018-09-26 21:52:48,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:52:48,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-09-26 21:52:48,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-09-26 21:52:48,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-09-26 21:52:48,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-09-26 21:52:48,215 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-09-26 21:52:48,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:52:48,215 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-09-26 21:52:48,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:52:48,216 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-09-26 21:52:48,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 21:52:48,219 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:52:48,219 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-09-26 21:52:48,219 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:52:48,220 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:52:48,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-09-26 21:52:48,220 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:52:48,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:52:48,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:48,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:52:48,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:52:48,330 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:52:48,330 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:52:48,331 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:52:48,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:52:48,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:52:48,331 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:52:48,332 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-09-26 21:52:48,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:52:48,726 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-09-26 21:52:48,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:52:48,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-26 21:52:48,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:52:48,738 INFO L225 Difference]: With dead ends: 2505 [2018-09-26 21:52:48,739 INFO L226 Difference]: Without dead ends: 1671 [2018-09-26 21:52:48,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:52:48,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-09-26 21:52:48,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-09-26 21:52:48,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-09-26 21:52:48,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-09-26 21:52:48,970 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-09-26 21:52:48,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:52:48,971 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-09-26 21:52:48,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:52:48,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-09-26 21:52:48,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 21:52:48,975 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:52:48,976 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-09-26 21:52:48,976 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:52:48,976 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:52:48,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-09-26 21:52:48,976 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:52:48,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:52:48,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:48,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:52:48,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:49,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:52:49,198 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:52:49,198 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:52:49,198 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:52:49,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:52:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:52:49,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:52:50,257 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-26 21:52:50,292 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:52:50,292 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-26 21:52:50,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:52:50,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:52:50,293 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:52:50,293 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-09-26 21:52:55,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:52:55,133 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-09-26 21:52:55,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 21:52:55,134 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-09-26 21:52:55,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:52:55,149 INFO L225 Difference]: With dead ends: 4801 [2018-09-26 21:52:55,149 INFO L226 Difference]: Without dead ends: 3135 [2018-09-26 21:52:55,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:52:55,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-09-26 21:52:55,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-09-26 21:52:55,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-09-26 21:52:55,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-09-26 21:52:55,528 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-09-26 21:52:55,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:52:55,529 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-09-26 21:52:55,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:52:55,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-09-26 21:52:55,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 21:52:55,533 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:52:55,533 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-09-26 21:52:55,534 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:52:55,534 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:52:55,534 INFO L82 PathProgramCache]: Analyzing trace with hash 789936545, now seen corresponding path program 2 times [2018-09-26 21:52:55,534 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:52:55,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:52:55,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:55,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:52:55,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:52:55,676 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-26 21:52:55,676 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:52:55,676 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:52:55,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:52:55,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:52:55,677 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:52:55,678 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-09-26 21:52:56,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:52:56,317 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-09-26 21:52:56,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:52:56,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-26 21:52:56,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:52:56,326 INFO L225 Difference]: With dead ends: 4873 [2018-09-26 21:52:56,326 INFO L226 Difference]: Without dead ends: 2215 [2018-09-26 21:52:56,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:52:56,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-09-26 21:52:56,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-09-26 21:52:56,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-09-26 21:52:56,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-09-26 21:52:56,633 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-09-26 21:52:56,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:52:56,634 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-09-26 21:52:56,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:52:56,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-09-26 21:52:56,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 21:52:56,639 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:52:56,639 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-09-26 21:52:56,639 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:52:56,640 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:52:56,640 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-09-26 21:52:56,640 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:52:56,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:52:56,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:56,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:52:56,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:52:56,734 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-09-26 21:52:56,735 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:52:56,735 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:52:56,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:52:56,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:52:56,736 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:52:56,736 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-09-26 21:52:56,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:52:56,780 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-09-26 21:52:56,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:52:56,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-26 21:52:56,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:52:56,781 INFO L225 Difference]: With dead ends: 1799 [2018-09-26 21:52:56,781 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 21:52:56,792 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:52:56,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 21:52:56,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 21:52:56,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 21:52:56,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 21:52:56,793 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-09-26 21:52:56,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:52:56,793 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 21:52:56,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:52:56,794 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 21:52:56,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 21:52:56,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 21:52:56,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:56,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:56,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:56,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:56,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:56,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:56,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:56,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:56,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:56,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:56,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:56,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:56,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:56,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:56,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:56,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:56,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:56,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:56,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:56,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:56,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:56,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:56,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:56,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:56,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:56,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:56,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:56,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:56,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:56,977 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 38 [2018-09-26 21:52:56,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:56,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:56,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:56,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:56,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,232 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-09-26 21:52:57,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,871 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-09-26 21:52:57,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:57,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:58,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:58,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:58,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:58,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:58,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:59,143 WARN L178 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-09-26 21:53:00,024 WARN L178 SmtUtils]: Spent 879.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:53:00,136 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:53:01,404 WARN L178 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:53:02,038 WARN L178 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-26 21:53:02,178 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:53:02,316 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-09-26 21:53:02,522 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:53:03,173 WARN L178 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:53:03,310 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:53:03,458 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-26 21:53:03,565 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-09-26 21:53:03,950 WARN L178 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:53:03,953 INFO L422 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-09-26 21:53:03,953 INFO L422 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-09-26 21:53:03,953 INFO L422 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-09-26 21:53:03,954 INFO L422 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-09-26 21:53:03,954 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 542) no Hoare annotation was computed. [2018-09-26 21:53:03,954 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 542) no Hoare annotation was computed. [2018-09-26 21:53:03,954 INFO L422 ceAbstractionStarter]: At program point L536(lines 536 540) the Hoare annotation is: false [2018-09-26 21:53:03,954 INFO L422 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-09-26 21:53:03,954 INFO L422 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-09-26 21:53:03,954 INFO L422 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-09-26 21:53:03,955 INFO L422 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-09-26 21:53:03,955 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 542) no Hoare annotation was computed. [2018-09-26 21:53:03,955 INFO L422 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-09-26 21:53:03,955 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 541) no Hoare annotation was computed. [2018-09-26 21:53:03,955 INFO L422 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-09-26 21:53:03,955 INFO L422 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-09-26 21:53:03,955 INFO L422 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-09-26 21:53:03,956 INFO L422 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-09-26 21:53:03,956 INFO L422 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-09-26 21:53:03,956 INFO L422 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-09-26 21:53:03,956 INFO L422 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-09-26 21:53:03,969 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:03,970 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:03,972 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:03,972 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:03,974 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:03,975 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:03,978 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:03,980 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:03,987 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:03,987 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:03,989 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:03,989 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:03,994 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:03,994 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:03,997 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:03,997 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,002 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,002 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,004 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,004 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,010 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,010 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,013 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,013 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,018 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,018 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,019 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,019 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,021 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,021 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,022 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,023 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,026 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,026 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,028 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,029 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,033 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,033 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,034 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,034 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,036 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 26.09 09:53:04 BoogieIcfgContainer [2018-09-26 21:53:04,037 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:53:04,038 INFO L168 Benchmark]: Toolchain (without parser) took 20256.01 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 390.6 MB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -392.8 MB). Peak memory consumption was 756.2 MB. Max. memory is 7.1 GB. [2018-09-26 21:53:04,039 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:53:04,040 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:53:04,045 INFO L168 Benchmark]: Boogie Preprocessor took 38.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:53:04,045 INFO L168 Benchmark]: RCFGBuilder took 890.78 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-09-26 21:53:04,046 INFO L168 Benchmark]: TraceAbstraction took 19268.73 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 390.6 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -445.7 MB). Peak memory consumption was 703.3 MB. Max. memory is 7.1 GB. [2018-09-26 21:53:04,054 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.74 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 38.55 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 890.78 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19268.73 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 390.6 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -445.7 MB). Peak memory consumption was 703.3 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-09-26 21:53:04,067 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,067 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,068 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,068 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 536]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 464]: Loop Invariant [2018-09-26 21:53:04,069 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,069 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,070 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,070 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 485]: Loop Invariant [2018-09-26 21:53:04,071 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,071 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,072 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,072 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 416]: Loop Invariant [2018-09-26 21:53:04,073 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,073 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,074 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,074 WARN L389 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-09-26 21:53:04,075 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,075 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,076 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,076 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 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-09-26 21:53:04,078 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,078 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,079 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,079 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 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-09-26 21:53:04,080 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,080 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,081 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,081 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 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-09-26 21:53:04,082 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,082 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,083 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,083 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 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-09-26 21:53:04,084 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,084 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,085 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,085 WARN L389 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-09-26 21:53:04,086 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,086 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,087 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:04,087 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. SAFE Result, 19.1s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 7.7s AutomataDifference, 0.0s DeadEndRemovalTime, 7.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 327 SDslu, 307 SDs, 0 SdLazy, 224 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s 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.2s HoareSimplificationTime, 17 FomulaSimplificationsInter, 180 FormulaSimplificationTreeSizeReductionInter, 5.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s 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_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_21-53-04-097.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_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_21-53-04-097.csv Received shutdown request...