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-133090d [2018-10-04 09:46:39,399 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:46:39,401 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:46:39,417 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:46:39,418 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:46:39,419 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:46:39,423 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:46:39,426 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:46:39,431 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:46:39,432 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:46:39,439 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:46:39,440 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:46:39,441 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:46:39,442 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:46:39,446 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:46:39,447 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:46:39,452 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:46:39,453 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:46:39,458 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:46:39,460 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:46:39,461 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:46:39,466 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:46:39,473 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:46:39,474 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:46:39,474 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:46:39,475 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:46:39,476 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:46:39,477 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:46:39,477 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:46:39,479 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:46:39,479 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:46:39,480 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:46:39,480 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:46:39,480 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:46:39,482 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:46:39,483 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:46:39,483 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 09:46:39,508 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:46:39,508 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:46:39,509 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:46:39,509 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:46:39,511 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:46:39,511 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:46:39,511 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:46:39,511 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:46:39,511 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:46:39,513 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:46:39,513 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:46:39,513 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:46:39,513 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:46:39,513 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:46:39,514 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:46:39,514 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:46:39,514 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:46:39,514 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:46:39,514 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:46:39,516 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:46:39,516 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:46:39,516 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:46:39,517 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:46:39,517 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:46:39,517 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:46:39,517 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:46:39,517 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:46:39,518 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:46:39,518 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:46:39,518 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:46:39,518 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 09:46:39,571 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:46:39,585 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:46:39,592 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:46:39,593 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:46:39,594 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:46:39,595 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-04 09:46:39,596 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl' [2018-10-04 09:46:39,712 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:46:39,714 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:46:39,715 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:46:39,715 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:46:39,715 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:46:39,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:39" (1/1) ... [2018-10-04 09:46:39,755 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:39" (1/1) ... [2018-10-04 09:46:39,763 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:46:39,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:46:39,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:46:39,765 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:46:39,776 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:39" (1/1) ... [2018-10-04 09:46:39,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:39" (1/1) ... [2018-10-04 09:46:39,780 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:39" (1/1) ... [2018-10-04 09:46:39,781 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:39" (1/1) ... [2018-10-04 09:46:39,791 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:39" (1/1) ... [2018-10-04 09:46:39,794 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:39" (1/1) ... [2018-10-04 09:46:39,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:39" (1/1) ... [2018-10-04 09:46:39,802 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:46:39,802 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:46:39,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:46:39,803 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:46:39,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:46:39,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 09:46:39,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 09:46:40,594 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 09:46:40,595 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:46:40 BoogieIcfgContainer [2018-10-04 09:46:40,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:46:40,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:46:40,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:46:40,600 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:46:40,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:39" (1/2) ... [2018-10-04 09:46:40,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26d67bc2 and model type pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:46:40, skipping insertion in model container [2018-10-04 09:46:40,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:46:40" (2/2) ... [2018-10-04 09:46:40,603 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-04 09:46:40,613 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:46:40,625 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:46:40,690 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:46:40,691 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:46:40,692 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:46:40,694 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:46:40,694 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:46:40,694 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:46:40,694 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:46:40,694 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:46:40,694 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:46:40,714 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-10-04 09:46:40,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 09:46:40,729 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:40,730 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:46:40,732 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:40,738 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:40,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-10-04 09:46:40,741 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:40,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:40,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:40,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:40,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:41,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:46:41,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:46:41,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:46:41,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:46:41,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:46:41,057 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:41,059 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-10-04 09:46:41,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:41,106 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-10-04 09:46:41,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:46:41,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-04 09:46:41,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:41,123 INFO L225 Difference]: With dead ends: 57 [2018-10-04 09:46:41,124 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 09:46:41,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:46:41,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 09:46:41,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-10-04 09:46:41,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 09:46:41,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-10-04 09:46:41,181 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-10-04 09:46:41,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:41,181 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-10-04 09:46:41,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:46:41,182 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-10-04 09:46:41,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 09:46:41,182 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:41,183 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:46:41,183 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:41,183 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:41,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-10-04 09:46:41,184 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:41,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:41,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:41,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:41,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:41,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:46:41,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:46:41,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:46:41,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:46:41,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:46:41,320 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:41,320 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-10-04 09:46:41,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:41,353 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-10-04 09:46:41,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:46:41,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-04 09:46:41,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:41,356 INFO L225 Difference]: With dead ends: 103 [2018-10-04 09:46:41,356 INFO L226 Difference]: Without dead ends: 69 [2018-10-04 09:46:41,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:46:41,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-04 09:46:41,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-10-04 09:46:41,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-04 09:46:41,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-10-04 09:46:41,377 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-10-04 09:46:41,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:41,378 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-10-04 09:46:41,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:46:41,378 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-10-04 09:46:41,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 09:46:41,379 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:41,379 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:46:41,380 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:41,380 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:41,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-10-04 09:46:41,380 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:41,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:41,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:41,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:41,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:41,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:46:41,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:46:41,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:46:41,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:46:41,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:46:41,554 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:41,554 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-10-04 09:46:41,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:41,725 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-10-04 09:46:41,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:46:41,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-04 09:46:41,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:41,734 INFO L225 Difference]: With dead ends: 141 [2018-10-04 09:46:41,734 INFO L226 Difference]: Without dead ends: 139 [2018-10-04 09:46:41,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3 [2018-10-04 09:46:41,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-04 09:46:41,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-10-04 09:46:41,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-04 09:46:41,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-10-04 09:46:41,763 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-10-04 09:46:41,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:41,764 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-10-04 09:46:41,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:46:41,764 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-10-04 09:46:41,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 09:46:41,765 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:41,765 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:46:41,765 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:41,766 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:41,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-10-04 09:46:41,766 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:41,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:41,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:41,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:41,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:41,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:46:41,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:46:41,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:46:41,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:46:41,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:46:41,889 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:41,889 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-10-04 09:46:41,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:41,960 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-10-04 09:46:41,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:46:41,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-04 09:46:41,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:41,963 INFO L225 Difference]: With dead ends: 183 [2018-10-04 09:46:41,963 INFO L226 Difference]: Without dead ends: 109 [2018-10-04 09:46:41,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:46:41,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-04 09:46:41,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-10-04 09:46:41,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-04 09:46:41,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-10-04 09:46:41,999 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-10-04 09:46:41,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:41,999 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-10-04 09:46:42,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:46:42,000 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-10-04 09:46:42,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 09:46:42,001 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:42,001 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:46:42,002 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:42,003 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:42,003 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-10-04 09:46:42,003 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:42,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:42,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:42,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:42,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:42,202 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:46:42,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:46:42,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:46:42,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:46:42,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:46:42,203 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:42,204 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-10-04 09:46:42,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:42,317 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-10-04 09:46:42,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:46:42,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 09:46:42,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:42,321 INFO L225 Difference]: With dead ends: 321 [2018-10-04 09:46:42,321 INFO L226 Difference]: Without dead ends: 215 [2018-10-04 09:46:42,323 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:46:42,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-04 09:46:42,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-10-04 09:46:42,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-04 09:46:42,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-10-04 09:46:42,391 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-10-04 09:46:42,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:42,395 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-10-04 09:46:42,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:46:42,395 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-10-04 09:46:42,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 09:46:42,398 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:42,398 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:46:42,399 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:42,399 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:42,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-10-04 09:46:42,399 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:42,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:42,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:42,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:42,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:42,529 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:46:42,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:46:42,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:46:42,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:46:42,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:46:42,531 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:42,531 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-10-04 09:46:42,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:42,654 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-10-04 09:46:42,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:46:42,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 09:46:42,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:42,658 INFO L225 Difference]: With dead ends: 633 [2018-10-04 09:46:42,658 INFO L226 Difference]: Without dead ends: 423 [2018-10-04 09:46:42,659 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:46:42,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-04 09:46:42,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-10-04 09:46:42,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-10-04 09:46:42,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-10-04 09:46:42,727 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-10-04 09:46:42,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:42,728 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-10-04 09:46:42,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:46:42,728 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-10-04 09:46:42,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 09:46:42,731 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:42,731 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:46:42,731 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:42,732 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:42,732 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-10-04 09:46:42,732 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:42,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:42,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:42,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:42,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:42,849 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:46:42,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:46:42,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:46:42,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:46:42,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:46:42,851 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:42,851 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-10-04 09:46:43,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:43,042 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-10-04 09:46:43,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:46:43,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 09:46:43,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:43,048 INFO L225 Difference]: With dead ends: 1257 [2018-10-04 09:46:43,048 INFO L226 Difference]: Without dead ends: 839 [2018-10-04 09:46:43,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:46:43,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-10-04 09:46:43,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-10-04 09:46:43,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-10-04 09:46:43,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-10-04 09:46:43,171 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-10-04 09:46:43,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:43,171 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-10-04 09:46:43,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:46:43,172 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-10-04 09:46:43,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 09:46:43,177 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:43,177 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:46:43,178 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:43,179 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:43,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-10-04 09:46:43,179 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:43,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:43,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:43,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:43,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:43,312 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:46:43,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:46:43,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:46:43,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:46:43,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:46:43,314 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:43,314 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-10-04 09:46:43,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:43,622 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-10-04 09:46:43,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:46:43,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 09:46:43,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:43,632 INFO L225 Difference]: With dead ends: 2505 [2018-10-04 09:46:43,632 INFO L226 Difference]: Without dead ends: 1671 [2018-10-04 09:46:43,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:46:43,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-10-04 09:46:43,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-10-04 09:46:43,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-10-04 09:46:43,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-10-04 09:46:43,875 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-10-04 09:46:43,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:43,875 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-10-04 09:46:43,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:46:43,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-10-04 09:46:43,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 09:46:43,879 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:43,879 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:46:43,880 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:43,882 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:43,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-10-04 09:46:43,883 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:43,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:43,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:43,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:43,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:44,092 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:46:44,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:46:44,093 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:46:44,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:44,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:44,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:46:45,568 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 09:46:45,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:46:45,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-04 09:46:45,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:46:45,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:46:45,602 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:45,602 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-10-04 09:46:48,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:48,744 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-10-04 09:46:48,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:46:48,745 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-10-04 09:46:48,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:48,760 INFO L225 Difference]: With dead ends: 4801 [2018-10-04 09:46:48,760 INFO L226 Difference]: Without dead ends: 3135 [2018-10-04 09:46:48,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time 0.8s impTime 13 [2018-10-04 09:46:48,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-10-04 09:46:49,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-10-04 09:46:49,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-10-04 09:46:49,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-10-04 09:46:49,102 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-10-04 09:46:49,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:49,103 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-10-04 09:46:49,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:46:49,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-10-04 09:46:49,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-04 09:46:49,110 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:49,110 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 09:46:49,111 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:49,111 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:49,111 INFO L82 PathProgramCache]: Analyzing trace with hash 789936545, now seen corresponding path program 2 times [2018-10-04 09:46:49,111 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:49,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:49,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:49,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:49,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:49,275 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-04 09:46:49,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:46:49,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:46:49,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:46:49,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:46:49,277 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:49,277 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-10-04 09:46:49,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:49,841 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-10-04 09:46:49,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:46:49,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-04 09:46:49,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:49,852 INFO L225 Difference]: With dead ends: 4873 [2018-10-04 09:46:49,852 INFO L226 Difference]: Without dead ends: 2215 [2018-10-04 09:46:49,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:46:49,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-10-04 09:46:50,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-10-04 09:46:50,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-10-04 09:46:50,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-10-04 09:46:50,121 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-10-04 09:46:50,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:50,121 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-10-04 09:46:50,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:46:50,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-10-04 09:46:50,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-04 09:46:50,124 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:50,124 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-10-04 09:46:50,124 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:50,124 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:50,125 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-10-04 09:46:50,125 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:50,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:50,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:50,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:46:50,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:50,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:50,218 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-04 09:46:50,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:46:50,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:46:50,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:46:50,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:46:50,219 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:50,220 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-10-04 09:46:50,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:50,255 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-10-04 09:46:50,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:46:50,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-04 09:46:50,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:50,256 INFO L225 Difference]: With dead ends: 1799 [2018-10-04 09:46:50,256 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 09:46:50,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:46:50,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 09:46:50,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 09:46:50,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 09:46:50,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 09:46:50,259 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-10-04 09:46:50,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:50,259 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 09:46:50,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:46:50,260 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 09:46:50,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 09:46:50,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 09:46:50,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,388 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 38 [2018-10-04 09:46:50,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,667 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-10-04 09:46:50,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:50,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,288 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-10-04 09:46:51,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:51,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:46:52,557 WARN L178 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-10-04 09:46:53,810 WARN L178 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:46:54,044 WARN L178 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:46:54,232 WARN L178 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:46:54,529 WARN L178 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-10-04 09:46:54,671 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:46:54,879 WARN L178 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-10-04 09:46:55,010 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-10-04 09:46:55,175 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:46:55,325 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:46:55,594 WARN L178 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-04 09:46:55,763 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:46:55,926 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-10-04 09:46:56,045 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-10-04 09:46:56,251 WARN L178 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:46:56,253 INFO L421 ceAbstractionStarter]: At program point L411(lines 402 412) the Hoare annotation is: (let ((.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse6 (not (= ~p2_new ~nomsg))) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse4 .cse5 .cse6) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)))) [2018-10-04 09:46:56,254 INFO L421 ceAbstractionStarter]: At program point L539(lines 364 539) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-10-04 09:46:56,254 INFO L421 ceAbstractionStarter]: At program point L436(lines 436 446) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-10-04 09:46:56,254 INFO L421 ceAbstractionStarter]: At program point L416(lines 416 426) the Hoare annotation is: (let ((.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse6 (not (= ~p2_new ~nomsg))) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse4 .cse5 .cse6) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)))) [2018-10-04 09:46:56,254 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 542) no Hoare annotation was computed. [2018-10-04 09:46:56,254 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 542) no Hoare annotation was computed. [2018-10-04 09:46:56,254 INFO L421 ceAbstractionStarter]: At program point L536(lines 536 540) the Hoare annotation is: false [2018-10-04 09:46:56,255 INFO L421 ceAbstractionStarter]: At program point L371(lines 371 383) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-10-04 09:46:56,255 INFO L421 ceAbstractionStarter]: At program point L491(lines 485 492) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-10-04 09:46:56,255 INFO L421 ceAbstractionStarter]: At program point L520(lines 515 521) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ULTIMATE.start_check_~tmp~158) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-10-04 09:46:56,255 INFO L421 ceAbstractionStarter]: At program point L388(lines 382 389) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (= ~mode2 (* 256 (div ~mode2 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-10-04 09:46:56,255 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 542) no Hoare annotation was computed. [2018-10-04 09:46:56,255 INFO L421 ceAbstractionStarter]: At program point L471(lines 464 472) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-10-04 09:46:56,256 INFO L421 ceAbstractionStarter]: At program point L393(lines 393 403) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (= ~mode2 (* 256 (div ~mode2 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-10-04 09:46:56,256 INFO L421 ceAbstractionStarter]: At program point L451(lines 445 452) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-10-04 09:46:56,256 INFO L421 ceAbstractionStarter]: At program point L509(lines 509 516) the Hoare annotation is: (let ((.cse0 (not (= ~p2_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse6 .cse7))) [2018-10-04 09:46:56,256 INFO L421 ceAbstractionStarter]: At program point L476(lines 476 486) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-10-04 09:46:56,256 INFO L421 ceAbstractionStarter]: At program point L530(lines 530 537) the Hoare annotation is: (and (= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ULTIMATE.start_check_~tmp~158) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-10-04 09:46:56,257 INFO L421 ceAbstractionStarter]: At program point L431(lines 425 432) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-10-04 09:46:56,257 INFO L421 ceAbstractionStarter]: At program point L456(lines 456 465) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-10-04 09:46:56,257 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 541) no Hoare annotation was computed. [2018-10-04 09:46:56,270 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,271 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,274 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,274 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,276 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,276 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,280 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,280 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,284 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,288 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,290 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,290 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,297 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,297 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,299 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,300 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,303 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,304 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,307 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,308 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,314 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,314 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,320 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,320 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,322 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,322 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,329 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,330 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,331 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,332 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,333 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,333 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,334 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,335 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,341 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,341 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,342 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,342 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,343 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,343 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,345 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:46:56 BoogieIcfgContainer [2018-10-04 09:46:56,345 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:46:56,346 INFO L168 Benchmark]: Toolchain (without parser) took 16633.54 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 187.2 MB). Free memory was 1.5 GB in the beginning and 981.0 MB in the end (delta: 492.5 MB). Peak memory consumption was 679.7 MB. Max. memory is 7.1 GB. [2018-10-04 09:46:56,348 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:46:56,348 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.58 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:46:56,349 INFO L168 Benchmark]: Boogie Preprocessor took 37.64 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:46:56,349 INFO L168 Benchmark]: RCFGBuilder took 792.71 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-10-04 09:46:56,350 INFO L168 Benchmark]: TraceAbstraction took 15749.12 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 187.2 MB). Free memory was 1.4 GB in the beginning and 981.0 MB in the end (delta: 439.6 MB). Peak memory consumption was 626.8 MB. Max. memory is 7.1 GB. [2018-10-04 09:46:56,355 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.27 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 49.58 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 37.64 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 792.71 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 15749.12 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 187.2 MB). Free memory was 1.4 GB in the beginning and 981.0 MB in the end (delta: 439.6 MB). Peak memory consumption was 626.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 541]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 382]: Loop Invariant Derived loop invariant: (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 445]: Loop Invariant [2018-10-04 09:46:56,366 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,367 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,368 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,368 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 536]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 464]: Loop Invariant [2018-10-04 09:46:56,369 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,369 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,370 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,370 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 485]: Loop Invariant [2018-10-04 09:46:56,371 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,371 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,372 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,372 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 416]: Loop Invariant [2018-10-04 09:46:56,373 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,373 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,374 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,374 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) - InvariantResult [Line: 436]: Loop Invariant [2018-10-04 09:46:56,375 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,375 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,376 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,376 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 456]: Loop Invariant [2018-10-04 09:46:56,378 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,378 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,379 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,379 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= check_~tmp~158) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 509]: Loop Invariant [2018-10-04 09:46:56,380 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,380 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,381 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,381 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: ((((((((assert_~arg == 1 && !(~p2_old == ~nomsg)) && 1 <= check_~tmp~158) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 476]: Loop Invariant [2018-10-04 09:46:56,382 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,382 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,383 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,383 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 364]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 402]: Loop Invariant [2018-10-04 09:46:56,384 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,385 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,385 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,385 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) - InvariantResult [Line: 425]: Loop Invariant [2018-10-04 09:46:56,386 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,386 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,387 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:46:56,387 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. SAFE Result, 15.5s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 4.9s AutomataDifference, 0.0s DeadEndRemovalTime, 5.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 327 SDslu, 307 SDs, 0 SdLazy, 224 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s 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.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 1528 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 581 NumberOfFragments, 1160 HoareAnnotationTreeSize, 17 FomulaSimplifications, 70439 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 17 FomulaSimplificationsInter, 180 FormulaSimplificationTreeSizeReductionInter, 4.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s 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-10-04_09-46-56-393.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-10-04_09-46-56-393.csv Received shutdown request...