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-9f4048f-m [2018-10-04 14:31:23,251 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 14:31:23,253 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 14:31:23,265 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 14:31:23,265 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 14:31:23,266 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 14:31:23,268 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 14:31:23,269 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 14:31:23,271 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 14:31:23,272 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 14:31:23,273 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 14:31:23,273 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 14:31:23,274 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 14:31:23,275 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 14:31:23,276 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 14:31:23,277 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 14:31:23,278 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 14:31:23,280 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 14:31:23,282 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 14:31:23,283 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 14:31:23,290 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 14:31:23,291 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 14:31:23,294 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 14:31:23,296 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 14:31:23,296 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 14:31:23,297 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 14:31:23,298 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 14:31:23,302 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 14:31:23,303 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 14:31:23,304 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 14:31:23,307 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 14:31:23,308 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 14:31:23,308 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 14:31:23,308 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 14:31:23,312 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 14:31:23,312 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 14:31:23,313 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 14:31:23,343 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 14:31:23,343 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 14:31:23,345 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 14:31:23,345 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 14:31:23,346 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 14:31:23,346 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 14:31:23,346 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 14:31:23,346 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 14:31:23,347 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 14:31:23,350 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 14:31:23,350 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 14:31:23,350 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 14:31:23,351 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 14:31:23,351 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 14:31:23,351 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 14:31:23,351 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 14:31:23,352 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 14:31:23,352 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 14:31:23,352 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 14:31:23,352 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 14:31:23,352 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 14:31:23,353 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 14:31:23,353 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:31:23,353 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 14:31:23,353 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 14:31:23,353 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 14:31:23,354 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 14:31:23,355 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 14:31:23,356 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 14:31:23,356 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 14:31:23,356 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 14:31:23,428 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 14:31:23,441 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 14:31:23,446 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 14:31:23,448 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 14:31:23,449 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 14:31:23,450 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-04 14:31:23,450 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-04 14:31:23,551 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 14:31:23,553 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 14:31:23,554 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 14:31:23,554 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 14:31:23,554 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 14:31:23,575 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 04.10 02:31:23" (1/1) ... [2018-10-04 14:31:23,596 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 04.10 02:31:23" (1/1) ... [2018-10-04 14:31:23,614 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 14:31:23,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 14:31:23,616 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 14:31:23,616 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 14:31:23,628 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 04.10 02:31:23" (1/1) ... [2018-10-04 14:31:23,628 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 04.10 02:31:23" (1/1) ... [2018-10-04 14:31:23,635 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 04.10 02:31:23" (1/1) ... [2018-10-04 14:31:23,635 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 04.10 02:31:23" (1/1) ... [2018-10-04 14:31:23,664 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 04.10 02:31:23" (1/1) ... [2018-10-04 14:31:23,670 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 04.10 02:31:23" (1/1) ... [2018-10-04 14:31:23,678 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 04.10 02:31:23" (1/1) ... [2018-10-04 14:31:23,686 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 14:31:23,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 14:31:23,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 14:31:23,688 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 14:31:23,689 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 04.10 02:31:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:31:23,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 14:31:23,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 14:31:24,545 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 14:31:24,546 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 04.10 02:31:24 BoogieIcfgContainer [2018-10-04 14:31:24,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 14:31:24,547 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 14:31:24,547 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 14:31:24,551 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 14:31:24,551 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 04.10 02:31:23" (1/2) ... [2018-10-04 14:31:24,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ecbcf2 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 04.10 02:31:24, skipping insertion in model container [2018-10-04 14:31:24,552 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 04.10 02:31:24" (2/2) ... [2018-10-04 14:31:24,554 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl [2018-10-04 14:31:24,564 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 14:31:24,574 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 14:31:24,621 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 14:31:24,622 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 14:31:24,622 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 14:31:24,623 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 14:31:24,623 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 14:31:24,623 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 14:31:24,623 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 14:31:24,623 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 14:31:24,624 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 14:31:24,639 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-10-04 14:31:24,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:31:24,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:24,648 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:31:24,649 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:24,656 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:24,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-10-04 14:31:24,658 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:24,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:24,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:24,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:24,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:24,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:25,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:31:25,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:25,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:31:25,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:31:25,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:31:25,040 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:25,042 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-10-04 14:31:25,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:25,102 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-10-04 14:31:25,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:31:25,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-04 14:31:25,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:25,116 INFO L225 Difference]: With dead ends: 57 [2018-10-04 14:31:25,116 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 14:31:25,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:31:25,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 14:31:25,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-10-04 14:31:25,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 14:31:25,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-10-04 14:31:25,167 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-10-04 14:31:25,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:25,168 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-10-04 14:31:25,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:31:25,168 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-10-04 14:31:25,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:31:25,169 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:25,169 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:31:25,169 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:25,170 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:25,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-10-04 14:31:25,170 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:25,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:25,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:25,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:25,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:25,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:31:25,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:25,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:31:25,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:31:25,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:31:25,336 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:25,336 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-10-04 14:31:25,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:25,362 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-10-04 14:31:25,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:31:25,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-04 14:31:25,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:25,365 INFO L225 Difference]: With dead ends: 103 [2018-10-04 14:31:25,365 INFO L226 Difference]: Without dead ends: 69 [2018-10-04 14:31:25,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:31:25,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-04 14:31:25,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-10-04 14:31:25,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-04 14:31:25,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-10-04 14:31:25,386 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-10-04 14:31:25,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:25,386 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-10-04 14:31:25,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:31:25,387 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-10-04 14:31:25,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:31:25,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:25,388 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:31:25,389 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:25,389 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:25,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-10-04 14:31:25,390 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:25,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:25,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:25,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:25,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:25,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:31:25,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:25,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:31:25,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:31:25,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:31:25,536 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:25,537 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 3 states. [2018-10-04 14:31:25,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:25,602 INFO L93 Difference]: Finished difference Result 199 states and 280 transitions. [2018-10-04 14:31:25,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:31:25,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-04 14:31:25,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:25,617 INFO L225 Difference]: With dead ends: 199 [2018-10-04 14:31:25,617 INFO L226 Difference]: Without dead ends: 133 [2018-10-04 14:31:25,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:31:25,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-04 14:31:25,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-10-04 14:31:25,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-04 14:31:25,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 182 transitions. [2018-10-04 14:31:25,665 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 182 transitions. Word has length 18 [2018-10-04 14:31:25,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:25,665 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 182 transitions. [2018-10-04 14:31:25,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:31:25,666 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 182 transitions. [2018-10-04 14:31:25,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:31:25,666 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:25,667 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:31:25,667 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:25,667 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:25,667 INFO L82 PathProgramCache]: Analyzing trace with hash 823143127, now seen corresponding path program 1 times [2018-10-04 14:31:25,668 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:25,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:25,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:25,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:25,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:25,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:25,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:31:25,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:25,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 14:31:25,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 14:31:25,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 14:31:25,807 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:25,807 INFO L87 Difference]: Start difference. First operand 131 states and 182 transitions. Second operand 4 states. [2018-10-04 14:31:25,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:25,957 INFO L93 Difference]: Finished difference Result 277 states and 379 transitions. [2018-10-04 14:31:25,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 14:31:25,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-04 14:31:25,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:25,964 INFO L225 Difference]: With dead ends: 277 [2018-10-04 14:31:25,964 INFO L226 Difference]: Without dead ends: 275 [2018-10-04 14:31:25,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 3 [2018-10-04 14:31:25,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-04 14:31:26,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 147. [2018-10-04 14:31:26,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-04 14:31:26,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 198 transitions. [2018-10-04 14:31:26,029 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 198 transitions. Word has length 18 [2018-10-04 14:31:26,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:26,031 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 198 transitions. [2018-10-04 14:31:26,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 14:31:26,032 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 198 transitions. [2018-10-04 14:31:26,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:31:26,032 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:26,033 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:31:26,033 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:26,033 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:26,033 INFO L82 PathProgramCache]: Analyzing trace with hash 823202709, now seen corresponding path program 1 times [2018-10-04 14:31:26,034 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:26,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:26,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:26,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:26,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:26,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:31:26,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:26,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:31:26,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:31:26,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:31:26,182 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:26,182 INFO L87 Difference]: Start difference. First operand 147 states and 198 transitions. Second operand 3 states. [2018-10-04 14:31:26,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:26,303 INFO L93 Difference]: Finished difference Result 359 states and 485 transitions. [2018-10-04 14:31:26,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:31:26,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-04 14:31:26,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:26,310 INFO L225 Difference]: With dead ends: 359 [2018-10-04 14:31:26,310 INFO L226 Difference]: Without dead ends: 213 [2018-10-04 14:31:26,312 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:31:26,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-10-04 14:31:26,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-10-04 14:31:26,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-04 14:31:26,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-10-04 14:31:26,368 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 18 [2018-10-04 14:31:26,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:26,369 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-10-04 14:31:26,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:31:26,372 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-10-04 14:31:26,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 14:31:26,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:26,375 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:31:26,376 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:26,376 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:26,376 INFO L82 PathProgramCache]: Analyzing trace with hash 748385901, now seen corresponding path program 1 times [2018-10-04 14:31:26,376 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:26,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:26,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:26,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:26,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:26,523 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:31:26,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:26,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:31:26,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:31:26,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:31:26,528 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:26,528 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-10-04 14:31:26,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:26,718 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-10-04 14:31:26,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:31:26,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 14:31:26,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:26,722 INFO L225 Difference]: With dead ends: 633 [2018-10-04 14:31:26,722 INFO L226 Difference]: Without dead ends: 423 [2018-10-04 14:31:26,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:31:26,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-04 14:31:26,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-10-04 14:31:26,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-10-04 14:31:26,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-10-04 14:31:26,799 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-10-04 14:31:26,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:26,799 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-10-04 14:31:26,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:31:26,800 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-10-04 14:31:26,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 14:31:26,805 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:26,805 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:31:26,805 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:26,806 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:26,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1759503151, now seen corresponding path program 1 times [2018-10-04 14:31:26,806 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:26,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:26,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:26,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:26,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:26,936 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:31:26,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:26,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:31:26,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:31:26,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:31:26,937 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:26,938 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-10-04 14:31:27,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:27,142 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-10-04 14:31:27,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:31:27,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 14:31:27,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:27,148 INFO L225 Difference]: With dead ends: 1257 [2018-10-04 14:31:27,148 INFO L226 Difference]: Without dead ends: 839 [2018-10-04 14:31:27,149 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:31:27,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-10-04 14:31:27,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-10-04 14:31:27,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-10-04 14:31:27,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-10-04 14:31:27,279 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-10-04 14:31:27,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:27,279 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-10-04 14:31:27,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:31:27,280 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-10-04 14:31:27,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 14:31:27,283 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:27,283 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:31:27,284 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:27,284 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:27,284 INFO L82 PathProgramCache]: Analyzing trace with hash -2142437135, now seen corresponding path program 1 times [2018-10-04 14:31:27,284 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:27,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:27,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:27,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:27,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:27,403 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:31:27,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:27,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:31:27,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:31:27,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:31:27,404 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:27,404 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-10-04 14:31:27,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:27,743 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-10-04 14:31:27,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:31:27,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 14:31:27,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:27,753 INFO L225 Difference]: With dead ends: 2505 [2018-10-04 14:31:27,754 INFO L226 Difference]: Without dead ends: 1671 [2018-10-04 14:31:27,755 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:31:27,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-10-04 14:31:28,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-10-04 14:31:28,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-10-04 14:31:28,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-10-04 14:31:28,034 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-10-04 14:31:28,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:28,035 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-10-04 14:31:28,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:31:28,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-10-04 14:31:28,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 14:31:28,038 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:28,038 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:31:28,038 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:28,038 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:28,040 INFO L82 PathProgramCache]: Analyzing trace with hash 2095271859, now seen corresponding path program 1 times [2018-10-04 14:31:28,040 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:28,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:28,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:28,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:28,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:28,278 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 14:31:28,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:31:28,279 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:31:28,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:28,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:31:29,696 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:31:29,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:31:29,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2018-10-04 14:31:29,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:31:29,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:31:29,733 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:29,733 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-10-04 14:31:33,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:33,233 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-10-04 14:31:33,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:31:33,234 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-10-04 14:31:33,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:33,249 INFO L225 Difference]: With dead ends: 4801 [2018-10-04 14:31:33,249 INFO L226 Difference]: Without dead ends: 3135 [2018-10-04 14:31:33,252 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time 1.0s impTime 12 [2018-10-04 14:31:33,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-10-04 14:31:33,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-10-04 14:31:33,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-10-04 14:31:33,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-10-04 14:31:33,773 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-10-04 14:31:33,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:33,774 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-10-04 14:31:33,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:31:33,774 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-10-04 14:31:33,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-04 14:31:33,779 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:33,779 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 14:31:33,779 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:33,780 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:33,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1417215583, now seen corresponding path program 2 times [2018-10-04 14:31:33,780 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:33,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:33,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:33,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:33,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:33,932 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-04 14:31:33,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:33,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:31:33,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:31:33,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:31:33,934 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:33,934 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-10-04 14:31:34,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:34,568 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-10-04 14:31:34,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:31:34,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-04 14:31:34,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:34,579 INFO L225 Difference]: With dead ends: 4873 [2018-10-04 14:31:34,580 INFO L226 Difference]: Without dead ends: 2215 [2018-10-04 14:31:34,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:31:34,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-10-04 14:31:34,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-10-04 14:31:34,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-10-04 14:31:34,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-10-04 14:31:34,944 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-10-04 14:31:34,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:34,944 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-10-04 14:31:34,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:31:34,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-10-04 14:31:34,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-04 14:31:34,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:34,948 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-10-04 14:31:34,948 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:34,948 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:34,948 INFO L82 PathProgramCache]: Analyzing trace with hash 79784675, now seen corresponding path program 3 times [2018-10-04 14:31:34,948 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:34,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:34,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:34,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:31:34,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:34,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:35,051 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-04 14:31:35,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:35,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:31:35,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:31:35,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:31:35,052 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:35,053 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-10-04 14:31:35,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:35,091 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-10-04 14:31:35,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:31:35,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-04 14:31:35,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:35,091 INFO L225 Difference]: With dead ends: 1799 [2018-10-04 14:31:35,092 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 14:31:35,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:31:35,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 14:31:35,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 14:31:35,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 14:31:35,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 14:31:35,095 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-10-04 14:31:35,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:35,095 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 14:31:35,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:31:35,095 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 14:31:35,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 14:31:35,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 14:31:35,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,297 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 127 [2018-10-04 14:31:35,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,409 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 54 [2018-10-04 14:31:35,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,549 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 127 [2018-10-04 14:31:35,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,700 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 127 [2018-10-04 14:31:35,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,827 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 127 [2018-10-04 14:31:35,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:35,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,014 WARN L178 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 316 DAG size of output: 94 [2018-10-04 14:31:36,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,245 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 127 [2018-10-04 14:31:36,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,383 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 54 [2018-10-04 14:31:36,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,588 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 127 [2018-10-04 14:31:36,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,783 WARN L178 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 110 [2018-10-04 14:31:36,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:36,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:37,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:37,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:37,054 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 127 [2018-10-04 14:31:37,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:37,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:37,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:37,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:37,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:37,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:37,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:37,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:37,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:37,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:37,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:37,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:37,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:37,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:37,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:37,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:37,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:37,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:37,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:37,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:37,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:37,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:37,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:37,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:37,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:37,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:37,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:37,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:37,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:31:37,211 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 316 DAG size of output: 94 [2018-10-04 14:31:38,702 WARN L178 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 122 DAG size of output: 29 [2018-10-04 14:31:39,854 WARN L178 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2018-10-04 14:31:40,849 WARN L178 SmtUtils]: Spent 992.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 29 [2018-10-04 14:31:41,156 WARN L178 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 29 [2018-10-04 14:31:41,447 WARN L178 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 29 [2018-10-04 14:31:41,717 WARN L178 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 38 [2018-10-04 14:31:41,832 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2018-10-04 14:31:42,054 WARN L178 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 29 [2018-10-04 14:31:42,192 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2018-10-04 14:31:42,319 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2018-10-04 14:31:42,526 WARN L178 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 29 [2018-10-04 14:31:42,695 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 29 [2018-10-04 14:31:43,149 WARN L178 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 29 [2018-10-04 14:31:43,727 WARN L178 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2018-10-04 14:31:45,082 WARN L178 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 122 DAG size of output: 29 [2018-10-04 14:31:45,363 WARN L178 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 38 [2018-10-04 14:31:45,367 INFO L421 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-04 14:31:45,367 INFO L421 ceAbstractionStarter]: At program point L535(lines 535 542) the Hoare annotation is: false [2018-10-04 14:31:45,367 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 543) no Hoare annotation was computed. [2018-10-04 14:31:45,367 INFO L421 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-04 14:31:45,367 INFO L421 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-04 14:31:45,368 INFO L421 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-04 14:31:45,368 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 544) no Hoare annotation was computed. [2018-10-04 14:31:45,368 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 544) no Hoare annotation was computed. [2018-10-04 14:31:45,368 INFO L421 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-04 14:31:45,368 INFO L421 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-04 14:31:45,369 INFO L421 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-04 14:31:45,369 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 544) no Hoare annotation was computed. [2018-10-04 14:31:45,369 INFO L421 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-04 14:31:45,369 INFO L421 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-04 14:31:45,369 INFO L421 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-04 14:31:45,370 INFO L421 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-04 14:31:45,370 INFO L421 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-04 14:31:45,370 INFO L421 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-04 14:31:45,370 INFO L421 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-04 14:31:45,371 INFO L421 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-04 14:31:45,371 INFO L421 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-04 14:31:45,378 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,379 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,379 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,379 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,385 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,386 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,386 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,386 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,388 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,389 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,389 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,389 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,391 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,392 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,392 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,392 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,394 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,394 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,394 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,394 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,396 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,396 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,396 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,396 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,398 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,398 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,398 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,398 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,400 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,400 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,400 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,400 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,402 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,402 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,402 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,403 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,404 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,404 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,404 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,404 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,406 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,406 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,407 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,407 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,407 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,407 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,407 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,408 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,409 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,409 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,410 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,410 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,410 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,410 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,411 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,411 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,412 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,413 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,413 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,413 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,414 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,415 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,415 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,415 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,416 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,416 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,417 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,417 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,418 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,418 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,418 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,418 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,420 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,420 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,420 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,420 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,422 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,422 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,422 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,422 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,424 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,424 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,424 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,425 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,426 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,427 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,427 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,427 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,428 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,428 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,429 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,429 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,430 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,430 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,430 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,431 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,431 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,432 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,432 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,432 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,433 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,433 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,433 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,434 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,434 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,435 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,435 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,435 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,436 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,436 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,436 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,436 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,437 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,438 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,438 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,438 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,439 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,439 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,439 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,440 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,440 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,441 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,441 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,441 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,442 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,442 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,443 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,443 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,444 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,444 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,444 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,444 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,445 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,445 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,445 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,445 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,446 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,446 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,447 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,447 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,447 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,447 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,447 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,448 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,450 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 04.10 02:31:45 BoogieIcfgContainer [2018-10-04 14:31:45,450 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 14:31:45,451 INFO L168 Benchmark]: Toolchain (without parser) took 21898.70 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 440.9 MB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 136.1 MB). Peak memory consumption was 750.4 MB. Max. memory is 7.1 GB. [2018-10-04 14:31:45,452 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:31:45,453 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.02 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:31:45,453 INFO L168 Benchmark]: Boogie Preprocessor took 70.64 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:31:45,454 INFO L168 Benchmark]: RCFGBuilder took 859.95 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-10-04 14:31:45,455 INFO L168 Benchmark]: TraceAbstraction took 20902.57 ms. Allocated memory was 1.5 GB in the beginning and 2.0 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: 83.2 MB). Peak memory consumption was 697.6 MB. Max. memory is 7.1 GB. [2018-10-04 14:31:45,459 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.02 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 70.64 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 859.95 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20902.57 ms. Allocated memory was 1.5 GB in the beginning and 2.0 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: 83.2 MB). Peak memory consumption was 697.6 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-04 14:31:45,475 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,475 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,475 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,475 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,476 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,476 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,476 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,477 WARN L390 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-04 14:31:45,477 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,478 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,478 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,478 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,479 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,479 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,479 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,479 WARN L390 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-04 14:31:45,480 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,480 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,480 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,480 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,481 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,481 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,481 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,482 WARN L390 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-04 14:31:45,482 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,483 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,483 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,483 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,484 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,484 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,484 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,484 WARN L390 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-04 14:31:45,485 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,485 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,485 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,485 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,486 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,486 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,486 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,487 WARN L390 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-04 14:31:45,487 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,487 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,488 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,488 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,488 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,488 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,488 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,489 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,489 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,490 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,490 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,490 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,490 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,490 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,490 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,491 WARN L390 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-04 14:31:45,491 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,492 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,492 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,492 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,493 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,493 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,493 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,493 WARN L390 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-04 14:31:45,495 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,495 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,495 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,495 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,496 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,496 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,496 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,496 WARN L390 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-04 14:31:45,497 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,497 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,498 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,498 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,499 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,499 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,499 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,499 WARN L390 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-04 14:31:45,500 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,500 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,501 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,501 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,501 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,502 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,502 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,502 WARN L390 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-04 14:31:45,503 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,503 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,503 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,503 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,504 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,504 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,504 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,504 WARN L390 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-04 14:31:45,505 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,505 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,505 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,505 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,506 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,506 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,506 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,506 WARN L390 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-04 14:31:45,507 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,507 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,507 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,507 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,508 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,508 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,508 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,508 WARN L390 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-04 14:31:45,509 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,509 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,509 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,509 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,510 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,510 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,510 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,510 WARN L390 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-04 14:31:45,510 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,511 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,511 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,511 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,511 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,512 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,512 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,512 WARN L390 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-04 14:31:45,513 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,513 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,513 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,513 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,513 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,514 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,514 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,514 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,515 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,515 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,515 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,515 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,515 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,515 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,516 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 14:31:45,516 WARN L390 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, 20.7s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 5.4s AutomataDifference, 0.0s DeadEndRemovalTime, 10.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 370 SDtfs, 335 SDslu, 296 SDs, 0 SdLazy, 187 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2101occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 1592 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 581 NumberOfFragments, 975 HoareAnnotationTreeSize, 17 FomulaSimplifications, 93991 FormulaSimplificationTreeSizeReduction, 2.1s HoareSimplificationTime, 17 FomulaSimplificationsInter, 28337 FormulaSimplificationTreeSizeReductionInter, 8.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s 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-04_14-31-45-522.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-04_14-31-45-522.csv Received shutdown request...