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-c372c2b [2018-10-02 12:15:26,651 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 12:15:26,653 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 12:15:26,665 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 12:15:26,665 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 12:15:26,666 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 12:15:26,667 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 12:15:26,669 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 12:15:26,671 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 12:15:26,672 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 12:15:26,672 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 12:15:26,673 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 12:15:26,674 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 12:15:26,674 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 12:15:26,675 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 12:15:26,676 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 12:15:26,677 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 12:15:26,679 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 12:15:26,681 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 12:15:26,682 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 12:15:26,684 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 12:15:26,685 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 12:15:26,687 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 12:15:26,688 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 12:15:26,688 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 12:15:26,689 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 12:15:26,690 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 12:15:26,691 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 12:15:26,691 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 12:15:26,693 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 12:15:26,693 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 12:15:26,694 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 12:15:26,694 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 12:15:26,694 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 12:15:26,695 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 12:15:26,696 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 12:15:26,696 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-02 12:15:26,711 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 12:15:26,711 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 12:15:26,712 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 12:15:26,712 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 12:15:26,713 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 12:15:26,713 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 12:15:26,713 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 12:15:26,713 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 12:15:26,713 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 12:15:26,714 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 12:15:26,714 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 12:15:26,714 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 12:15:26,714 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 12:15:26,714 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 12:15:26,714 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 12:15:26,715 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 12:15:26,715 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 12:15:26,715 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 12:15:26,715 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 12:15:26,715 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 12:15:26,715 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 12:15:26,716 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 12:15:26,716 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 12:15:26,716 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 12:15:26,716 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 12:15:26,716 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 12:15:26,717 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 12:15:26,717 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 12:15:26,717 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 12:15:26,717 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 12:15:26,717 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-02 12:15:26,777 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 12:15:26,792 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 12:15:26,799 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 12:15:26,800 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 12:15:26,801 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 12:15:26,802 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-02 12:15:26,802 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-02 12:15:26,904 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 12:15:26,907 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 12:15:26,908 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 12:15:26,908 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 12:15:26,908 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 12:15:26,929 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 02.10 12:15:26" (1/1) ... [2018-10-02 12:15:26,950 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 02.10 12:15:26" (1/1) ... [2018-10-02 12:15:26,966 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 12:15:26,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 12:15:26,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 12:15:26,967 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 12:15:26,979 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 02.10 12:15:26" (1/1) ... [2018-10-02 12:15:26,979 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 02.10 12:15:26" (1/1) ... [2018-10-02 12:15:26,986 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 02.10 12:15:26" (1/1) ... [2018-10-02 12:15:26,992 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 02.10 12:15:26" (1/1) ... [2018-10-02 12:15:27,012 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 02.10 12:15:26" (1/1) ... [2018-10-02 12:15:27,015 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 02.10 12:15:26" (1/1) ... [2018-10-02 12:15:27,019 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 02.10 12:15:26" (1/1) ... [2018-10-02 12:15:27,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 12:15:27,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 12:15:27,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 12:15:27,029 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 12:15:27,030 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 02.10 12:15:26" (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-02 12:15:27,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 12:15:27,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 12:15:27,768 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 12:15:27,768 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 02.10 12:15:27 BoogieIcfgContainer [2018-10-02 12:15:27,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 12:15:27,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 12:15:27,770 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 12:15:27,773 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 12:15:27,774 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 02.10 12:15:26" (1/2) ... [2018-10-02 12:15:27,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d1f89f1 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 02.10 12:15:27, skipping insertion in model container [2018-10-02 12:15:27,775 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 02.10 12:15:27" (2/2) ... [2018-10-02 12:15:27,777 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl [2018-10-02 12:15:27,786 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 12:15:27,795 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 12:15:27,850 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 12:15:27,850 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 12:15:27,851 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 12:15:27,851 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 12:15:27,851 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 12:15:27,851 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 12:15:27,854 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 12:15:27,854 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 12:15:27,854 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 12:15:27,872 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-10-02 12:15:27,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:15:27,881 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:27,882 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-02 12:15:27,884 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:27,890 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:27,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-10-02 12:15:27,894 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:27,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:27,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:27,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:27,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:28,174 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-02 12:15:28,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:28,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:15:28,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:28,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:28,195 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:28,198 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-10-02 12:15:28,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:28,325 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-10-02 12:15:28,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:28,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-02 12:15:28,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:28,340 INFO L225 Difference]: With dead ends: 57 [2018-10-02 12:15:28,340 INFO L226 Difference]: Without dead ends: 37 [2018-10-02 12:15:28,343 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 [2018-10-02 12:15:28,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-02 12:15:28,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-10-02 12:15:28,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-02 12:15:28,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-10-02 12:15:28,389 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-10-02 12:15:28,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:28,390 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-10-02 12:15:28,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:28,390 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-10-02 12:15:28,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:15:28,391 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:28,391 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-02 12:15:28,391 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:28,392 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:28,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-10-02 12:15:28,392 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:28,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:28,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:28,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:28,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:28,581 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-02 12:15:28,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:28,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:15:28,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:28,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:28,584 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:28,585 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-10-02 12:15:28,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:28,697 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-10-02 12:15:28,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:28,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-02 12:15:28,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:28,700 INFO L225 Difference]: With dead ends: 103 [2018-10-02 12:15:28,700 INFO L226 Difference]: Without dead ends: 69 [2018-10-02 12:15:28,701 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 [2018-10-02 12:15:28,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-02 12:15:28,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-10-02 12:15:28,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-02 12:15:28,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-10-02 12:15:28,722 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-10-02 12:15:28,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:28,722 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-10-02 12:15:28,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:28,723 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-10-02 12:15:28,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:15:28,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:28,723 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-02 12:15:28,724 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:28,724 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:28,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-10-02 12:15:28,724 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:28,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:28,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:28,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:28,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:28,881 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-02 12:15:28,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:28,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:15:28,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:28,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:28,883 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:28,883 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 3 states. [2018-10-02 12:15:29,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:29,000 INFO L93 Difference]: Finished difference Result 199 states and 280 transitions. [2018-10-02 12:15:29,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:29,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-02 12:15:29,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:29,012 INFO L225 Difference]: With dead ends: 199 [2018-10-02 12:15:29,012 INFO L226 Difference]: Without dead ends: 133 [2018-10-02 12:15:29,013 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 [2018-10-02 12:15:29,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-02 12:15:29,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-10-02 12:15:29,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-02 12:15:29,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 182 transitions. [2018-10-02 12:15:29,074 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 182 transitions. Word has length 18 [2018-10-02 12:15:29,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:29,077 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 182 transitions. [2018-10-02 12:15:29,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:29,078 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 182 transitions. [2018-10-02 12:15:29,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:15:29,079 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:29,080 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-02 12:15:29,080 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:29,080 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:29,081 INFO L82 PathProgramCache]: Analyzing trace with hash 823143127, now seen corresponding path program 1 times [2018-10-02 12:15:29,081 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:29,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:29,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:29,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:29,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:29,204 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-02 12:15:29,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:29,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 12:15:29,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 12:15:29,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 12:15:29,205 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:29,206 INFO L87 Difference]: Start difference. First operand 131 states and 182 transitions. Second operand 4 states. [2018-10-02 12:15:29,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:29,727 INFO L93 Difference]: Finished difference Result 277 states and 379 transitions. [2018-10-02 12:15:29,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 12:15:29,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-02 12:15:29,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:29,731 INFO L225 Difference]: With dead ends: 277 [2018-10-02 12:15:29,731 INFO L226 Difference]: Without dead ends: 275 [2018-10-02 12:15:29,732 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 [2018-10-02 12:15:29,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-02 12:15:29,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 147. [2018-10-02 12:15:29,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-02 12:15:29,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 198 transitions. [2018-10-02 12:15:29,774 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 198 transitions. Word has length 18 [2018-10-02 12:15:29,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:29,774 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 198 transitions. [2018-10-02 12:15:29,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 12:15:29,775 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 198 transitions. [2018-10-02 12:15:29,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:15:29,775 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:29,776 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-02 12:15:29,776 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:29,776 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:29,776 INFO L82 PathProgramCache]: Analyzing trace with hash 823202709, now seen corresponding path program 1 times [2018-10-02 12:15:29,776 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:29,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:29,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:29,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:29,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:29,890 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-02 12:15:29,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:29,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:15:29,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:29,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:29,892 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:29,892 INFO L87 Difference]: Start difference. First operand 147 states and 198 transitions. Second operand 3 states. [2018-10-02 12:15:30,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:30,123 INFO L93 Difference]: Finished difference Result 359 states and 485 transitions. [2018-10-02 12:15:30,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:30,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-02 12:15:30,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:30,131 INFO L225 Difference]: With dead ends: 359 [2018-10-02 12:15:30,131 INFO L226 Difference]: Without dead ends: 213 [2018-10-02 12:15:30,132 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 [2018-10-02 12:15:30,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-10-02 12:15:30,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-10-02 12:15:30,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-02 12:15:30,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-10-02 12:15:30,178 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 18 [2018-10-02 12:15:30,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:30,179 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-10-02 12:15:30,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:30,179 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-10-02 12:15:30,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-02 12:15:30,181 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:30,181 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-02 12:15:30,181 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:30,181 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:30,182 INFO L82 PathProgramCache]: Analyzing trace with hash 748385901, now seen corresponding path program 1 times [2018-10-02 12:15:30,182 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:30,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:30,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:30,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:30,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:30,316 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-02 12:15:30,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:30,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:15:30,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:30,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:30,318 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:30,318 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-10-02 12:15:30,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:30,650 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-10-02 12:15:30,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:30,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-02 12:15:30,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:30,656 INFO L225 Difference]: With dead ends: 633 [2018-10-02 12:15:30,656 INFO L226 Difference]: Without dead ends: 423 [2018-10-02 12:15:30,657 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 [2018-10-02 12:15:30,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-02 12:15:30,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-10-02 12:15:30,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-10-02 12:15:30,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-10-02 12:15:30,742 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-10-02 12:15:30,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:30,743 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-10-02 12:15:30,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:30,743 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-10-02 12:15:30,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-02 12:15:30,746 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:30,747 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-02 12:15:30,748 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:30,748 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:30,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1759503151, now seen corresponding path program 1 times [2018-10-02 12:15:30,748 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:30,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:30,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:30,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:30,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:30,868 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-02 12:15:30,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:30,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:15:30,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:30,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:30,870 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:30,870 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-10-02 12:15:31,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:31,197 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-10-02 12:15:31,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:31,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-02 12:15:31,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:31,203 INFO L225 Difference]: With dead ends: 1257 [2018-10-02 12:15:31,203 INFO L226 Difference]: Without dead ends: 839 [2018-10-02 12:15:31,204 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 [2018-10-02 12:15:31,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-10-02 12:15:31,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-10-02 12:15:31,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-10-02 12:15:31,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-10-02 12:15:31,346 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-10-02 12:15:31,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:31,346 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-10-02 12:15:31,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:31,347 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-10-02 12:15:31,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-02 12:15:31,350 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:31,350 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-02 12:15:31,351 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:31,351 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:31,351 INFO L82 PathProgramCache]: Analyzing trace with hash -2142437135, now seen corresponding path program 1 times [2018-10-02 12:15:31,351 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:31,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:31,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:31,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:31,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:31,464 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-02 12:15:31,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:31,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:15:31,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:31,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:31,465 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:31,466 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-10-02 12:15:32,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:32,018 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-10-02 12:15:32,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:32,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-02 12:15:32,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:32,028 INFO L225 Difference]: With dead ends: 2505 [2018-10-02 12:15:32,028 INFO L226 Difference]: Without dead ends: 1671 [2018-10-02 12:15:32,030 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 [2018-10-02 12:15:32,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-10-02 12:15:32,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-10-02 12:15:32,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-10-02 12:15:32,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-10-02 12:15:32,321 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-10-02 12:15:32,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:32,321 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-10-02 12:15:32,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:32,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-10-02 12:15:32,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-02 12:15:32,324 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:32,325 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-02 12:15:32,325 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:32,325 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:32,325 INFO L82 PathProgramCache]: Analyzing trace with hash 2095271859, now seen corresponding path program 1 times [2018-10-02 12:15:32,325 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:32,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:32,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:32,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:32,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:32,555 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-02 12:15:32,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:15:32,556 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-02 12:15:32,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:32,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:15:33,851 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-02 12:15:33,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:15:33,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2018-10-02 12:15:33,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:15:33,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:15:33,892 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:33,892 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-10-02 12:15:38,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:38,822 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-10-02 12:15:38,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-02 12:15:38,827 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-10-02 12:15:38,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:38,841 INFO L225 Difference]: With dead ends: 4801 [2018-10-02 12:15:38,841 INFO L226 Difference]: Without dead ends: 3135 [2018-10-02 12:15:38,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 0.6s impTime [2018-10-02 12:15:38,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-10-02 12:15:39,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-10-02 12:15:39,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-10-02 12:15:39,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-10-02 12:15:39,450 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-10-02 12:15:39,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:39,451 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-10-02 12:15:39,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:15:39,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-10-02 12:15:39,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-02 12:15:39,455 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:39,455 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-02 12:15:39,455 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:39,455 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:39,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1417215583, now seen corresponding path program 2 times [2018-10-02 12:15:39,456 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:39,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:39,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:39,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:15:39,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:39,575 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-02 12:15:39,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:39,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:15:39,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:39,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:39,576 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:39,576 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-10-02 12:15:40,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:40,174 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-10-02 12:15:40,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:40,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-02 12:15:40,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:40,184 INFO L225 Difference]: With dead ends: 4873 [2018-10-02 12:15:40,184 INFO L226 Difference]: Without dead ends: 2215 [2018-10-02 12:15:40,188 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 [2018-10-02 12:15:40,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-10-02 12:15:40,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-10-02 12:15:40,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-10-02 12:15:40,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-10-02 12:15:40,546 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-10-02 12:15:40,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:40,547 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-10-02 12:15:40,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:40,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-10-02 12:15:40,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-02 12:15:40,549 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:15:40,550 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-02 12:15:40,550 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:15:40,550 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:15:40,550 INFO L82 PathProgramCache]: Analyzing trace with hash 79784675, now seen corresponding path program 3 times [2018-10-02 12:15:40,550 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:15:40,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:15:40,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:40,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:15:40,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:15:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:15:40,648 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-02 12:15:40,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:15:40,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:15:40,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:15:40,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:15:40,650 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:15:40,650 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-10-02 12:15:40,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:15:40,693 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-10-02 12:15:40,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:15:40,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-02 12:15:40,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:15:40,694 INFO L225 Difference]: With dead ends: 1799 [2018-10-02 12:15:40,694 INFO L226 Difference]: Without dead ends: 0 [2018-10-02 12:15:40,696 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 [2018-10-02 12:15:40,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-02 12:15:40,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-02 12:15:40,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-02 12:15:40,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-02 12:15:40,698 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-10-02 12:15:40,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:15:40,699 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-02 12:15:40,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:15:40,699 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-02 12:15:40,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-02 12:15:40,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-02 12:15:40,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:40,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:40,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:40,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:40,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:40,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:40,904 WARN L178 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 127 [2018-10-02 12:15:40,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:40,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:40,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:40,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:40,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:40,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:40,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:40,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:40,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:40,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:40,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:40,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,042 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 54 [2018-10-02 12:15:41,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,180 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 127 [2018-10-02 12:15:41,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,327 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 127 [2018-10-02 12:15:41,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,485 WARN L178 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 127 [2018-10-02 12:15:41,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,662 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 316 DAG size of output: 94 [2018-10-02 12:15:41,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,876 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 127 [2018-10-02 12:15:41,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:41,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,175 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 127 [2018-10-02 12:15:42,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,397 WARN L178 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 110 [2018-10-02 12:15:42,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,513 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 127 [2018-10-02 12:15:42,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,715 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 127 [2018-10-02 12:15:42,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:15:42,870 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 316 DAG size of output: 94 [2018-10-02 12:15:43,631 WARN L178 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 29 [2018-10-02 12:15:44,119 WARN L178 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2018-10-02 12:15:44,470 WARN L178 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 29 [2018-10-02 12:15:45,258 WARN L178 SmtUtils]: Spent 757.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 29 [2018-10-02 12:15:45,506 WARN L178 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 29 [2018-10-02 12:15:45,754 WARN L178 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 38 [2018-10-02 12:15:45,865 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2018-10-02 12:15:46,079 WARN L178 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 29 [2018-10-02 12:15:46,218 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2018-10-02 12:15:46,324 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2018-10-02 12:15:46,561 WARN L178 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 29 [2018-10-02 12:15:46,743 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 29 [2018-10-02 12:15:47,538 WARN L178 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 29 [2018-10-02 12:15:48,112 WARN L178 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2018-10-02 12:15:48,385 WARN L178 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 29 [2018-10-02 12:15:49,012 WARN L178 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 38 [2018-10-02 12:15:49,015 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-02 12:15:49,015 INFO L421 ceAbstractionStarter]: At program point L535(lines 535 542) the Hoare annotation is: false [2018-10-02 12:15:49,016 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-02 12:15:49,016 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-02 12:15:49,016 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-02 12:15:49,016 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 544) no Hoare annotation was computed. [2018-10-02 12:15:49,016 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 544) no Hoare annotation was computed. [2018-10-02 12:15:49,017 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-02 12:15:49,017 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-02 12:15:49,017 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-02 12:15:49,017 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 544) no Hoare annotation was computed. [2018-10-02 12:15:49,017 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-02 12:15:49,018 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-02 12:15:49,018 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-02 12:15:49,018 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 543) no Hoare annotation was computed. [2018-10-02 12:15:49,018 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-02 12:15:49,018 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-02 12:15:49,019 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-02 12:15:49,019 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-02 12:15:49,019 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-02 12:15:49,020 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-02 12:15:49,030 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,031 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,031 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,031 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,037 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,037 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,037 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,040 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,042 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,046 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,046 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,046 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,048 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,048 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,050 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,050 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,055 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,056 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,056 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,056 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,058 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,058 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,058 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,059 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,064 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,064 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,064 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,066 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,067 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,068 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,068 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,068 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,069 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,069 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,071 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,072 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,074 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,074 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,074 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,075 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,076 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,076 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,076 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,076 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,076 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,077 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,077 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,077 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,078 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,078 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,084 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,084 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,084 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,084 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,084 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,085 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,089 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,089 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,089 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,090 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,091 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,091 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,091 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,091 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,092 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,092 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,092 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,095 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,097 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,098 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,098 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,098 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,099 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,099 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,099 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,100 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,102 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,102 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,103 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,103 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,107 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,107 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,107 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,107 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,108 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,109 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,110 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,110 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,111 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,112 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,112 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,112 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,113 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,113 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,113 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,113 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,114 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,114 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,119 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,120 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,120 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,121 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,121 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,121 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,122 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,122 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,122 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,122 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,126 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,126 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,126 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,126 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,127 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,127 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,127 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,128 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,128 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,128 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,129 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,129 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,129 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,129 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,129 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,130 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,130 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,130 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,130 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,131 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,131 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,132 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,132 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,132 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,132 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,132 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,133 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,133 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,134 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,134 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,134 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,134 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,134 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,135 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,135 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,135 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,137 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 02.10 12:15:49 BoogieIcfgContainer [2018-10-02 12:15:49,137 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 12:15:49,138 INFO L168 Benchmark]: Toolchain (without parser) took 22233.92 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 324.5 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 391.5 MB). Peak memory consumption was 722.2 MB. Max. memory is 7.1 GB. [2018-10-02 12:15:49,140 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:15:49,140 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.07 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-02 12:15:49,141 INFO L168 Benchmark]: Boogie Preprocessor took 61.35 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-02 12:15:49,141 INFO L168 Benchmark]: RCFGBuilder took 739.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-10-02 12:15:49,142 INFO L168 Benchmark]: TraceAbstraction took 21367.54 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 324.5 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 338.7 MB). Peak memory consumption was 669.4 MB. Max. memory is 7.1 GB. [2018-10-02 12:15:49,147 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.07 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 61.35 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 739.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21367.54 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 324.5 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 338.7 MB). Peak memory consumption was 669.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 543]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 424]: Loop Invariant [2018-10-02 12:15:49,163 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,163 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,163 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,163 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,164 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,164 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,164 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,165 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-02 12:15:49,165 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,166 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,166 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,166 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,167 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,167 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,167 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,167 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-02 12:15:49,168 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,168 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,168 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,169 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,169 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,169 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,170 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,170 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-02 12:15:49,171 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,171 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,171 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,174 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,175 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,175 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,175 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,176 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-02 12:15:49,176 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,176 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,177 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,177 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,177 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,180 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,180 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,180 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-02 12:15:49,181 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,181 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,181 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,181 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,182 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,182 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,182 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,182 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,185 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,186 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,186 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,186 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,186 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,188 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,189 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,189 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-02 12:15:49,193 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,193 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,193 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,193 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,194 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,194 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,195 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,195 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-02 12:15:49,195 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,196 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,196 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,196 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,196 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,197 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,197 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,197 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-02 12:15:49,198 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,198 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,198 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,199 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,199 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,200 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,200 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,200 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-02 12:15:49,201 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,201 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,201 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,202 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,202 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,203 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,203 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,203 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-02 12:15:49,203 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,204 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,204 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,204 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,205 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,205 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,205 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,205 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-02 12:15:49,206 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,206 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,206 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,206 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,207 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,207 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,207 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,207 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-02 12:15:49,208 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,208 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,208 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,208 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,209 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,209 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,209 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,209 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-02 12:15:49,210 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,210 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,210 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,210 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,211 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,211 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,211 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,211 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-02 12:15:49,212 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,212 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,212 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,212 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,213 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,213 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,213 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,214 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-02 12:15:49,214 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,215 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,215 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,215 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,215 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,216 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,216 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,216 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,217 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,217 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,217 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,217 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,217 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,218 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,218 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:15:49,218 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, 21.1s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 8.0s AutomataDifference, 0.0s DeadEndRemovalTime, 8.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 370 SDtfs, 335 SDslu, 296 SDs, 0 SdLazy, 187 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s 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.6s 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, 6.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s 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-02_12-15-49-224.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-02_12-15-49-224.csv Received shutdown request...