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.1.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-00a8621 [2018-09-30 10:54:46,258 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:54:46,261 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:54:46,277 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:54:46,278 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:54:46,279 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:54:46,280 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:54:46,282 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:54:46,284 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:54:46,285 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:54:46,286 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:54:46,287 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:54:46,288 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:54:46,290 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:54:46,291 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:54:46,299 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:54:46,300 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:54:46,305 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:54:46,306 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:54:46,310 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:54:46,311 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:54:46,312 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:54:46,318 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:54:46,318 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:54:46,318 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:54:46,319 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:54:46,320 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:54:46,322 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:54:46,323 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:54:46,325 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:54:46,325 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:54:46,326 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:54:46,326 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:54:46,326 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:54:46,330 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:54:46,331 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:54:46,331 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-09-30 10:54:46,356 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:54:46,357 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:54:46,358 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:54:46,358 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:54:46,359 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:54:46,359 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:54:46,359 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:54:46,359 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:54:46,360 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:54:46,360 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:54:46,361 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:54:46,361 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:54:46,361 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:54:46,361 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:54:46,361 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:54:46,362 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:54:46,362 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:54:46,362 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:54:46,362 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:54:46,362 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:54:46,364 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:54:46,364 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:54:46,364 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:54:46,364 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:54:46,365 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:54:46,365 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:54:46,365 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:54:46,365 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:54:46,365 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:54:46,366 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:54:46,366 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 10:54:46,415 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:54:46,428 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:54:46,432 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:54:46,433 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:54:46,434 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:54:46,435 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.1.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-30 10:54:46,435 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl' [2018-09-30 10:54:46,539 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:54:46,543 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:54:46,544 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:54:46,544 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:54:46,544 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:54:46,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:54:46" (1/1) ... [2018-09-30 10:54:46,586 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:54:46" (1/1) ... [2018-09-30 10:54:46,604 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:54:46,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:54:46,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:54:46,606 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:54:46,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:54:46" (1/1) ... [2018-09-30 10:54:46,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:54:46" (1/1) ... [2018-09-30 10:54:46,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:54:46" (1/1) ... [2018-09-30 10:54:46,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:54:46" (1/1) ... [2018-09-30 10:54:46,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:54:46" (1/1) ... [2018-09-30 10:54:46,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:54:46" (1/1) ... [2018-09-30 10:54:46,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:54:46" (1/1) ... [2018-09-30 10:54:46,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:54:46,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:54:46,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:54:46,665 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:54:46,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:54:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:54:46,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 10:54:46,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 10:54:47,451 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 10:54:47,451 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:54:47 BoogieIcfgContainer [2018-09-30 10:54:47,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:54:47,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:54:47,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:54:47,458 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:54:47,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:54:46" (1/2) ... [2018-09-30 10:54:47,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae06288 and model type pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:54:47, skipping insertion in model container [2018-09-30 10:54:47,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:54:47" (2/2) ... [2018-09-30 10:54:47,461 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-30 10:54:47,471 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:54:47,481 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 10:54:47,523 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:54:47,524 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:54:47,524 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:54:47,525 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:54:47,525 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:54:47,525 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:54:47,525 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:54:47,525 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:54:47,525 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:54:47,541 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-09-30 10:54:47,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:54:47,549 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:54:47,550 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:54:47,551 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:54:47,558 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:54:47,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-09-30 10:54:47,561 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:54:47,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:54:47,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:47,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:54:47,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:54:47,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:54:47,858 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:54:47,859 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:54:47,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:54:47,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:54:47,875 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:54:47,877 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-09-30 10:54:47,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:54:47,980 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-09-30 10:54:47,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:54:47,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-30 10:54:47,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:54:47,994 INFO L225 Difference]: With dead ends: 57 [2018-09-30 10:54:47,994 INFO L226 Difference]: Without dead ends: 37 [2018-09-30 10:54:47,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:54:48,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-30 10:54:48,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-09-30 10:54:48,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-30 10:54:48,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-09-30 10:54:48,041 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-09-30 10:54:48,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:54:48,042 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-09-30 10:54:48,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:54:48,042 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-09-30 10:54:48,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:54:48,043 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:54:48,043 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:54:48,043 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:54:48,044 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:54:48,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-09-30 10:54:48,044 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:54:48,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:54:48,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:48,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:54:48,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:54:48,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:54:48,225 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:54:48,225 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:54:48,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:54:48,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:54:48,228 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:54:48,228 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-09-30 10:54:48,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:54:48,374 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-09-30 10:54:48,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:54:48,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-30 10:54:48,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:54:48,377 INFO L225 Difference]: With dead ends: 103 [2018-09-30 10:54:48,377 INFO L226 Difference]: Without dead ends: 69 [2018-09-30 10:54:48,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:54:48,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-30 10:54:48,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-09-30 10:54:48,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-30 10:54:48,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-09-30 10:54:48,406 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-09-30 10:54:48,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:54:48,407 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-09-30 10:54:48,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:54:48,407 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-09-30 10:54:48,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:54:48,408 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:54:48,408 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:54:48,409 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:54:48,409 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:54:48,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-09-30 10:54:48,410 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:54:48,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:54:48,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:48,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:54:48,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:54:48,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:54:48,606 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:54:48,606 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:54:48,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:54:48,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:54:48,607 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:54:48,608 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-09-30 10:54:48,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:54:48,961 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-09-30 10:54:48,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:54:48,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-09-30 10:54:48,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:54:48,971 INFO L225 Difference]: With dead ends: 141 [2018-09-30 10:54:48,971 INFO L226 Difference]: Without dead ends: 139 [2018-09-30 10:54:48,972 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:54:48,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-30 10:54:48,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-09-30 10:54:48,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-30 10:54:48,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-09-30 10:54:48,997 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-09-30 10:54:48,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:54:48,997 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-09-30 10:54:48,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:54:48,998 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-09-30 10:54:48,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:54:48,998 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:54:48,999 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:54:48,999 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:54:48,999 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:54:49,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-09-30 10:54:49,000 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:54:49,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:54:49,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:49,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:54:49,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:54:49,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:54:49,077 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:54:49,077 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:54:49,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:54:49,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:54:49,078 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:54:49,078 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-09-30 10:54:49,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:54:49,244 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-09-30 10:54:49,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:54:49,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-30 10:54:49,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:54:49,247 INFO L225 Difference]: With dead ends: 183 [2018-09-30 10:54:49,247 INFO L226 Difference]: Without dead ends: 109 [2018-09-30 10:54:49,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:54:49,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-30 10:54:49,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-30 10:54:49,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-30 10:54:49,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-09-30 10:54:49,272 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-09-30 10:54:49,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:54:49,272 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-09-30 10:54:49,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:54:49,273 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-09-30 10:54:49,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 10:54:49,274 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:54:49,274 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:54:49,275 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:54:49,275 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:54:49,275 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-09-30 10:54:49,275 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:54:49,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:54:49,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:49,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:54:49,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:54:49,430 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:54:49,430 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:54:49,431 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:54:49,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:54:49,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:54:49,432 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:54:49,432 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-09-30 10:54:49,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:54:49,527 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-09-30 10:54:49,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:54:49,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-30 10:54:49,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:54:49,532 INFO L225 Difference]: With dead ends: 321 [2018-09-30 10:54:49,532 INFO L226 Difference]: Without dead ends: 215 [2018-09-30 10:54:49,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:54:49,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-30 10:54:49,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-09-30 10:54:49,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-30 10:54:49,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-09-30 10:54:49,576 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-09-30 10:54:49,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:54:49,577 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-09-30 10:54:49,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:54:49,577 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-09-30 10:54:49,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 10:54:49,579 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:54:49,579 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:54:49,579 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:54:49,580 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:54:49,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-09-30 10:54:49,580 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:54:49,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:54:49,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:49,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:54:49,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:54:49,716 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:54:49,717 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:54:49,717 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:54:49,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:54:49,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:54:49,718 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:54:49,718 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-09-30 10:54:49,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:54:49,909 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-09-30 10:54:49,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:54:49,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-30 10:54:49,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:54:49,914 INFO L225 Difference]: With dead ends: 633 [2018-09-30 10:54:49,914 INFO L226 Difference]: Without dead ends: 423 [2018-09-30 10:54:49,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:54:49,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-09-30 10:54:49,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-09-30 10:54:49,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-09-30 10:54:50,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-09-30 10:54:50,007 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-09-30 10:54:50,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:54:50,008 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-09-30 10:54:50,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:54:50,008 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-09-30 10:54:50,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 10:54:50,013 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:54:50,014 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:54:50,014 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:54:50,014 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:54:50,015 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-09-30 10:54:50,015 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:54:50,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:54:50,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:50,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:54:50,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:54:50,142 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:54:50,143 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:54:50,143 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:54:50,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:54:50,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:54:50,144 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:54:50,144 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-09-30 10:54:50,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:54:50,514 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-09-30 10:54:50,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:54:50,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-30 10:54:50,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:54:50,521 INFO L225 Difference]: With dead ends: 1257 [2018-09-30 10:54:50,521 INFO L226 Difference]: Without dead ends: 839 [2018-09-30 10:54:50,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:54:50,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-09-30 10:54:50,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-09-30 10:54:50,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-09-30 10:54:50,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-09-30 10:54:50,645 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-09-30 10:54:50,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:54:50,645 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-09-30 10:54:50,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:54:50,646 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-09-30 10:54:50,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 10:54:50,652 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:54:50,653 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:54:50,654 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:54:50,654 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:54:50,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-09-30 10:54:50,655 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:54:50,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:54:50,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:50,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:54:50,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:54:50,763 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:54:50,763 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:54:50,763 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:54:50,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:54:50,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:54:50,764 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:54:50,764 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-09-30 10:54:51,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:54:51,206 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-09-30 10:54:51,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:54:51,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-30 10:54:51,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:54:51,218 INFO L225 Difference]: With dead ends: 2505 [2018-09-30 10:54:51,219 INFO L226 Difference]: Without dead ends: 1671 [2018-09-30 10:54:51,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:54:51,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-09-30 10:54:51,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-09-30 10:54:51,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-09-30 10:54:51,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-09-30 10:54:51,428 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-09-30 10:54:51,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:54:51,428 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-09-30 10:54:51,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:54:51,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-09-30 10:54:51,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 10:54:51,432 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:54:51,432 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:54:51,432 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:54:51,433 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:54:51,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-09-30 10:54:51,433 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:54:51,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:54:51,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:51,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:54:51,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:54:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:54:51,647 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:54:51,647 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:54:51,648 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:54:51,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:54:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:54:51,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:54:53,155 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 10:54:53,198 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:54:53,198 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-30 10:54:53,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:54:53,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:54:53,199 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:54:53,199 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-09-30 10:55:00,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:55:00,387 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-09-30 10:55:00,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 10:55:00,388 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-09-30 10:55:00,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:55:00,402 INFO L225 Difference]: With dead ends: 4801 [2018-09-30 10:55:00,403 INFO L226 Difference]: Without dead ends: 3135 [2018-09-30 10:55:00,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:55:00,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-09-30 10:55:00,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-09-30 10:55:00,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-09-30 10:55:00,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-09-30 10:55:00,766 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-09-30 10:55:00,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:55:00,766 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-09-30 10:55:00,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:55:00,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-09-30 10:55:00,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-30 10:55:00,771 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:55:00,771 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-30 10:55:00,771 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:55:00,772 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:55:00,772 INFO L82 PathProgramCache]: Analyzing trace with hash 789936545, now seen corresponding path program 2 times [2018-09-30 10:55:00,772 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:55:00,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:55:00,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:00,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:55:00,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:55:00,892 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-30 10:55:00,893 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:55:00,893 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:55:00,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:55:00,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:55:00,894 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:55:00,894 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-09-30 10:55:01,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:55:01,440 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-09-30 10:55:01,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:55:01,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-30 10:55:01,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:55:01,449 INFO L225 Difference]: With dead ends: 4873 [2018-09-30 10:55:01,449 INFO L226 Difference]: Without dead ends: 2215 [2018-09-30 10:55:01,453 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:55:01,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-09-30 10:55:01,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-09-30 10:55:01,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-09-30 10:55:01,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-09-30 10:55:01,712 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-09-30 10:55:01,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:55:01,713 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-09-30 10:55:01,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:55:01,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-09-30 10:55:01,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-30 10:55:01,715 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:55:01,716 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-09-30 10:55:01,716 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:55:01,716 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:55:01,716 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-09-30 10:55:01,716 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:55:01,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:55:01,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:01,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:55:01,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:55:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:55:01,809 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-09-30 10:55:01,810 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:55:01,810 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:55:01,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:55:01,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:55:01,811 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:55:01,812 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-09-30 10:55:01,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:55:01,855 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-09-30 10:55:01,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:55:01,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-30 10:55:01,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:55:01,856 INFO L225 Difference]: With dead ends: 1799 [2018-09-30 10:55:01,856 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 10:55:01,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:55:01,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 10:55:01,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 10:55:01,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 10:55:01,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 10:55:01,866 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-09-30 10:55:01,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:55:01,866 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 10:55:01,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:55:01,868 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 10:55:01,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 10:55:01,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 10:55:01,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:01,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:01,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:01,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:01,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:01,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:01,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:01,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:01,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:01,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:01,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:01,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:01,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,030 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 38 [2018-09-30 10:55:02,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,298 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-09-30 10:55:02,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,950 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-09-30 10:55:02,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:02,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:03,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:03,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:03,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:03,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:03,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:03,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:03,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:03,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:03,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:03,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:03,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:03,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:03,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:03,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:03,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:03,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:03,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:03,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:03,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:03,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:03,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:03,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:03,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:03,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:03,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:03,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:03,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:03,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:03,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:03,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:03,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:03,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:55:04,210 WARN L178 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-09-30 10:55:05,100 WARN L178 SmtUtils]: Spent 887.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 10:55:06,362 WARN L178 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 10:55:06,831 WARN L178 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 10:55:07,251 WARN L178 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-30 10:55:07,377 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 10:55:07,513 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-09-30 10:55:07,717 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 10:55:07,875 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 10:55:08,058 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 10:55:08,222 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-30 10:55:08,658 WARN L178 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 10:55:08,662 INFO L422 ceAbstractionStarter]: At program point L411(lines 402 412) the Hoare annotation is: (let ((.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse6 (not (= ~p2_new ~nomsg))) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse4 .cse5 .cse6) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)))) [2018-09-30 10:55:08,662 INFO L422 ceAbstractionStarter]: At program point L539(lines 364 539) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-30 10:55:08,662 INFO L422 ceAbstractionStarter]: At program point L436(lines 436 446) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 10:55:08,662 INFO L422 ceAbstractionStarter]: At program point L416(lines 416 426) the Hoare annotation is: (let ((.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse6 (not (= ~p2_new ~nomsg))) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse4 .cse5 .cse6) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)))) [2018-09-30 10:55:08,663 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 542) no Hoare annotation was computed. [2018-09-30 10:55:08,663 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 542) no Hoare annotation was computed. [2018-09-30 10:55:08,663 INFO L422 ceAbstractionStarter]: At program point L536(lines 536 540) the Hoare annotation is: false [2018-09-30 10:55:08,663 INFO L422 ceAbstractionStarter]: At program point L371(lines 371 383) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-30 10:55:08,663 INFO L422 ceAbstractionStarter]: At program point L491(lines 485 492) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 10:55:08,663 INFO L422 ceAbstractionStarter]: At program point L520(lines 515 521) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= 1 ULTIMATE.start_check_~tmp~159) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-09-30 10:55:08,663 INFO L422 ceAbstractionStarter]: At program point L388(lines 382 389) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (= ~mode2 (* 256 (div ~mode2 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-30 10:55:08,663 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 542) no Hoare annotation was computed. [2018-09-30 10:55:08,664 INFO L422 ceAbstractionStarter]: At program point L471(lines 464 472) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 10:55:08,664 INFO L422 ceAbstractionStarter]: At program point L393(lines 393 403) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (= ~mode2 (* 256 (div ~mode2 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-30 10:55:08,664 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 541) no Hoare annotation was computed. [2018-09-30 10:55:08,664 INFO L422 ceAbstractionStarter]: At program point L451(lines 445 452) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 10:55:08,664 INFO L422 ceAbstractionStarter]: At program point L509(lines 509 516) the Hoare annotation is: (let ((.cse0 (not (= ~p2_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse6 .cse7))) [2018-09-30 10:55:08,665 INFO L422 ceAbstractionStarter]: At program point L476(lines 476 486) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 10:55:08,665 INFO L422 ceAbstractionStarter]: At program point L530(lines 530 537) the Hoare annotation is: (and (= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= 1 ULTIMATE.start_check_~tmp~159) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-09-30 10:55:08,665 INFO L422 ceAbstractionStarter]: At program point L431(lines 425 432) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 10:55:08,665 INFO L422 ceAbstractionStarter]: At program point L456(lines 456 465) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 10:55:08,678 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,679 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,681 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,682 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,684 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,684 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,686 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,686 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,688 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,689 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,691 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,691 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,693 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,693 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,695 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,695 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,697 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,697 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,699 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,699 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,702 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,703 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,704 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,704 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,706 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,707 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,708 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,708 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,710 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,710 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,712 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,712 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,715 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,715 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,717 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,717 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,718 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,719 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,720 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,720 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,722 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:55:08 BoogieIcfgContainer [2018-09-30 10:55:08,723 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:55:08,724 INFO L168 Benchmark]: Toolchain (without parser) took 22183.33 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 351.8 MB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -354.7 MB). Peak memory consumption was 748.1 MB. Max. memory is 7.1 GB. [2018-09-30 10:55:08,725 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:55:08,726 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:55:08,726 INFO L168 Benchmark]: Boogie Preprocessor took 58.60 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:55:08,727 INFO L168 Benchmark]: RCFGBuilder took 787.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-30 10:55:08,728 INFO L168 Benchmark]: TraceAbstraction took 21270.26 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 351.8 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -397.0 MB). Peak memory consumption was 705.8 MB. Max. memory is 7.1 GB. [2018-09-30 10:55:08,732 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.25 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 61.00 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 58.60 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 787.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21270.26 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 351.8 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -397.0 MB). Peak memory consumption was 705.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-09-30 10:55:08,744 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,744 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,745 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,745 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 536]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 464]: Loop Invariant [2018-09-30 10:55:08,746 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,747 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,748 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,748 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 485]: Loop Invariant [2018-09-30 10:55:08,749 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,749 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,750 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,750 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 416]: Loop Invariant [2018-09-30 10:55:08,752 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,752 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,753 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,753 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) - InvariantResult [Line: 436]: Loop Invariant [2018-09-30 10:55:08,754 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,754 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,755 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,755 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 456]: Loop Invariant [2018-09-30 10:55:08,757 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,757 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,758 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,758 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && 1 <= check_~tmp~159) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 509]: Loop Invariant [2018-09-30 10:55:08,759 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,759 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,760 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,760 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: ((((((((assert_~arg == 1 && !(~p2_old == ~nomsg)) && 1 <= ~mode2) && ~mode2 <= 1) && 1 <= check_~tmp~159) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 476]: Loop Invariant [2018-09-30 10:55:08,761 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,761 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,762 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,762 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 364]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 402]: Loop Invariant [2018-09-30 10:55:08,763 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,764 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,764 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,765 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) - InvariantResult [Line: 425]: Loop Invariant [2018-09-30 10:55:08,765 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,766 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,766 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 10:55:08,766 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. SAFE Result, 21.1s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 9.7s AutomataDifference, 0.0s DeadEndRemovalTime, 6.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 327 SDslu, 307 SDs, 0 SdLazy, 224 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2101occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s 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, 5.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s 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.1.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_10-55-08-772.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_10-55-08-772.csv Received shutdown request...