java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:27:12,329 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:27:12,331 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:27:12,344 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:27:12,344 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:27:12,345 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:27:12,347 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:27:12,349 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:27:12,352 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:27:12,353 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:27:12,355 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:27:12,355 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:27:12,356 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:27:12,358 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:27:12,359 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:27:12,368 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:27:12,369 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:27:12,373 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:27:12,377 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:27:12,379 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:27:12,380 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:27:12,385 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:27:12,388 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:27:12,388 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:27:12,388 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:27:12,389 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:27:12,390 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:27:12,391 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:27:12,395 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:27:12,396 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:27:12,396 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:27:12,398 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:27:12,398 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:27:12,399 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:27:12,401 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:27:12,401 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:27:12,402 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 12:27:12,421 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:27:12,421 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:27:12,422 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:27:12,422 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:27:12,423 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:27:12,423 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:27:12,423 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:27:12,424 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:27:12,424 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:27:12,424 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:27:12,424 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:27:12,425 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:27:12,425 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:27:12,425 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:27:12,425 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:27:12,425 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:27:12,425 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:27:12,426 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:27:12,426 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:27:12,426 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:27:12,426 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:27:12,427 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:27:12,427 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:27:12,427 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:27:12,427 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:27:12,427 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:27:12,428 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:27:12,428 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:27:12,428 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:27:12,428 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:27:12,486 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:27:12,499 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:27:12,505 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:27:12,506 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:27:12,507 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:27:12,508 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-10-04 12:27:12,509 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-10-04 12:27:12,620 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:27:12,622 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:27:12,622 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:27:12,622 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:27:12,623 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:27:12,640 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 04.10 12:27:12" (1/1) ... [2018-10-04 12:27:12,658 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 04.10 12:27:12" (1/1) ... [2018-10-04 12:27:12,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:27:12,667 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:27:12,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:27:12,667 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:27:12,680 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 04.10 12:27:12" (1/1) ... [2018-10-04 12:27:12,680 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 04.10 12:27:12" (1/1) ... [2018-10-04 12:27:12,685 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 04.10 12:27:12" (1/1) ... [2018-10-04 12:27:12,686 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 04.10 12:27:12" (1/1) ... [2018-10-04 12:27:12,709 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 04.10 12:27:12" (1/1) ... [2018-10-04 12:27:12,714 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 04.10 12:27:12" (1/1) ... [2018-10-04 12:27:12,720 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 04.10 12:27:12" (1/1) ... [2018-10-04 12:27:12,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:27:12,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:27:12,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:27:12,731 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:27:12,732 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 04.10 12:27:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:27:12,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:27:12,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:27:13,641 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:27:13,642 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 04.10 12:27:13 BoogieIcfgContainer [2018-10-04 12:27:13,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:27:13,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:27:13,643 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:27:13,646 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:27:13,646 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 04.10 12:27:12" (1/2) ... [2018-10-04 12:27:13,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a7be2a8 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 04.10 12:27:13, skipping insertion in model container [2018-10-04 12:27:13,648 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 04.10 12:27:13" (2/2) ... [2018-10-04 12:27:13,650 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-04 12:27:13,659 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:27:13,667 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:27:13,712 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:27:13,712 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:27:13,713 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:27:13,713 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:27:13,713 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:27:13,713 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:27:13,713 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:27:13,714 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:27:13,714 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:27:13,729 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-10-04 12:27:13,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:27:13,736 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:13,737 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:13,738 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:13,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:13,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-10-04 12:27:13,746 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:13,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:13,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:13,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:13,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:14,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:14,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:14,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:27:14,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:14,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:14,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:14,119 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-10-04 12:27:14,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:14,184 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-10-04 12:27:14,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:14,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-04 12:27:14,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:14,201 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:27:14,201 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:27:14,206 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:14,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:27:14,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-10-04 12:27:14,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 12:27:14,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-10-04 12:27:14,249 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-10-04 12:27:14,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:14,250 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-10-04 12:27:14,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:14,250 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-10-04 12:27:14,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:27:14,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:14,251 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:14,251 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:14,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:14,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-10-04 12:27:14,252 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:14,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:14,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:14,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:14,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:14,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:14,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:14,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:27:14,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:14,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:14,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:14,410 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-10-04 12:27:14,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:14,478 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-10-04 12:27:14,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:14,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-04 12:27:14,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:14,483 INFO L225 Difference]: With dead ends: 103 [2018-10-04 12:27:14,483 INFO L226 Difference]: Without dead ends: 69 [2018-10-04 12:27:14,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:14,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-04 12:27:14,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-10-04 12:27:14,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-04 12:27:14,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-10-04 12:27:14,513 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-10-04 12:27:14,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:14,514 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-10-04 12:27:14,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:14,514 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-10-04 12:27:14,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:27:14,515 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:14,515 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:14,519 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:14,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:14,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-10-04 12:27:14,521 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:14,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:14,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:14,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:14,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:14,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:14,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:14,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:27:14,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:27:14,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:27:14,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:27:14,700 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-10-04 12:27:14,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:14,942 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-10-04 12:27:14,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:27:14,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-04 12:27:14,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:14,955 INFO L225 Difference]: With dead ends: 141 [2018-10-04 12:27:14,955 INFO L226 Difference]: Without dead ends: 139 [2018-10-04 12:27:14,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:27:14,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-04 12:27:14,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-10-04 12:27:14,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-04 12:27:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-10-04 12:27:14,993 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-10-04 12:27:14,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:14,993 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-10-04 12:27:14,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:27:14,993 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-10-04 12:27:14,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:27:14,994 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:14,994 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:14,995 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:14,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:14,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-10-04 12:27:14,995 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:14,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:14,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:14,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:14,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:15,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:15,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:15,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:27:15,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:15,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:15,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:15,081 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-10-04 12:27:15,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:15,179 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-10-04 12:27:15,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:15,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-04 12:27:15,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:15,184 INFO L225 Difference]: With dead ends: 183 [2018-10-04 12:27:15,187 INFO L226 Difference]: Without dead ends: 109 [2018-10-04 12:27:15,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:15,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-04 12:27:15,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-10-04 12:27:15,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-04 12:27:15,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-10-04 12:27:15,223 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-10-04 12:27:15,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:15,223 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-10-04 12:27:15,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:15,225 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-10-04 12:27:15,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:27:15,226 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:15,227 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:15,227 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:15,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:15,227 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-10-04 12:27:15,228 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:15,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:15,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:15,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:15,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:15,380 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:15,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:15,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:27:15,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:15,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:15,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:15,382 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-10-04 12:27:15,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:15,455 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-10-04 12:27:15,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:15,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 12:27:15,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:15,458 INFO L225 Difference]: With dead ends: 321 [2018-10-04 12:27:15,458 INFO L226 Difference]: Without dead ends: 215 [2018-10-04 12:27:15,459 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:15,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-04 12:27:15,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-10-04 12:27:15,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-04 12:27:15,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-10-04 12:27:15,499 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-10-04 12:27:15,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:15,499 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-10-04 12:27:15,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:15,500 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-10-04 12:27:15,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:27:15,502 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:15,502 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:15,502 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:15,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:15,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-10-04 12:27:15,503 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:15,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:15,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:15,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:15,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:15,616 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:15,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:15,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:27:15,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:15,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:15,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:15,618 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-10-04 12:27:15,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:15,742 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-10-04 12:27:15,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:15,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 12:27:15,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:15,747 INFO L225 Difference]: With dead ends: 633 [2018-10-04 12:27:15,747 INFO L226 Difference]: Without dead ends: 423 [2018-10-04 12:27:15,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:15,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-04 12:27:15,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-10-04 12:27:15,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-10-04 12:27:15,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-10-04 12:27:15,819 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-10-04 12:27:15,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:15,820 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-10-04 12:27:15,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:15,820 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-10-04 12:27:15,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:27:15,823 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:15,823 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:15,824 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:15,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:15,824 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-10-04 12:27:15,824 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:15,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:15,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:15,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:15,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:15,985 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:15,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:15,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:27:15,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:15,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:15,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:15,987 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-10-04 12:27:16,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:16,206 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-10-04 12:27:16,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:16,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 12:27:16,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:16,213 INFO L225 Difference]: With dead ends: 1257 [2018-10-04 12:27:16,213 INFO L226 Difference]: Without dead ends: 839 [2018-10-04 12:27:16,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:16,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-10-04 12:27:16,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-10-04 12:27:16,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-10-04 12:27:16,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-10-04 12:27:16,356 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-10-04 12:27:16,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:16,356 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-10-04 12:27:16,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:16,358 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-10-04 12:27:16,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:27:16,365 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:16,365 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:16,365 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:16,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:16,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-10-04 12:27:16,366 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:16,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:16,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:16,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:16,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:16,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:16,524 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:16,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:16,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:27:16,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:16,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:16,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:16,527 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-10-04 12:27:16,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:16,834 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-10-04 12:27:16,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:16,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 12:27:16,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:16,843 INFO L225 Difference]: With dead ends: 2505 [2018-10-04 12:27:16,843 INFO L226 Difference]: Without dead ends: 1671 [2018-10-04 12:27:16,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:16,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-10-04 12:27:17,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-10-04 12:27:17,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-10-04 12:27:17,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-10-04 12:27:17,083 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-10-04 12:27:17,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:17,083 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-10-04 12:27:17,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:17,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-10-04 12:27:17,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:27:17,087 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:17,087 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:17,090 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:17,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:17,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-10-04 12:27:17,091 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:17,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:17,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:17,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:17,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:17,393 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:17,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:27:17,393 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:27:17,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:17,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:27:17,895 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:27:17,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:27:17,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-04 12:27:17,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:27:17,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:27:17,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:27:17,964 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-10-04 12:27:18,194 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-04 12:27:18,551 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-04 12:27:19,140 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-04 12:27:19,624 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-04 12:27:21,817 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-04 12:27:22,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:22,031 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-10-04 12:27:22,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:27:22,032 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-10-04 12:27:22,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:22,047 INFO L225 Difference]: With dead ends: 4801 [2018-10-04 12:27:22,047 INFO L226 Difference]: Without dead ends: 3135 [2018-10-04 12:27:22,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:27:22,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-10-04 12:27:22,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-10-04 12:27:22,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-10-04 12:27:22,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-10-04 12:27:22,429 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-10-04 12:27:22,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:22,429 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-10-04 12:27:22,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:27:22,430 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-10-04 12:27:22,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-04 12:27:22,433 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:22,433 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 12:27:22,434 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:22,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:22,434 INFO L82 PathProgramCache]: Analyzing trace with hash 789936545, now seen corresponding path program 2 times [2018-10-04 12:27:22,434 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:22,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:22,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:22,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:22,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:22,576 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-04 12:27:22,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:22,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:27:22,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:22,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:22,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:22,577 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-10-04 12:27:23,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:23,145 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-10-04 12:27:23,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:23,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-04 12:27:23,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:23,156 INFO L225 Difference]: With dead ends: 4873 [2018-10-04 12:27:23,156 INFO L226 Difference]: Without dead ends: 2215 [2018-10-04 12:27:23,160 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:23,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-10-04 12:27:23,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-10-04 12:27:23,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-10-04 12:27:23,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-10-04 12:27:23,465 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-10-04 12:27:23,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:23,465 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-10-04 12:27:23,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:23,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-10-04 12:27:23,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-04 12:27:23,467 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:23,468 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-10-04 12:27:23,468 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:23,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:23,468 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-10-04 12:27:23,468 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:23,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:23,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:23,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:27:23,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:23,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:23,557 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-04 12:27:23,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:23,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:27:23,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:23,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:23,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:23,559 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-10-04 12:27:23,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:23,594 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-10-04 12:27:23,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:23,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-04 12:27:23,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:23,595 INFO L225 Difference]: With dead ends: 1799 [2018-10-04 12:27:23,595 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:27:23,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:23,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:27:23,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:27:23,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:27:23,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:27:23,598 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-10-04 12:27:23,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:23,599 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:27:23,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:23,599 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:27:23,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:27:23,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:27:23,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,741 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 38 [2018-10-04 12:27:23,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:23,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:24,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:25,225 WARN L178 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-10-04 12:27:25,448 WARN L178 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:27:25,667 WARN L178 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:27:25,959 WARN L178 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:27:26,240 WARN L178 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-10-04 12:27:26,406 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:27:26,532 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-10-04 12:27:26,732 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:27:26,858 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:27:27,012 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:27:27,169 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-10-04 12:27:27,442 WARN L178 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:27:27,446 INFO L421 ceAbstractionStarter]: At program point L411(lines 402 412) the Hoare annotation is: (let ((.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse6 (not (= ~p2_new ~nomsg))) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse4 .cse5 .cse6) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)))) [2018-10-04 12:27:27,446 INFO L421 ceAbstractionStarter]: At program point L539(lines 364 539) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-10-04 12:27:27,447 INFO L421 ceAbstractionStarter]: At program point L436(lines 436 446) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-10-04 12:27:27,447 INFO L421 ceAbstractionStarter]: At program point L416(lines 416 426) the Hoare annotation is: (let ((.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse6 (not (= ~p2_new ~nomsg))) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse4 .cse5 .cse6) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)))) [2018-10-04 12:27:27,447 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 542) no Hoare annotation was computed. [2018-10-04 12:27:27,447 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 542) no Hoare annotation was computed. [2018-10-04 12:27:27,447 INFO L421 ceAbstractionStarter]: At program point L536(lines 536 540) the Hoare annotation is: false [2018-10-04 12:27:27,447 INFO L421 ceAbstractionStarter]: At program point L371(lines 371 383) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-10-04 12:27:27,448 INFO L421 ceAbstractionStarter]: At program point L491(lines 485 492) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-10-04 12:27:27,448 INFO L421 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-10-04 12:27:27,448 INFO L421 ceAbstractionStarter]: At program point L388(lines 382 389) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (= ~mode2 (* 256 (div ~mode2 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-10-04 12:27:27,448 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 542) no Hoare annotation was computed. [2018-10-04 12:27:27,448 INFO L421 ceAbstractionStarter]: At program point L471(lines 464 472) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-10-04 12:27:27,449 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 541) no Hoare annotation was computed. [2018-10-04 12:27:27,449 INFO L421 ceAbstractionStarter]: At program point L393(lines 393 403) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (= ~mode2 (* 256 (div ~mode2 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-10-04 12:27:27,449 INFO L421 ceAbstractionStarter]: At program point L451(lines 445 452) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-10-04 12:27:27,449 INFO L421 ceAbstractionStarter]: At program point L509(lines 509 516) the Hoare annotation is: (let ((.cse0 (not (= ~p2_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse6 .cse7))) [2018-10-04 12:27:27,450 INFO L421 ceAbstractionStarter]: At program point L476(lines 476 486) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-10-04 12:27:27,450 INFO L421 ceAbstractionStarter]: At program point L530(lines 530 537) the Hoare annotation is: (and (= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= 1 ULTIMATE.start_check_~tmp~159) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-10-04 12:27:27,450 INFO L421 ceAbstractionStarter]: At program point L431(lines 425 432) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-10-04 12:27:27,450 INFO L421 ceAbstractionStarter]: At program point L456(lines 456 465) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-10-04 12:27:27,465 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,466 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,469 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,469 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,471 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,471 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,473 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,473 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,475 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,475 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,477 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,477 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,479 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,479 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,481 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,481 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,483 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,483 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,484 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,485 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,488 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,488 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,491 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,491 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,493 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,493 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,494 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,495 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,497 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,497 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,498 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,498 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,501 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,501 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,503 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,503 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,505 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,505 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,506 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,506 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,508 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 04.10 12:27:27 BoogieIcfgContainer [2018-10-04 12:27:27,509 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:27:27,509 INFO L168 Benchmark]: Toolchain (without parser) took 14888.97 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 178.3 MB). Free memory was 1.5 GB in the beginning and 962.0 MB in the end (delta: 495.3 MB). Peak memory consumption was 673.5 MB. Max. memory is 7.1 GB. [2018-10-04 12:27:27,511 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:27:27,511 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:27:27,512 INFO L168 Benchmark]: Boogie Preprocessor took 62.36 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:27:27,512 INFO L168 Benchmark]: RCFGBuilder took 912.27 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-10-04 12:27:27,513 INFO L168 Benchmark]: TraceAbstraction took 13865.87 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 178.3 MB). Free memory was 1.4 GB in the beginning and 962.0 MB in the end (delta: 442.4 MB). Peak memory consumption was 620.7 MB. Max. memory is 7.1 GB. [2018-10-04 12:27:27,517 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.20 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 62.36 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 912.27 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13865.87 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 178.3 MB). Free memory was 1.4 GB in the beginning and 962.0 MB in the end (delta: 442.4 MB). Peak memory consumption was 620.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 541]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 382]: Loop Invariant Derived loop invariant: (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 445]: Loop Invariant [2018-10-04 12:27:27,529 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,529 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,530 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,530 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 536]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 464]: Loop Invariant [2018-10-04 12:27:27,531 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,532 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,532 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,533 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 485]: Loop Invariant [2018-10-04 12:27:27,534 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,534 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,535 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,535 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 416]: Loop Invariant [2018-10-04 12:27:27,536 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,536 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,537 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,537 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) - InvariantResult [Line: 436]: Loop Invariant [2018-10-04 12:27:27,540 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,541 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,541 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,542 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 456]: Loop Invariant [2018-10-04 12:27:27,547 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,547 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,550 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,550 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && 1 <= check_~tmp~159) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 509]: Loop Invariant [2018-10-04 12:27:27,551 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,551 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,552 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,552 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: ((((((((assert_~arg == 1 && !(~p2_old == ~nomsg)) && 1 <= ~mode2) && ~mode2 <= 1) && 1 <= check_~tmp~159) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 476]: Loop Invariant [2018-10-04 12:27:27,559 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,559 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,560 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,560 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 364]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 402]: Loop Invariant [2018-10-04 12:27:27,562 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,562 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,563 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,563 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) - InvariantResult [Line: 425]: Loop Invariant [2018-10-04 12:27:27,566 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,566 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,566 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:27:27,567 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. SAFE Result, 13.7s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 6.0s AutomataDifference, 0.0s DeadEndRemovalTime, 3.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 327 SDslu, 307 SDs, 0 SdLazy, 224 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2101occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 1528 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 581 NumberOfFragments, 1160 HoareAnnotationTreeSize, 17 FomulaSimplifications, 70439 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 17 FomulaSimplificationsInter, 180 FormulaSimplificationTreeSizeReductionInter, 2.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 408 NumberOfCodeBlocks, 408 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 396 ConstructedInterpolants, 12 QuantifiedInterpolants, 49682 SizeOfPredicates, 1 NumberOfNonLiveVariables, 347 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 270/288 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-27-27-575.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.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-27-27-575.csv Received shutdown request...