java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 20:46:05,439 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:46:05,441 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:46:05,460 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:46:05,460 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:46:05,461 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:46:05,462 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:46:05,464 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:46:05,466 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:46:05,467 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:46:05,467 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:46:05,468 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:46:05,469 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:46:05,470 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:46:05,471 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:46:05,471 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:46:05,472 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:46:05,474 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:46:05,476 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:46:05,478 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:46:05,479 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:46:05,480 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:46:05,483 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:46:05,483 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:46:05,484 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:46:05,485 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:46:05,486 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:46:05,487 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:46:05,487 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:46:05,488 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:46:05,489 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:46:05,489 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:46:05,490 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:46:05,490 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:46:05,491 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:46:05,492 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:46:05,492 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-09-30 20:46:05,507 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:46:05,507 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:46:05,508 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:46:05,508 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:46:05,509 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:46:05,509 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:46:05,509 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:46:05,510 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:46:05,510 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:46:05,510 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:46:05,510 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:46:05,510 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:46:05,511 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:46:05,511 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:46:05,511 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:46:05,511 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:46:05,511 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:46:05,512 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:46:05,512 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:46:05,512 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:46:05,512 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:46:05,512 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:46:05,513 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:46:05,513 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:46:05,513 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:46:05,513 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:46:05,513 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:46:05,514 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:46:05,514 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:46:05,514 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:46:05,514 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 20:46:05,558 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:46:05,571 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:46:05,574 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:46:05,576 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:46:05,577 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:46:05,577 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-30 20:46:05,578 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl' [2018-09-30 20:46:05,656 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:46:05,659 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:46:05,660 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:46:05,660 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:46:05,661 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:46:05,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:46:05" (1/1) ... [2018-09-30 20:46:05,700 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:46:05" (1/1) ... [2018-09-30 20:46:05,708 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:46:05,709 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:46:05,709 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:46:05,710 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:46:05,725 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:46:05" (1/1) ... [2018-09-30 20:46:05,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:46:05" (1/1) ... [2018-09-30 20:46:05,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:46:05" (1/1) ... [2018-09-30 20:46:05,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:46:05" (1/1) ... [2018-09-30 20:46:05,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:46:05" (1/1) ... [2018-09-30 20:46:05,752 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:46:05" (1/1) ... [2018-09-30 20:46:05,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:46:05" (1/1) ... [2018-09-30 20:46:05,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:46:05,761 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:46:05,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:46:05,761 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:46:05,762 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:46:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:46:05,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 20:46:05,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 20:46:06,639 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 20:46:06,640 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:46:06 BoogieIcfgContainer [2018-09-30 20:46:06,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:46:06,641 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:46:06,641 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:46:06,647 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:46:06,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:46:05" (1/2) ... [2018-09-30 20:46:06,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@711b6423 and model type pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 08:46:06, skipping insertion in model container [2018-09-30 20:46:06,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:46:06" (2/2) ... [2018-09-30 20:46:06,651 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-30 20:46:06,662 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:46:06,675 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 20:46:06,739 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:46:06,740 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:46:06,740 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:46:06,741 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:46:06,741 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:46:06,741 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:46:06,741 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:46:06,741 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:46:06,744 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:46:06,764 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-09-30 20:46:06,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:46:06,780 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:46:06,783 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:46:06,784 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:46:06,793 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:46:06,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-09-30 20:46:06,796 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:46:06,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:46:06,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:06,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:46:06,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:46:07,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:46:07,166 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:46:07,166 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:46:07,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:46:07,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:46:07,183 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:46:07,185 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-09-30 20:46:07,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:46:07,292 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-09-30 20:46:07,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:46:07,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-30 20:46:07,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:46:07,314 INFO L225 Difference]: With dead ends: 57 [2018-09-30 20:46:07,314 INFO L226 Difference]: Without dead ends: 37 [2018-09-30 20:46:07,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:46:07,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-30 20:46:07,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-09-30 20:46:07,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-30 20:46:07,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-09-30 20:46:07,370 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-09-30 20:46:07,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:46:07,371 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-09-30 20:46:07,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:46:07,371 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-09-30 20:46:07,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:46:07,372 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:46:07,372 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:46:07,373 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:46:07,373 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:46:07,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-09-30 20:46:07,373 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:46:07,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:46:07,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:07,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:46:07,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:46:07,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:46:07,515 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:46:07,515 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:46:07,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:46:07,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:46:07,518 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:46:07,518 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-09-30 20:46:07,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:46:07,586 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-09-30 20:46:07,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:46:07,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-30 20:46:07,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:46:07,588 INFO L225 Difference]: With dead ends: 103 [2018-09-30 20:46:07,589 INFO L226 Difference]: Without dead ends: 69 [2018-09-30 20:46:07,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:46:07,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-30 20:46:07,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-09-30 20:46:07,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-30 20:46:07,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-09-30 20:46:07,610 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-09-30 20:46:07,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:46:07,611 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-09-30 20:46:07,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:46:07,611 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-09-30 20:46:07,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:46:07,617 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:46:07,617 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:46:07,618 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:46:07,618 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:46:07,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-09-30 20:46:07,619 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:46:07,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:46:07,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:07,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:46:07,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:46:07,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:46:07,836 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:46:07,836 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:46:07,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 20:46:07,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 20:46:07,837 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:46:07,837 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-09-30 20:46:08,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:46:08,206 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-09-30 20:46:08,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 20:46:08,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-09-30 20:46:08,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:46:08,213 INFO L225 Difference]: With dead ends: 141 [2018-09-30 20:46:08,213 INFO L226 Difference]: Without dead ends: 139 [2018-09-30 20:46:08,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:46:08,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-30 20:46:08,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-09-30 20:46:08,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-30 20:46:08,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-09-30 20:46:08,263 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-09-30 20:46:08,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:46:08,263 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-09-30 20:46:08,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 20:46:08,267 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-09-30 20:46:08,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:46:08,268 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:46:08,268 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:46:08,269 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:46:08,269 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:46:08,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-09-30 20:46:08,269 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:46:08,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:46:08,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:08,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:46:08,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:46:08,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:46:08,395 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:46:08,395 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:46:08,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:46:08,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:46:08,396 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:46:08,397 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-09-30 20:46:08,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:46:08,487 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-09-30 20:46:08,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:46:08,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-30 20:46:08,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:46:08,496 INFO L225 Difference]: With dead ends: 183 [2018-09-30 20:46:08,497 INFO L226 Difference]: Without dead ends: 109 [2018-09-30 20:46:08,498 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:46:08,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-30 20:46:08,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-30 20:46:08,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-30 20:46:08,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-09-30 20:46:08,528 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-09-30 20:46:08,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:46:08,531 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-09-30 20:46:08,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:46:08,531 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-09-30 20:46:08,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 20:46:08,533 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:46:08,533 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:46:08,533 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:46:08,534 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:46:08,534 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-09-30 20:46:08,534 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:46:08,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:46:08,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:08,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:46:08,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:46:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:46:08,647 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:46:08,647 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:46:08,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:46:08,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:46:08,648 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:46:08,648 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-09-30 20:46:08,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:46:08,829 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-09-30 20:46:08,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:46:08,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-30 20:46:08,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:46:08,832 INFO L225 Difference]: With dead ends: 321 [2018-09-30 20:46:08,832 INFO L226 Difference]: Without dead ends: 215 [2018-09-30 20:46:08,833 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:46:08,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-30 20:46:08,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-09-30 20:46:08,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-30 20:46:08,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-09-30 20:46:08,879 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-09-30 20:46:08,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:46:08,880 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-09-30 20:46:08,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:46:08,880 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-09-30 20:46:08,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 20:46:08,882 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:46:08,882 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:46:08,883 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:46:08,883 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:46:08,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-09-30 20:46:08,883 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:46:08,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:46:08,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:08,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:46:08,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:46:09,053 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:46:09,054 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:46:09,054 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:46:09,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:46:09,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:46:09,055 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:46:09,055 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-09-30 20:46:09,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:46:09,331 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-09-30 20:46:09,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:46:09,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-30 20:46:09,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:46:09,338 INFO L225 Difference]: With dead ends: 633 [2018-09-30 20:46:09,338 INFO L226 Difference]: Without dead ends: 423 [2018-09-30 20:46:09,343 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:46:09,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-09-30 20:46:09,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-09-30 20:46:09,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-09-30 20:46:09,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-09-30 20:46:09,427 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-09-30 20:46:09,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:46:09,427 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-09-30 20:46:09,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:46:09,428 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-09-30 20:46:09,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 20:46:09,433 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:46:09,433 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:46:09,434 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:46:09,434 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:46:09,434 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-09-30 20:46:09,434 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:46:09,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:46:09,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:09,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:46:09,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:46:09,565 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:46:09,565 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:46:09,566 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:46:09,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:46:09,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:46:09,567 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:46:09,567 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-09-30 20:46:09,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:46:09,801 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-09-30 20:46:09,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:46:09,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-30 20:46:09,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:46:09,815 INFO L225 Difference]: With dead ends: 1257 [2018-09-30 20:46:09,815 INFO L226 Difference]: Without dead ends: 839 [2018-09-30 20:46:09,816 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:46:09,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-09-30 20:46:09,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-09-30 20:46:09,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-09-30 20:46:09,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-09-30 20:46:09,934 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-09-30 20:46:09,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:46:09,935 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-09-30 20:46:09,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:46:09,935 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-09-30 20:46:09,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 20:46:09,944 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:46:09,944 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:46:09,944 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:46:09,945 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:46:09,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-09-30 20:46:09,945 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:46:09,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:46:09,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:09,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:46:09,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:46:10,059 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:46:10,060 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:46:10,060 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:46:10,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:46:10,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:46:10,061 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:46:10,061 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-09-30 20:46:10,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:46:10,413 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-09-30 20:46:10,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:46:10,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-30 20:46:10,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:46:10,423 INFO L225 Difference]: With dead ends: 2505 [2018-09-30 20:46:10,424 INFO L226 Difference]: Without dead ends: 1671 [2018-09-30 20:46:10,426 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:46:10,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-09-30 20:46:10,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-09-30 20:46:10,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-09-30 20:46:10,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-09-30 20:46:10,642 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-09-30 20:46:10,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:46:10,643 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-09-30 20:46:10,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:46:10,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-09-30 20:46:10,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 20:46:10,646 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:46:10,646 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:46:10,647 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:46:10,647 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:46:10,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-09-30 20:46:10,647 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:46:10,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:46:10,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:10,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:46:10,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:10,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:46:10,764 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:46:10,765 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:46:10,765 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:46:10,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:46:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:46:10,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:46:11,624 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 20:46:11,660 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:46:11,660 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-30 20:46:11,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:46:11,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:46:11,661 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:46:11,661 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-09-30 20:46:16,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:46:16,786 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-09-30 20:46:16,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 20:46:16,787 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-09-30 20:46:16,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:46:16,801 INFO L225 Difference]: With dead ends: 4801 [2018-09-30 20:46:16,801 INFO L226 Difference]: Without dead ends: 3135 [2018-09-30 20:46:16,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-09-30 20:46:16,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-09-30 20:46:17,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-09-30 20:46:17,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-09-30 20:46:17,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-09-30 20:46:17,168 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-09-30 20:46:17,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:46:17,169 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-09-30 20:46:17,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:46:17,169 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-09-30 20:46:17,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-30 20:46:17,173 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:46:17,174 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-30 20:46:17,174 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:46:17,174 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:46:17,174 INFO L82 PathProgramCache]: Analyzing trace with hash 789936545, now seen corresponding path program 2 times [2018-09-30 20:46:17,174 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:46:17,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:46:17,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:17,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:46:17,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:46:17,312 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-30 20:46:17,312 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:46:17,312 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:46:17,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:46:17,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:46:17,313 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:46:17,314 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-09-30 20:46:17,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:46:17,809 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-09-30 20:46:17,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:46:17,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-30 20:46:17,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:46:17,817 INFO L225 Difference]: With dead ends: 4873 [2018-09-30 20:46:17,818 INFO L226 Difference]: Without dead ends: 2215 [2018-09-30 20:46:17,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:46:17,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-09-30 20:46:18,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-09-30 20:46:18,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-09-30 20:46:18,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-09-30 20:46:18,092 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-09-30 20:46:18,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:46:18,092 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-09-30 20:46:18,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:46:18,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-09-30 20:46:18,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-30 20:46:18,098 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:46:18,098 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-09-30 20:46:18,098 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:46:18,098 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:46:18,099 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-09-30 20:46:18,099 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:46:18,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:46:18,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:18,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:46:18,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:46:18,198 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-09-30 20:46:18,198 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:46:18,198 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:46:18,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:46:18,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:46:18,201 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:46:18,201 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-09-30 20:46:18,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:46:18,233 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-09-30 20:46:18,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:46:18,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-30 20:46:18,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:46:18,233 INFO L225 Difference]: With dead ends: 1799 [2018-09-30 20:46:18,233 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 20:46:18,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:46:18,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 20:46:18,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 20:46:18,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 20:46:18,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 20:46:18,237 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-09-30 20:46:18,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:46:18,237 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 20:46:18,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:46:18,237 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 20:46:18,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 20:46:18,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 20:46:18,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,409 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 38 [2018-09-30 20:46:18,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,687 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-09-30 20:46:18,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:18,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,344 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-09-30 20:46:19,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:19,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:20,635 WARN L178 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-09-30 20:46:21,973 WARN L178 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 20:46:22,259 WARN L178 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 20:46:22,400 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 20:46:22,610 WARN L178 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-30 20:46:22,797 WARN L178 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 20:46:23,047 WARN L178 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-09-30 20:46:23,149 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-09-30 20:46:23,255 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 20:46:23,406 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 20:46:23,614 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 20:46:23,835 WARN L178 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-30 20:46:24,032 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 20:46:24,036 INFO L422 ceAbstractionStarter]: At program point L411(lines 402 412) the Hoare annotation is: (let ((.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse6 (not (= ~p2_new ~nomsg))) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse4 .cse5 .cse6) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)))) [2018-09-30 20:46:24,036 INFO L422 ceAbstractionStarter]: At program point L539(lines 364 539) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-30 20:46:24,036 INFO L422 ceAbstractionStarter]: At program point L436(lines 436 446) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 20:46:24,037 INFO L422 ceAbstractionStarter]: At program point L416(lines 416 426) the Hoare annotation is: (let ((.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse6 (not (= ~p2_new ~nomsg))) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse4 .cse5 .cse6) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)))) [2018-09-30 20:46:24,037 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 542) no Hoare annotation was computed. [2018-09-30 20:46:24,037 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 542) no Hoare annotation was computed. [2018-09-30 20:46:24,037 INFO L422 ceAbstractionStarter]: At program point L536(lines 536 540) the Hoare annotation is: false [2018-09-30 20:46:24,037 INFO L422 ceAbstractionStarter]: At program point L371(lines 371 383) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-30 20:46:24,038 INFO L422 ceAbstractionStarter]: At program point L491(lines 485 492) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 20:46:24,038 INFO L422 ceAbstractionStarter]: At program point L520(lines 515 521) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= 1 ULTIMATE.start_check_~tmp~159) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-09-30 20:46:24,038 INFO L422 ceAbstractionStarter]: At program point L388(lines 382 389) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (= ~mode2 (* 256 (div ~mode2 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-30 20:46:24,038 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 541) no Hoare annotation was computed. [2018-09-30 20:46:24,038 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 542) no Hoare annotation was computed. [2018-09-30 20:46:24,039 INFO L422 ceAbstractionStarter]: At program point L471(lines 464 472) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 20:46:24,039 INFO L422 ceAbstractionStarter]: At program point L393(lines 393 403) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (= ~mode2 (* 256 (div ~mode2 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-30 20:46:24,039 INFO L422 ceAbstractionStarter]: At program point L451(lines 445 452) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 20:46:24,039 INFO L422 ceAbstractionStarter]: At program point L509(lines 509 516) the Hoare annotation is: (let ((.cse0 (not (= ~p2_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse6 .cse7))) [2018-09-30 20:46:24,040 INFO L422 ceAbstractionStarter]: At program point L476(lines 476 486) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 20:46:24,040 INFO L422 ceAbstractionStarter]: At program point L530(lines 530 537) the Hoare annotation is: (and (= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= 1 ULTIMATE.start_check_~tmp~159) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-09-30 20:46:24,040 INFO L422 ceAbstractionStarter]: At program point L431(lines 425 432) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 20:46:24,041 INFO L422 ceAbstractionStarter]: At program point L456(lines 456 465) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 20:46:24,054 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,056 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,058 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,058 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,060 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,061 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,062 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,062 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,064 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,065 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,066 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,067 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,070 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,070 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,072 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,072 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,078 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,078 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,083 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,083 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,086 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,086 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,091 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,091 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,095 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,096 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,100 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,100 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,101 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,101 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,104 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,105 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,106 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,106 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,111 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,111 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,112 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,112 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,115 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,116 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,119 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 08:46:24 BoogieIcfgContainer [2018-09-30 20:46:24,119 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 20:46:24,120 INFO L168 Benchmark]: Toolchain (without parser) took 18463.87 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 224.9 MB). Free memory was 1.4 GB in the beginning and 909.7 MB in the end (delta: 506.1 MB). Peak memory consumption was 731.0 MB. Max. memory is 7.1 GB. [2018-09-30 20:46:24,122 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:46:24,122 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:46:24,123 INFO L168 Benchmark]: Boogie Preprocessor took 50.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:46:24,124 INFO L168 Benchmark]: RCFGBuilder took 879.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-30 20:46:24,125 INFO L168 Benchmark]: TraceAbstraction took 17478.17 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 224.9 MB). Free memory was 1.4 GB in the beginning and 909.7 MB in the end (delta: 463.8 MB). Peak memory consumption was 688.7 MB. Max. memory is 7.1 GB. [2018-09-30 20:46:24,129 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 879.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17478.17 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 224.9 MB). Free memory was 1.4 GB in the beginning and 909.7 MB in the end (delta: 463.8 MB). Peak memory consumption was 688.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-09-30 20:46:24,141 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,141 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,142 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,142 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 536]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 464]: Loop Invariant [2018-09-30 20:46:24,143 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,143 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,144 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,145 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 485]: Loop Invariant [2018-09-30 20:46:24,145 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,146 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,146 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,147 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 416]: Loop Invariant [2018-09-30 20:46:24,148 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,148 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,149 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,149 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) - InvariantResult [Line: 436]: Loop Invariant [2018-09-30 20:46:24,150 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,150 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,151 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,151 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 456]: Loop Invariant [2018-09-30 20:46:24,153 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,153 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,154 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,154 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && 1 <= check_~tmp~159) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 509]: Loop Invariant [2018-09-30 20:46:24,155 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,155 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,156 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,156 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: ((((((((assert_~arg == 1 && !(~p2_old == ~nomsg)) && 1 <= ~mode2) && ~mode2 <= 1) && 1 <= check_~tmp~159) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 476]: Loop Invariant [2018-09-30 20:46:24,157 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,158 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,158 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,159 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 364]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 402]: Loop Invariant [2018-09-30 20:46:24,160 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,160 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,162 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,162 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) - InvariantResult [Line: 425]: Loop Invariant [2018-09-30 20:46:24,163 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,163 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,164 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:24,164 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. SAFE Result, 17.3s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 7.4s AutomataDifference, 0.0s DeadEndRemovalTime, 5.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 327 SDslu, 307 SDs, 0 SdLazy, 224 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2101occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 1528 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 581 NumberOfFragments, 1160 HoareAnnotationTreeSize, 17 FomulaSimplifications, 70439 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 17 FomulaSimplificationsInter, 180 FormulaSimplificationTreeSizeReductionInter, 4.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 408 NumberOfCodeBlocks, 408 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 396 ConstructedInterpolants, 12 QuantifiedInterpolants, 49682 SizeOfPredicates, 1 NumberOfNonLiveVariables, 347 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 270/288 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_20-46-24-171.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_20-46-24-171.csv Received shutdown request...