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.2.ufo.BOUNDED-12.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:55:05,363 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:55:05,365 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:55:05,380 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:55:05,381 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:55:05,382 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:55:05,384 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:55:05,385 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:55:05,387 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:55:05,388 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:55:05,389 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:55:05,389 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:55:05,390 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:55:05,391 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:55:05,392 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:55:05,393 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:55:05,394 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:55:05,396 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:55:05,398 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:55:05,399 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:55:05,400 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:55:05,401 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:55:05,404 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:55:05,404 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:55:05,404 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:55:05,405 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:55:05,406 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:55:05,407 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:55:05,408 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:55:05,409 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:55:05,409 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:55:05,410 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:55:05,410 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:55:05,410 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:55:05,411 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:55:05,412 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:55:05,412 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-01 00:55:05,427 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:55:05,427 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:55:05,428 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:55:05,428 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:55:05,429 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:55:05,429 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:55:05,429 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:55:05,429 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:55:05,430 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:55:05,430 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:55:05,430 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:55:05,430 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:55:05,430 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:55:05,431 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:55:05,431 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:55:05,431 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:55:05,431 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:55:05,431 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:55:05,432 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:55:05,432 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:55:05,432 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:55:05,432 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:55:05,433 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:55:05,433 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:55:05,433 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:55:05,433 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:55:05,433 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:55:05,433 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:55:05,434 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:55:05,434 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:55:05,434 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:55:05,476 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:55:05,499 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:55:05,505 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:55:05,506 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:55:05,507 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:55:05,507 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.2.ufo.BOUNDED-12.pals.c_12.bpl [2018-10-01 00:55:05,508 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl' [2018-10-01 00:55:05,590 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:55:05,594 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:55:05,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:55:05,595 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:55:05,595 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:55:05,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:05" (1/1) ... [2018-10-01 00:55:05,635 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:05" (1/1) ... [2018-10-01 00:55:05,643 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:55:05,644 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:55:05,644 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:55:05,645 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:55:05,656 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:05" (1/1) ... [2018-10-01 00:55:05,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:05" (1/1) ... [2018-10-01 00:55:05,667 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:05" (1/1) ... [2018-10-01 00:55:05,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:05" (1/1) ... [2018-10-01 00:55:05,686 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:05" (1/1) ... [2018-10-01 00:55:05,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:05" (1/1) ... [2018-10-01 00:55:05,691 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:05" (1/1) ... [2018-10-01 00:55:05,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:55:05,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:55:05,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:55:05,697 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:55:05,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55: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-10-01 00:55:05,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 00:55:05,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 00:55:06,506 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 00:55:06,506 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:55:06 BoogieIcfgContainer [2018-10-01 00:55:06,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:55:06,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:55:06,508 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:55:06,511 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:55:06,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:05" (1/2) ... [2018-10-01 00:55:06,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16308356 and model type pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:55:06, skipping insertion in model container [2018-10-01 00:55:06,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:55:06" (2/2) ... [2018-10-01 00:55:06,515 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl [2018-10-01 00:55:06,524 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:55:06,534 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-01 00:55:06,578 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:55:06,578 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:55:06,579 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:55:06,579 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:55:06,579 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:55:06,579 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:55:06,579 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:55:06,580 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:55:06,580 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:55:06,595 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-10-01 00:55:06,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:55:06,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:06,603 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:06,604 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:06,614 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:06,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-10-01 00:55:06,616 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:06,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:06,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:06,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:06,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:06,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:55:06,913 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:06,913 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:55:06,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:06,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:06,933 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:06,936 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-10-01 00:55:07,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:07,050 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-10-01 00:55:07,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:07,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-01 00:55:07,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:07,065 INFO L225 Difference]: With dead ends: 57 [2018-10-01 00:55:07,065 INFO L226 Difference]: Without dead ends: 37 [2018-10-01 00:55:07,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:07,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-01 00:55:07,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-10-01 00:55:07,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-01 00:55:07,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-10-01 00:55:07,116 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-10-01 00:55:07,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:07,116 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-10-01 00:55:07,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:07,116 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-10-01 00:55:07,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:55:07,117 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:07,117 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:07,118 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:07,118 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:07,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-10-01 00:55:07,118 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:07,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:07,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:07,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:07,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:07,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:55:07,291 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:07,291 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:55:07,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:07,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:07,293 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:07,294 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-10-01 00:55:07,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:07,360 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-10-01 00:55:07,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:07,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-01 00:55:07,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:07,363 INFO L225 Difference]: With dead ends: 103 [2018-10-01 00:55:07,363 INFO L226 Difference]: Without dead ends: 69 [2018-10-01 00:55:07,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:07,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-01 00:55:07,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-10-01 00:55:07,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-01 00:55:07,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-10-01 00:55:07,383 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-10-01 00:55:07,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:07,383 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-10-01 00:55:07,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:07,384 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-10-01 00:55:07,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:55:07,385 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:07,385 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:07,385 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:07,385 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:07,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-10-01 00:55:07,386 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:07,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:07,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:07,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:07,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:07,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:55:07,502 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:07,502 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:55:07,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:07,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:07,503 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:07,503 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 3 states. [2018-10-01 00:55:07,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:07,588 INFO L93 Difference]: Finished difference Result 199 states and 280 transitions. [2018-10-01 00:55:07,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:07,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-01 00:55:07,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:07,593 INFO L225 Difference]: With dead ends: 199 [2018-10-01 00:55:07,594 INFO L226 Difference]: Without dead ends: 133 [2018-10-01 00:55:07,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:07,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-01 00:55:07,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-10-01 00:55:07,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-01 00:55:07,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 182 transitions. [2018-10-01 00:55:07,627 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 182 transitions. Word has length 18 [2018-10-01 00:55:07,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:07,628 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 182 transitions. [2018-10-01 00:55:07,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:07,628 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 182 transitions. [2018-10-01 00:55:07,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:55:07,629 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:07,629 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:07,630 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:07,630 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:07,630 INFO L82 PathProgramCache]: Analyzing trace with hash 823143127, now seen corresponding path program 1 times [2018-10-01 00:55:07,630 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:07,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:07,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:07,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:07,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:07,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:55:07,783 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:07,783 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:55:07,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:55:07,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:55:07,784 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:07,785 INFO L87 Difference]: Start difference. First operand 131 states and 182 transitions. Second operand 4 states. [2018-10-01 00:55:08,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:08,368 INFO L93 Difference]: Finished difference Result 277 states and 379 transitions. [2018-10-01 00:55:08,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:55:08,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-01 00:55:08,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:08,377 INFO L225 Difference]: With dead ends: 277 [2018-10-01 00:55:08,377 INFO L226 Difference]: Without dead ends: 275 [2018-10-01 00:55:08,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:55:08,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-01 00:55:08,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 147. [2018-10-01 00:55:08,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-01 00:55:08,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 198 transitions. [2018-10-01 00:55:08,457 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 198 transitions. Word has length 18 [2018-10-01 00:55:08,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:08,457 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 198 transitions. [2018-10-01 00:55:08,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:55:08,458 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 198 transitions. [2018-10-01 00:55:08,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:55:08,459 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:08,459 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:08,459 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:08,459 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:08,460 INFO L82 PathProgramCache]: Analyzing trace with hash 823202709, now seen corresponding path program 1 times [2018-10-01 00:55:08,460 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:08,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:08,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:08,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:08,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:08,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:08,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:55:08,569 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:08,569 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:55:08,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:08,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:08,570 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:08,570 INFO L87 Difference]: Start difference. First operand 147 states and 198 transitions. Second operand 3 states. [2018-10-01 00:55:08,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:08,763 INFO L93 Difference]: Finished difference Result 359 states and 485 transitions. [2018-10-01 00:55:08,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:08,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-01 00:55:08,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:08,766 INFO L225 Difference]: With dead ends: 359 [2018-10-01 00:55:08,766 INFO L226 Difference]: Without dead ends: 213 [2018-10-01 00:55:08,767 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:08,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-10-01 00:55:08,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-10-01 00:55:08,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-01 00:55:08,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-10-01 00:55:08,810 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 18 [2018-10-01 00:55:08,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:08,810 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-10-01 00:55:08,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:08,811 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-10-01 00:55:08,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-01 00:55:08,812 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:08,813 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:08,813 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:08,813 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:08,813 INFO L82 PathProgramCache]: Analyzing trace with hash 748385901, now seen corresponding path program 1 times [2018-10-01 00:55:08,814 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:08,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:08,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:08,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:08,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:08,969 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:55:08,969 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:08,970 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:55:08,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:08,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:08,971 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:08,972 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-10-01 00:55:09,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:09,207 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-10-01 00:55:09,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:09,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-01 00:55:09,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:09,214 INFO L225 Difference]: With dead ends: 633 [2018-10-01 00:55:09,214 INFO L226 Difference]: Without dead ends: 423 [2018-10-01 00:55:09,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:09,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-01 00:55:09,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-10-01 00:55:09,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-10-01 00:55:09,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-10-01 00:55:09,296 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-10-01 00:55:09,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:09,297 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-10-01 00:55:09,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:09,297 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-10-01 00:55:09,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-01 00:55:09,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:09,302 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:09,302 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:09,302 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:09,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1759503151, now seen corresponding path program 1 times [2018-10-01 00:55:09,306 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:09,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:09,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:09,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:09,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:09,432 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:55:09,432 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:09,432 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:55:09,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:09,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:09,433 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:09,434 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-10-01 00:55:09,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:09,780 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-10-01 00:55:09,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:09,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-01 00:55:09,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:09,785 INFO L225 Difference]: With dead ends: 1257 [2018-10-01 00:55:09,786 INFO L226 Difference]: Without dead ends: 839 [2018-10-01 00:55:09,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:09,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-10-01 00:55:09,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-10-01 00:55:09,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-10-01 00:55:09,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-10-01 00:55:09,911 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-10-01 00:55:09,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:09,912 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-10-01 00:55:09,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:09,912 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-10-01 00:55:09,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-01 00:55:09,915 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:09,915 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:09,916 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:09,916 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:09,916 INFO L82 PathProgramCache]: Analyzing trace with hash -2142437135, now seen corresponding path program 1 times [2018-10-01 00:55:09,916 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:09,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:09,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:09,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:09,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:10,029 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:55:10,030 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:10,030 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:55:10,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:10,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:10,031 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:10,031 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-10-01 00:55:10,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:10,504 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-10-01 00:55:10,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:10,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-01 00:55:10,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:10,513 INFO L225 Difference]: With dead ends: 2505 [2018-10-01 00:55:10,514 INFO L226 Difference]: Without dead ends: 1671 [2018-10-01 00:55:10,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:10,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-10-01 00:55:10,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-10-01 00:55:10,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-10-01 00:55:10,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-10-01 00:55:10,750 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-10-01 00:55:10,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:10,751 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-10-01 00:55:10,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:10,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-10-01 00:55:10,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-01 00:55:10,754 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:10,754 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:10,754 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:10,754 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:10,754 INFO L82 PathProgramCache]: Analyzing trace with hash 2095271859, now seen corresponding path program 1 times [2018-10-01 00:55:10,755 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:10,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:10,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:10,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:10,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:10,939 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-01 00:55:10,939 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:55:10,940 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:55:10,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:11,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:55:12,365 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:55:12,403 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:55:12,403 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2018-10-01 00:55:12,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:55:12,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:55:12,404 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:12,404 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-10-01 00:55:18,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:18,075 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-10-01 00:55:18,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-01 00:55:18,076 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-10-01 00:55:18,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:18,090 INFO L225 Difference]: With dead ends: 4801 [2018-10-01 00:55:18,091 INFO L226 Difference]: Without dead ends: 3135 [2018-10-01 00:55:18,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time [2018-10-01 00:55:18,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-10-01 00:55:18,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-10-01 00:55:18,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-10-01 00:55:18,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-10-01 00:55:18,799 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-10-01 00:55:18,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:18,799 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-10-01 00:55:18,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:55:18,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-10-01 00:55:18,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-01 00:55:18,803 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:18,804 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-01 00:55:18,804 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:18,804 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:18,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1417215583, now seen corresponding path program 2 times [2018-10-01 00:55:18,807 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:18,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:18,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:18,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:18,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:18,955 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-01 00:55:18,956 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:18,956 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:55:18,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:18,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:18,957 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:18,957 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-10-01 00:55:19,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:19,572 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-10-01 00:55:19,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:19,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-01 00:55:19,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:19,582 INFO L225 Difference]: With dead ends: 4873 [2018-10-01 00:55:19,582 INFO L226 Difference]: Without dead ends: 2215 [2018-10-01 00:55:19,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:19,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-10-01 00:55:19,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-10-01 00:55:19,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-10-01 00:55:19,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-10-01 00:55:19,995 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-10-01 00:55:19,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:19,996 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-10-01 00:55:19,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:19,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-10-01 00:55:19,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-01 00:55:19,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:19,999 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-10-01 00:55:19,999 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:19,999 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:20,000 INFO L82 PathProgramCache]: Analyzing trace with hash 79784675, now seen corresponding path program 3 times [2018-10-01 00:55:20,000 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:20,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:20,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:20,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:55:20,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:20,102 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-01 00:55:20,103 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:20,103 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:55:20,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:20,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:20,103 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:20,104 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-10-01 00:55:20,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:20,141 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-10-01 00:55:20,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:20,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-01 00:55:20,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:20,142 INFO L225 Difference]: With dead ends: 1799 [2018-10-01 00:55:20,142 INFO L226 Difference]: Without dead ends: 0 [2018-10-01 00:55:20,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:20,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-01 00:55:20,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-01 00:55:20,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-01 00:55:20,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-01 00:55:20,153 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-10-01 00:55:20,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:20,153 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-01 00:55:20,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:20,153 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-01 00:55:20,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-01 00:55:20,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-01 00:55:20,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,341 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 127 [2018-10-01 00:55:20,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,546 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 127 [2018-10-01 00:55:20,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,655 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 127 [2018-10-01 00:55:20,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,785 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 127 [2018-10-01 00:55:20,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:20,982 WARN L178 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 316 DAG size of output: 94 [2018-10-01 00:55:21,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,089 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 54 [2018-10-01 00:55:21,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,230 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 127 [2018-10-01 00:55:21,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,379 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 54 [2018-10-01 00:55:21,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,595 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 127 [2018-10-01 00:55:21,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,818 WARN L178 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 110 [2018-10-01 00:55:21,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:21,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:22,209 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 316 DAG size of output: 94 [2018-10-01 00:55:23,656 WARN L178 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 122 DAG size of output: 29 [2018-10-01 00:55:24,160 WARN L178 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2018-10-01 00:55:25,066 WARN L178 SmtUtils]: Spent 903.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 29 [2018-10-01 00:55:25,359 WARN L178 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 29 [2018-10-01 00:55:25,592 WARN L178 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 29 [2018-10-01 00:55:25,887 WARN L178 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 38 [2018-10-01 00:55:26,307 WARN L178 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2018-10-01 00:55:26,489 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 29 [2018-10-01 00:55:26,694 WARN L178 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2018-10-01 00:55:26,808 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2018-10-01 00:55:27,019 WARN L178 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 29 [2018-10-01 00:55:27,212 WARN L178 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 29 [2018-10-01 00:55:27,629 WARN L178 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 29 [2018-10-01 00:55:28,182 WARN L178 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2018-10-01 00:55:29,649 WARN L178 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 122 DAG size of output: 29 [2018-10-01 00:55:30,020 WARN L178 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 38 [2018-10-01 00:55:30,024 INFO L422 ceAbstractionStarter]: At program point L415(lines 415 425) the Hoare annotation is: (let ((.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (= (+ ~nomsg 1) 0))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (<= ~r1 1) (<= 1 ~mode2) (<= ~mode2 1) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= ~p2_new .cse0) (<= 0 v_prenex_1)))) .cse1 .cse2 .cse3) (and (and (exists ((v_prenex_1 Int)) (let ((.cse4 (mod v_prenex_1 256))) (and (<= .cse4 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse4 ~p2_old)))) .cse1 .cse2 .cse3) (<= ~mode3 1) (<= 1 ~mode3)))) [2018-10-01 00:55:30,024 INFO L422 ceAbstractionStarter]: At program point L535(lines 535 542) the Hoare annotation is: false [2018-10-01 00:55:30,024 INFO L422 ceAbstractionStarter]: At program point L490(lines 484 491) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= ~p2_new .cse0) (<= 0 v_prenex_1)))) (<= ~send2 127) (<= 0 ~send2) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3)) [2018-10-01 00:55:30,024 INFO L422 ceAbstractionStarter]: At program point L519(lines 514 520) the Hoare annotation is: (and (<= 1 ULTIMATE.start_check_~tmp~156) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse0 ~p2_old))))) [2018-10-01 00:55:30,024 INFO L422 ceAbstractionStarter]: At program point L387(lines 382 388) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= (+ ~nomsg 1) 0))) (or (and (= ~mode2 (* 256 (div ~mode2 256))) (and (<= ~r1 0) (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= 0 ~r1))) (and (exists ((v_prenex_1 Int)) (let ((.cse3 (mod v_prenex_1 256))) (and (<= .cse3 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse3 ~p2_old)))) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 .cse2 (<= ~mode3 1) (<= 1 ~mode3)))) [2018-10-01 00:55:30,024 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 544) no Hoare annotation was computed. [2018-10-01 00:55:30,025 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 544) no Hoare annotation was computed. [2018-10-01 00:55:30,025 INFO L422 ceAbstractionStarter]: At program point L470(lines 464 471) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= ~p2_new .cse0) (<= 0 v_prenex_1)))) (<= ~send2 127) (<= 0 ~send2) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3)) [2018-10-01 00:55:30,025 INFO L422 ceAbstractionStarter]: At program point L392(lines 392 402) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= (+ ~nomsg 1) 0))) (or (and (= ~mode2 (* 256 (div ~mode2 256))) (and (<= ~r1 0) (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= 0 ~r1))) (and (exists ((v_prenex_1 Int)) (let ((.cse3 (mod v_prenex_1 256))) (and (<= .cse3 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse3 ~p2_old)))) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 .cse2 (<= ~mode3 1) (<= 1 ~mode3)))) [2018-10-01 00:55:30,025 INFO L422 ceAbstractionStarter]: At program point L450(lines 444 451) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= ~p2_new .cse0) (<= 0 v_prenex_1)))) (<= ~send2 127) (<= 0 ~send2) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3)) [2018-10-01 00:55:30,025 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 544) no Hoare annotation was computed. [2018-10-01 00:55:30,025 INFO L422 ceAbstractionStarter]: At program point L541(lines 365 541) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= (+ ~nomsg 1) 0))) (or (and (<= ~r1 0) (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= 0 ~r1)) (and (exists ((v_prenex_1 Int)) (let ((.cse3 (mod v_prenex_1 256))) (and (<= .cse3 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse3 ~p2_old)))) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 .cse2 (<= ~mode3 1) (<= 1 ~mode3)))) [2018-10-01 00:55:30,026 INFO L422 ceAbstractionStarter]: At program point L508(lines 508 515) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (<= ~send2 127) (<= 0 ~send2) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse0 ~p2_old))))) [2018-10-01 00:55:30,026 INFO L422 ceAbstractionStarter]: At program point L475(lines 475 485) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= ~p2_new .cse0) (<= 0 v_prenex_1)))) (<= ~send2 127) (<= 0 ~send2) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3)) [2018-10-01 00:55:30,026 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 543) no Hoare annotation was computed. [2018-10-01 00:55:30,026 INFO L422 ceAbstractionStarter]: At program point L372(lines 372 383) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= (+ ~nomsg 1) 0))) (or (and (<= ~r1 0) (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= 0 ~r1)) (and (exists ((v_prenex_1 Int)) (let ((.cse3 (mod v_prenex_1 256))) (and (<= .cse3 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse3 ~p2_old)))) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 .cse2 (<= ~mode3 1) (<= 1 ~mode3)))) [2018-10-01 00:55:30,027 INFO L422 ceAbstractionStarter]: At program point L529(lines 529 536) the Hoare annotation is: (and (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~156) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse0 ~p2_old))))) [2018-10-01 00:55:30,027 INFO L422 ceAbstractionStarter]: At program point L430(lines 424 431) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= ~p2_new .cse0) (<= 0 v_prenex_1)))) (<= ~send2 127) (<= 0 ~send2) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3)) [2018-10-01 00:55:30,027 INFO L422 ceAbstractionStarter]: At program point L455(lines 455 465) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= ~p2_new .cse0) (<= 0 v_prenex_1)))) (<= ~send2 127) (<= 0 ~send2) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3)) [2018-10-01 00:55:30,027 INFO L422 ceAbstractionStarter]: At program point L410(lines 401 411) the Hoare annotation is: (let ((.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (= (+ ~nomsg 1) 0))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (<= ~r1 1) (<= 1 ~mode2) (<= ~mode2 1) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= ~p2_new .cse0) (<= 0 v_prenex_1)))) .cse1 .cse2 .cse3) (and (and (exists ((v_prenex_1 Int)) (let ((.cse4 (mod v_prenex_1 256))) (and (<= .cse4 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse4 ~p2_old)))) .cse1 .cse2 .cse3) (<= ~mode3 1) (<= 1 ~mode3)))) [2018-10-01 00:55:30,028 INFO L422 ceAbstractionStarter]: At program point L435(lines 435 445) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= ~p2_new .cse0) (<= 0 v_prenex_1)))) (<= ~send2 127) (<= 0 ~send2) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3)) [2018-10-01 00:55:30,034 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,035 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,036 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,036 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,041 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,042 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,042 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,042 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,045 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,045 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,045 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,045 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,048 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,048 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,048 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,048 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,050 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,050 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,050 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,051 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,052 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,052 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,052 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,053 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,054 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,054 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,054 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,055 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,056 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,056 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,056 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,057 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,058 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,058 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,059 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,059 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,060 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,060 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,061 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,061 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,063 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,063 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,063 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,063 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,064 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,064 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,064 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,064 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,066 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,066 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,066 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,067 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,067 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,067 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,067 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,068 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,069 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,069 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,070 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,070 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,072 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,072 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,072 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,072 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,073 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,074 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,074 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,074 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,075 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,075 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,076 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,076 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,077 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,077 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,078 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,078 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,079 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,079 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,080 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,080 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,082 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,082 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,082 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,082 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,084 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,084 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,084 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,084 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,085 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,086 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,086 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,086 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,087 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,087 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,087 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,088 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,089 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,089 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,089 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,089 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,090 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,090 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,091 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,091 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,092 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,092 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,092 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,092 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,093 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,094 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,094 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,094 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,095 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,095 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,095 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,096 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,098 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,098 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,098 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,098 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,099 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,101 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,102 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,102 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,103 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,103 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,103 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,103 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,108 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,108 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,108 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,108 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,109 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,111 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,111 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,111 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,112 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,112 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,112 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,112 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,113 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,113 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,113 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,114 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,119 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 12:55:30 BoogieIcfgContainer [2018-10-01 00:55:30,119 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 00:55:30,120 INFO L168 Benchmark]: Toolchain (without parser) took 24529.83 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 440.9 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 150.7 MB). Peak memory consumption was 822.3 MB. Max. memory is 7.1 GB. [2018-10-01 00:55:30,125 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 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-10-01 00:55:30,125 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.12 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-10-01 00:55:30,126 INFO L168 Benchmark]: Boogie Preprocessor took 52.06 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-10-01 00:55:30,130 INFO L168 Benchmark]: RCFGBuilder took 810.18 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-10-01 00:55:30,130 INFO L168 Benchmark]: TraceAbstraction took 23611.60 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 440.9 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 97.9 MB). Peak memory consumption was 769.4 MB. Max. memory is 7.1 GB. [2018-10-01 00:55:30,138 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.22 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 49.12 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 52.06 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 810.18 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23611.60 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 440.9 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 97.9 MB). Peak memory consumption was 769.4 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_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 543]: 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: 424]: Loop Invariant [2018-10-01 00:55:30,174 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,174 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,174 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,174 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,175 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,175 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,175 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,175 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= ~mode2 && ~mode2 <= 1) && ~r1 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3 - InvariantResult [Line: 382]: Loop Invariant [2018-10-01 00:55:30,176 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,176 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,177 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,177 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,182 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,183 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,183 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,183 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (~mode2 == 256 * (~mode2 / 256) && (((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && 0 <= ~r1) || ((((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3) - InvariantResult [Line: 444]: Loop Invariant [2018-10-01 00:55:30,184 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,184 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,184 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,184 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,185 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,185 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,185 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,185 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= ~mode2 && ~mode2 <= 1) && ~r1 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3 - InvariantResult [Line: 535]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 464]: Loop Invariant [2018-10-01 00:55:30,186 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,186 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,187 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,188 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,188 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,188 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,188 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,189 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= ~mode2 && ~mode2 <= 1) && ~r1 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3 - InvariantResult [Line: 484]: Loop Invariant [2018-10-01 00:55:30,189 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,191 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,192 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,192 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,192 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,193 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,193 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,193 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= ~mode2 && ~mode2 <= 1) && ~r1 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3 - InvariantResult [Line: 415]: Loop Invariant [2018-10-01 00:55:30,197 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,197 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,197 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,197 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,198 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,198 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,198 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,198 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,201 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,201 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,201 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,201 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,202 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,202 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,202 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,202 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((~mode3 == 256 * (~mode3 / 256) && ~r1 <= 1) && 1 <= ~mode2) && ~mode2 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) || ((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3) - InvariantResult [Line: 372]: Loop Invariant [2018-10-01 00:55:30,205 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,205 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,205 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,205 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,206 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,206 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,206 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,206 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && ~nomsg + 1 == 0) && 0 <= ~r1) || ((((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3) - InvariantResult [Line: 435]: Loop Invariant [2018-10-01 00:55:30,207 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,207 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,210 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,211 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,211 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,211 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,211 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,212 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= ~mode2 && ~mode2 <= 1) && ~r1 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3 - InvariantResult [Line: 392]: Loop Invariant [2018-10-01 00:55:30,215 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,216 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,216 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,216 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,217 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,217 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,217 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,217 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (~mode2 == 256 * (~mode2 / 256) && (((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && 0 <= ~r1) || ((((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3) - InvariantResult [Line: 365]: Loop Invariant [2018-10-01 00:55:30,218 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,218 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,220 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,220 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,221 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,221 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,221 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,222 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && ~nomsg + 1 == 0) && 0 <= ~r1) || ((((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3) - InvariantResult [Line: 455]: Loop Invariant [2018-10-01 00:55:30,222 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,222 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,222 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,223 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,223 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,223 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,224 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,224 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= ~mode2 && ~mode2 <= 1) && ~r1 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3 - InvariantResult [Line: 514]: Loop Invariant [2018-10-01 00:55:30,225 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,225 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,225 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,225 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,226 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,226 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,226 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,226 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= check_~tmp~156 && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old) - InvariantResult [Line: 508]: Loop Invariant [2018-10-01 00:55:30,226 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,227 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,227 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,227 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,227 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,227 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,228 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,228 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= ~mode2 && ~mode2 <= 1) && ~r1 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old) - InvariantResult [Line: 529]: Loop Invariant [2018-10-01 00:55:30,228 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,228 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,229 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,229 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,229 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,229 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,229 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,230 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((assert_~arg == 1 && 1 <= check_~tmp~156) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old) - InvariantResult [Line: 475]: Loop Invariant [2018-10-01 00:55:30,230 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,230 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,230 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,231 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,231 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,231 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,232 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,232 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= ~mode2 && ~mode2 <= 1) && ~r1 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3 - InvariantResult [Line: 401]: Loop Invariant [2018-10-01 00:55:30,232 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,233 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,233 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,233 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,233 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,233 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,233 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,234 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,234 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,234 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,235 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,235 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,235 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,235 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,235 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-01 00:55:30,235 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((~mode3 == 256 * (~mode3 / 256) && ~r1 <= 1) && 1 <= ~mode2) && ~mode2 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) || ((((((exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. SAFE Result, 23.4s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 8.5s AutomataDifference, 0.0s DeadEndRemovalTime, 9.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 370 SDtfs, 335 SDslu, 296 SDs, 0 SdLazy, 187 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s 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.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 1592 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 581 NumberOfFragments, 975 HoareAnnotationTreeSize, 17 FomulaSimplifications, 93991 FormulaSimplificationTreeSizeReduction, 2.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 28337 FormulaSimplificationTreeSizeReductionInter, 7.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 380 ConstructedInterpolants, 18 QuantifiedInterpolants, 72908 SizeOfPredicates, 4 NumberOfNonLiveVariables, 350 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 254/272 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.2.ufo.BOUNDED-12.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_00-55-30-245.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-01_00-55-30-245.csv Received shutdown request...