java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2eb0a67 [2018-10-03 08:48:17,759 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-03 08:48:17,761 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-03 08:48:17,775 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-03 08:48:17,776 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-03 08:48:17,778 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-03 08:48:17,781 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-03 08:48:17,783 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-03 08:48:17,785 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-03 08:48:17,786 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-03 08:48:17,787 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-03 08:48:17,787 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-03 08:48:17,788 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-03 08:48:17,790 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-03 08:48:17,792 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-03 08:48:17,793 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-03 08:48:17,794 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-03 08:48:17,796 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-03 08:48:17,798 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-03 08:48:17,799 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-03 08:48:17,801 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-03 08:48:17,802 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-03 08:48:17,805 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-03 08:48:17,805 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-03 08:48:17,805 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-03 08:48:17,806 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-03 08:48:17,807 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-03 08:48:17,808 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-03 08:48:17,809 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-03 08:48:17,810 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-03 08:48:17,810 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-03 08:48:17,811 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-03 08:48:17,811 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-03 08:48:17,812 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-03 08:48:17,813 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-03 08:48:17,814 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-03 08:48:17,814 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-03 08:48:17,829 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-03 08:48:17,829 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-03 08:48:17,830 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-03 08:48:17,830 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-03 08:48:17,831 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-03 08:48:17,831 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-03 08:48:17,831 INFO L133 SettingsManager]: * Use SBE=true [2018-10-03 08:48:17,832 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-03 08:48:17,832 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-03 08:48:17,832 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-03 08:48:17,832 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-03 08:48:17,833 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-03 08:48:17,834 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-03 08:48:17,834 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-03 08:48:17,834 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-03 08:48:17,834 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-03 08:48:17,834 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-03 08:48:17,834 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-03 08:48:17,835 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-03 08:48:17,835 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-03 08:48:17,835 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-03 08:48:17,835 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-03 08:48:17,835 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-03 08:48:17,836 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-03 08:48:17,836 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-03 08:48:17,836 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-03 08:48:17,836 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-03 08:48:17,838 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-03 08:48:17,838 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-03 08:48:17,838 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-03 08:48:17,902 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-03 08:48:17,917 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-03 08:48:17,922 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-03 08:48:17,924 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-03 08:48:17,925 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-03 08:48:17,925 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-03 08:48:17,926 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-03 08:48:18,015 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-03 08:48:18,018 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-03 08:48:18,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-03 08:48:18,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-03 08:48:18,019 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-03 08:48:18,039 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 03.10 08:48:18" (1/1) ... [2018-10-03 08:48:18,067 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 03.10 08:48:18" (1/1) ... [2018-10-03 08:48:18,078 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-03 08:48:18,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-03 08:48:18,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-03 08:48:18,079 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-03 08:48:18,091 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 03.10 08:48:18" (1/1) ... [2018-10-03 08:48:18,091 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 03.10 08:48:18" (1/1) ... [2018-10-03 08:48:18,098 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 03.10 08:48:18" (1/1) ... [2018-10-03 08:48:18,098 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 03.10 08:48:18" (1/1) ... [2018-10-03 08:48:18,116 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 03.10 08:48:18" (1/1) ... [2018-10-03 08:48:18,119 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 03.10 08:48:18" (1/1) ... [2018-10-03 08:48:18,123 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 03.10 08:48:18" (1/1) ... [2018-10-03 08:48:18,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-03 08:48:18,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-03 08:48:18,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-03 08:48:18,135 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-03 08:48:18,137 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 03.10 08:48:18" (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-03 08:48:18,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-03 08:48:18,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-03 08:48:19,037 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-03 08:48:19,038 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 03.10 08:48:19 BoogieIcfgContainer [2018-10-03 08:48:19,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-03 08:48:19,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-03 08:48:19,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-03 08:48:19,044 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-03 08:48:19,044 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 03.10 08:48:18" (1/2) ... [2018-10-03 08:48:19,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f470f1 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 03.10 08:48:19, skipping insertion in model container [2018-10-03 08:48:19,046 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 03.10 08:48:19" (2/2) ... [2018-10-03 08:48:19,048 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl [2018-10-03 08:48:19,059 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-03 08:48:19,068 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-03 08:48:19,124 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-03 08:48:19,124 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-03 08:48:19,125 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-03 08:48:19,125 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-03 08:48:19,125 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-03 08:48:19,125 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-03 08:48:19,125 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-03 08:48:19,126 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-03 08:48:19,126 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-03 08:48:19,143 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-10-03 08:48:19,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-03 08:48:19,151 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:48:19,152 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-03 08:48:19,153 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:48:19,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:48:19,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-10-03 08:48:19,162 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:48:19,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:48:19,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:19,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:48:19,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:48:19,466 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-03 08:48:19,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:48:19,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 08:48:19,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:48:19,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:48:19,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:19,495 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-10-03 08:48:19,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:48:19,569 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-10-03 08:48:19,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:48:19,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-03 08:48:19,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:48:19,584 INFO L225 Difference]: With dead ends: 57 [2018-10-03 08:48:19,584 INFO L226 Difference]: Without dead ends: 37 [2018-10-03 08:48:19,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:19,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-03 08:48:19,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-10-03 08:48:19,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-03 08:48:19,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-10-03 08:48:19,633 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-10-03 08:48:19,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:48:19,633 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-10-03 08:48:19,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:48:19,634 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-10-03 08:48:19,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-03 08:48:19,635 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:48:19,635 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-03 08:48:19,635 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:48:19,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:48:19,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-10-03 08:48:19,636 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:48:19,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:48:19,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:19,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:48:19,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:48:19,766 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-03 08:48:19,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:48:19,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 08:48:19,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:48:19,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:48:19,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:19,770 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-10-03 08:48:19,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:48:19,830 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-10-03 08:48:19,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:48:19,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-03 08:48:19,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:48:19,833 INFO L225 Difference]: With dead ends: 103 [2018-10-03 08:48:19,833 INFO L226 Difference]: Without dead ends: 69 [2018-10-03 08:48:19,835 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:19,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-03 08:48:19,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-10-03 08:48:19,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-03 08:48:19,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-10-03 08:48:19,878 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-10-03 08:48:19,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:48:19,881 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-10-03 08:48:19,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:48:19,883 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-10-03 08:48:19,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-03 08:48:19,884 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:48:19,884 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-03 08:48:19,884 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:48:19,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:48:19,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-10-03 08:48:19,885 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:48:19,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:48:19,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:19,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:48:19,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:48:20,049 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-03 08:48:20,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:48:20,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 08:48:20,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:48:20,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:48:20,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:20,052 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 3 states. [2018-10-03 08:48:20,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:48:20,118 INFO L93 Difference]: Finished difference Result 199 states and 280 transitions. [2018-10-03 08:48:20,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:48:20,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-03 08:48:20,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:48:20,123 INFO L225 Difference]: With dead ends: 199 [2018-10-03 08:48:20,123 INFO L226 Difference]: Without dead ends: 133 [2018-10-03 08:48:20,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:20,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-03 08:48:20,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-10-03 08:48:20,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-03 08:48:20,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 182 transitions. [2018-10-03 08:48:20,154 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 182 transitions. Word has length 18 [2018-10-03 08:48:20,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:48:20,155 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 182 transitions. [2018-10-03 08:48:20,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:48:20,155 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 182 transitions. [2018-10-03 08:48:20,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-03 08:48:20,156 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:48:20,156 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-03 08:48:20,157 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:48:20,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:48:20,157 INFO L82 PathProgramCache]: Analyzing trace with hash 823143127, now seen corresponding path program 1 times [2018-10-03 08:48:20,157 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:48:20,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:48:20,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:20,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:48:20,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:48:20,310 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-03 08:48:20,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:48:20,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-03 08:48:20,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-03 08:48:20,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-03 08:48:20,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-03 08:48:20,314 INFO L87 Difference]: Start difference. First operand 131 states and 182 transitions. Second operand 4 states. [2018-10-03 08:48:20,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:48:20,542 INFO L93 Difference]: Finished difference Result 277 states and 379 transitions. [2018-10-03 08:48:20,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-03 08:48:20,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-03 08:48:20,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:48:20,551 INFO L225 Difference]: With dead ends: 277 [2018-10-03 08:48:20,551 INFO L226 Difference]: Without dead ends: 275 [2018-10-03 08:48:20,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-03 08:48:20,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-03 08:48:20,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 147. [2018-10-03 08:48:20,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-03 08:48:20,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 198 transitions. [2018-10-03 08:48:20,618 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 198 transitions. Word has length 18 [2018-10-03 08:48:20,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:48:20,618 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 198 transitions. [2018-10-03 08:48:20,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-03 08:48:20,619 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 198 transitions. [2018-10-03 08:48:20,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-03 08:48:20,619 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:48:20,620 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-03 08:48:20,620 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:48:20,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:48:20,621 INFO L82 PathProgramCache]: Analyzing trace with hash 823202709, now seen corresponding path program 1 times [2018-10-03 08:48:20,621 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:48:20,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:48:20,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:20,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:48:20,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:48:20,735 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-03 08:48:20,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:48:20,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 08:48:20,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:48:20,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:48:20,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:20,737 INFO L87 Difference]: Start difference. First operand 147 states and 198 transitions. Second operand 3 states. [2018-10-03 08:48:20,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:48:20,831 INFO L93 Difference]: Finished difference Result 359 states and 485 transitions. [2018-10-03 08:48:20,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:48:20,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-03 08:48:20,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:48:20,833 INFO L225 Difference]: With dead ends: 359 [2018-10-03 08:48:20,833 INFO L226 Difference]: Without dead ends: 213 [2018-10-03 08:48:20,835 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:20,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-10-03 08:48:20,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-10-03 08:48:20,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-03 08:48:20,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-10-03 08:48:20,876 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 18 [2018-10-03 08:48:20,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:48:20,876 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-10-03 08:48:20,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:48:20,877 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-10-03 08:48:20,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-03 08:48:20,879 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:48:20,879 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-03 08:48:20,879 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:48:20,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:48:20,880 INFO L82 PathProgramCache]: Analyzing trace with hash 748385901, now seen corresponding path program 1 times [2018-10-03 08:48:20,880 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:48:20,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:48:20,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:20,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:48:20,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:48:21,012 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-03 08:48:21,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:48:21,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 08:48:21,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:48:21,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:48:21,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:21,015 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-10-03 08:48:21,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:48:21,154 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-10-03 08:48:21,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:48:21,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-03 08:48:21,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:48:21,160 INFO L225 Difference]: With dead ends: 633 [2018-10-03 08:48:21,160 INFO L226 Difference]: Without dead ends: 423 [2018-10-03 08:48:21,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:21,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-03 08:48:21,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-10-03 08:48:21,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-10-03 08:48:21,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-10-03 08:48:21,255 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-10-03 08:48:21,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:48:21,256 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-10-03 08:48:21,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:48:21,256 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-10-03 08:48:21,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-03 08:48:21,260 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:48:21,260 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-03 08:48:21,261 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:48:21,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:48:21,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1759503151, now seen corresponding path program 1 times [2018-10-03 08:48:21,262 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:48:21,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:48:21,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:21,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:48:21,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:48:21,436 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-03 08:48:21,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:48:21,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 08:48:21,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:48:21,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:48:21,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:21,439 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-10-03 08:48:21,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:48:21,648 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-10-03 08:48:21,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:48:21,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-03 08:48:21,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:48:21,655 INFO L225 Difference]: With dead ends: 1257 [2018-10-03 08:48:21,655 INFO L226 Difference]: Without dead ends: 839 [2018-10-03 08:48:21,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:21,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-10-03 08:48:21,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-10-03 08:48:21,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-10-03 08:48:21,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-10-03 08:48:21,800 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-10-03 08:48:21,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:48:21,800 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-10-03 08:48:21,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:48:21,801 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-10-03 08:48:21,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-03 08:48:21,812 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:48:21,813 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-03 08:48:21,813 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:48:21,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:48:21,813 INFO L82 PathProgramCache]: Analyzing trace with hash -2142437135, now seen corresponding path program 1 times [2018-10-03 08:48:21,814 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:48:21,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:48:21,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:21,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:48:21,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:48:22,002 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-03 08:48:22,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:48:22,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 08:48:22,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:48:22,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:48:22,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:22,004 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-10-03 08:48:22,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:48:22,368 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-10-03 08:48:22,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:48:22,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-03 08:48:22,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:48:22,379 INFO L225 Difference]: With dead ends: 2505 [2018-10-03 08:48:22,379 INFO L226 Difference]: Without dead ends: 1671 [2018-10-03 08:48:22,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:22,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-10-03 08:48:22,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-10-03 08:48:22,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-10-03 08:48:22,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-10-03 08:48:22,626 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-10-03 08:48:22,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:48:22,626 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-10-03 08:48:22,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:48:22,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-10-03 08:48:22,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-03 08:48:22,629 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:48:22,629 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-03 08:48:22,630 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:48:22,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:48:22,632 INFO L82 PathProgramCache]: Analyzing trace with hash 2095271859, now seen corresponding path program 1 times [2018-10-03 08:48:22,632 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:48:22,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:48:22,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:22,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:48:22,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:48:22,846 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-03 08:48:22,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:48:22,847 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-03 08:48:22,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:48:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:48:22,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:48:23,210 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-03 08:48:23,691 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-03 08:48:23,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:48:23,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2018-10-03 08:48:23,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-03 08:48:23,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-03 08:48:23,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-03 08:48:23,729 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-10-03 08:48:23,972 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-03 08:48:24,283 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-03 08:48:24,816 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-03 08:48:25,182 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-03 08:48:25,645 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-03 08:48:26,880 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-03 08:48:27,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:48:27,577 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-10-03 08:48:27,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-03 08:48:27,578 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-10-03 08:48:27,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:48:27,594 INFO L225 Difference]: With dead ends: 4801 [2018-10-03 08:48:27,594 INFO L226 Difference]: Without dead ends: 3135 [2018-10-03 08:48:27,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2018-10-03 08:48:27,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-10-03 08:48:28,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-10-03 08:48:28,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-10-03 08:48:28,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-10-03 08:48:28,018 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-10-03 08:48:28,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:48:28,019 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-10-03 08:48:28,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-03 08:48:28,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-10-03 08:48:28,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-03 08:48:28,023 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:48:28,024 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-03 08:48:28,024 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:48:28,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:48:28,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1417215583, now seen corresponding path program 2 times [2018-10-03 08:48:28,025 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:48:28,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:48:28,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:28,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:48:28,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:48:28,177 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-03 08:48:28,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:48:28,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 08:48:28,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:48:28,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:48:28,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:28,180 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-10-03 08:48:28,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:48:28,799 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-10-03 08:48:28,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:48:28,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-03 08:48:28,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:48:28,810 INFO L225 Difference]: With dead ends: 4873 [2018-10-03 08:48:28,810 INFO L226 Difference]: Without dead ends: 2215 [2018-10-03 08:48:28,814 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:28,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-10-03 08:48:29,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-10-03 08:48:29,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-10-03 08:48:29,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-10-03 08:48:29,107 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-10-03 08:48:29,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:48:29,107 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-10-03 08:48:29,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:48:29,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-10-03 08:48:29,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-03 08:48:29,111 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:48:29,111 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-03 08:48:29,111 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:48:29,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:48:29,111 INFO L82 PathProgramCache]: Analyzing trace with hash 79784675, now seen corresponding path program 3 times [2018-10-03 08:48:29,112 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:48:29,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:48:29,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:29,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:48:29,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:48:29,192 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-03 08:48:29,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:48:29,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 08:48:29,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:48:29,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:48:29,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:29,194 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-10-03 08:48:29,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:48:29,234 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-10-03 08:48:29,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:48:29,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-03 08:48:29,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:48:29,235 INFO L225 Difference]: With dead ends: 1799 [2018-10-03 08:48:29,235 INFO L226 Difference]: Without dead ends: 0 [2018-10-03 08:48:29,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:29,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-03 08:48:29,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-03 08:48:29,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-03 08:48:29,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-03 08:48:29,238 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-10-03 08:48:29,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:48:29,239 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-03 08:48:29,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:48:29,239 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-03 08:48:29,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-03 08:48:29,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-03 08:48:29,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,455 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 46 [2018-10-03 08:48:29,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,715 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 43 [2018-10-03 08:48:29,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:29,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:48:30,442 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 43 [2018-10-03 08:48:31,171 WARN L178 SmtUtils]: Spent 727.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-10-03 08:48:32,519 WARN L178 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-10-03 08:48:32,669 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-10-03 08:48:32,782 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-10-03 08:48:33,164 WARN L178 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2018-10-03 08:48:33,491 WARN L178 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-10-03 08:48:33,900 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2018-10-03 08:48:33,904 INFO L421 ceAbstractionStarter]: At program point L415(lines 415 425) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= (+ ~nomsg 1) 0))) (or (and (and .cse0 .cse1 .cse2 (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))))) (<= ~mode3 1) (<= 1 ~mode3)) (and (= ~mode3 (* 256 (div ~mode3 256))) (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse4 (mod v_prenex_1 256))) (and (<= .cse4 127) (<= v_prenex_1 127) (= ~p2_new .cse4) (<= 0 v_prenex_1)))) .cse2))) [2018-10-03 08:48:33,904 INFO L421 ceAbstractionStarter]: At program point L535(lines 535 542) the Hoare annotation is: false [2018-10-03 08:48:33,904 INFO L421 ceAbstractionStarter]: At program point L490(lines 484 491) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (<= ~send2 127) (<= 0 ~send2) (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)))) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3)) [2018-10-03 08:48:33,904 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-03 08:48:33,905 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 (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 .cse2 (<= ~mode3 1) (<= 1 ~mode3) (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))))))) [2018-10-03 08:48:33,905 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 544) no Hoare annotation was computed. [2018-10-03 08:48:33,905 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 544) no Hoare annotation was computed. [2018-10-03 08:48:33,905 INFO L421 ceAbstractionStarter]: At program point L470(lines 464 471) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (<= ~send2 127) (<= 0 ~send2) (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)))) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3)) [2018-10-03 08:48:33,905 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 (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 .cse2 (<= ~mode3 1) (<= 1 ~mode3) (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))))))) [2018-10-03 08:48:33,905 INFO L421 ceAbstractionStarter]: At program point L450(lines 444 451) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (<= ~send2 127) (<= 0 ~send2) (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)))) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3)) [2018-10-03 08:48:33,906 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 544) no Hoare annotation was computed. [2018-10-03 08:48:33,906 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 (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 .cse2 (<= ~mode3 1) (<= 1 ~mode3) (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))))))) [2018-10-03 08:48:33,906 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-03 08:48:33,906 INFO L421 ceAbstractionStarter]: At program point L475(lines 475 485) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (<= ~send2 127) (<= 0 ~send2) (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)))) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3)) [2018-10-03 08:48:33,907 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 (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 .cse2 (<= ~mode3 1) (<= 1 ~mode3) (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))))))) [2018-10-03 08:48:33,907 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-03 08:48:33,907 INFO L421 ceAbstractionStarter]: At program point L430(lines 424 431) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (<= ~send2 127) (<= 0 ~send2) (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)))) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3)) [2018-10-03 08:48:33,908 INFO L421 ceAbstractionStarter]: At program point L455(lines 455 465) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (<= ~send2 127) (<= 0 ~send2) (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)))) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3)) [2018-10-03 08:48:33,908 INFO L421 ceAbstractionStarter]: At program point L410(lines 401 411) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= (+ ~nomsg 1) 0))) (or (and (and .cse0 .cse1 .cse2 (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))))) (<= ~mode3 1) (<= 1 ~mode3)) (and (= ~mode3 (* 256 (div ~mode3 256))) (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse4 (mod v_prenex_1 256))) (and (<= .cse4 127) (<= v_prenex_1 127) (= ~p2_new .cse4) (<= 0 v_prenex_1)))) .cse2))) [2018-10-03 08:48:33,908 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 543) no Hoare annotation was computed. [2018-10-03 08:48:33,908 INFO L421 ceAbstractionStarter]: At program point L435(lines 435 445) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (<= ~send2 127) (<= 0 ~send2) (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)))) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3)) [2018-10-03 08:48:33,916 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,917 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,917 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,918 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,924 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,924 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,925 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,925 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,927 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,928 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,928 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,928 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,931 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,931 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,931 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,931 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,933 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,933 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,933 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,934 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,935 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,936 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,936 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,936 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,938 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,938 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,938 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,938 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,940 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,940 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,940 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,940 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,942 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,942 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,942 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,943 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,944 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,944 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,945 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,945 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,946 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,947 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,947 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,947 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,948 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,948 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,948 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,949 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,950 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,950 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,951 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,951 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,951 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,952 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,952 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,952 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,954 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,954 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,954 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,954 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,956 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,956 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,956 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,957 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,958 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,958 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,958 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,959 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,960 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,960 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,960 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,960 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,962 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,962 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,962 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,962 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,964 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,964 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,964 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,964 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,966 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,966 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,966 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,967 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,968 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,968 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,968 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,969 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,970 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,970 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,970 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,971 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,972 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,972 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,972 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,972 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,973 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,974 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,974 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,974 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,975 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,975 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,975 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,975 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,976 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,977 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,977 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,977 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,978 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,978 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,978 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,978 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,979 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,980 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,980 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,980 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,981 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,981 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,982 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,982 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,983 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,983 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,983 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,983 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,984 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,984 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,985 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,985 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,986 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,986 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,987 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,987 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,987 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,988 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,988 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,988 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,989 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,989 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,990 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,990 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,990 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,990 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,991 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,991 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:33,993 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 03.10 08:48:33 BoogieIcfgContainer [2018-10-03 08:48:33,993 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-03 08:48:33,994 INFO L168 Benchmark]: Toolchain (without parser) took 15978.63 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 199.2 MB). Free memory was 1.4 GB in the beginning and 928.1 MB in the end (delta: 517.1 MB). Peak memory consumption was 716.3 MB. Max. memory is 7.1 GB. [2018-10-03 08:48:33,996 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 08:48:33,996 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 08:48:33,997 INFO L168 Benchmark]: Boogie Preprocessor took 55.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 08:48:33,997 INFO L168 Benchmark]: RCFGBuilder took 904.07 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-10-03 08:48:33,998 INFO L168 Benchmark]: TraceAbstraction took 14953.19 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 199.2 MB). Free memory was 1.4 GB in the beginning and 928.1 MB in the end (delta: 464.2 MB). Peak memory consumption was 663.4 MB. Max. memory is 7.1 GB. [2018-10-03 08:48:34,002 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 904.07 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14953.19 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 199.2 MB). Free memory was 1.4 GB in the beginning and 928.1 MB in the end (delta: 464.2 MB). Peak memory consumption was 663.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-03 08:48:34,020 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,021 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,021 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,021 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,022 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,022 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,022 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,022 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) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3 - InvariantResult [Line: 382]: Loop Invariant [2018-10-03 08:48:34,023 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,023 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,024 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,024 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,024 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,025 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,025 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,025 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) || (((((((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: 444]: Loop Invariant [2018-10-03 08:48:34,026 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,026 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,026 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,026 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,027 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,027 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,027 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,028 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) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3 - InvariantResult [Line: 535]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 464]: Loop Invariant [2018-10-03 08:48:34,029 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,029 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,029 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,029 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,030 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,030 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,030 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,030 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) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3 - InvariantResult [Line: 484]: Loop Invariant [2018-10-03 08:48:34,031 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,031 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,032 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,032 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,032 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,033 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,033 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,033 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) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3 - InvariantResult [Line: 415]: Loop Invariant [2018-10-03 08:48:34,034 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,034 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,034 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,034 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,035 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,035 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,035 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,035 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,036 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,036 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,036 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,037 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,037 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,037 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,037 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,037 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((~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)) && ~mode3 <= 1) && 1 <= ~mode3) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~r1 <= 1) && ~send2 <= 127) && 0 <= ~send2) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~nomsg + 1 == 0) - InvariantResult [Line: 372]: Loop Invariant [2018-10-03 08:48:34,038 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,039 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,039 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,039 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,040 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,040 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,040 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,040 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) || (((((((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: 435]: Loop Invariant [2018-10-03 08:48:34,041 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,041 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,041 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,042 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,042 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,042 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,043 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,043 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) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3 - InvariantResult [Line: 392]: Loop Invariant [2018-10-03 08:48:34,043 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,044 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,044 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,044 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,045 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,045 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,045 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,045 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) || (((((((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: 365]: Loop Invariant [2018-10-03 08:48:34,046 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,046 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,046 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,047 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,047 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,047 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,047 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,048 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) || (((((((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: 455]: Loop Invariant [2018-10-03 08:48:34,048 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,049 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,049 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,049 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,050 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,050 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,050 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,050 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) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3 - InvariantResult [Line: 514]: Loop Invariant [2018-10-03 08:48:34,051 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,051 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,051 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,051 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,052 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,052 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,052 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,053 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-03 08:48:34,053 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,053 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,053 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,054 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,054 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,054 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,054 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,055 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-03 08:48:34,055 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,055 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,056 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,056 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,056 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,057 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,057 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,057 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-03 08:48:34,057 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,058 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,058 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,058 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,059 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,059 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,059 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,059 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) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3 - InvariantResult [Line: 401]: Loop Invariant [2018-10-03 08:48:34,060 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,060 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,060 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,060 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,061 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,061 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,061 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,061 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,062 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,062 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,062 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,063 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,063 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,063 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,063 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 08:48:34,063 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((~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)) && ~mode3 <= 1) && 1 <= ~mode3) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~r1 <= 1) && ~send2 <= 127) && 0 <= ~send2) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~nomsg + 1 == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. SAFE Result, 14.7s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 5.8s AutomataDifference, 0.0s DeadEndRemovalTime, 4.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 370 SDtfs, 335 SDslu, 296 SDs, 0 SdLazy, 187 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 2.8s 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.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1592 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 581 NumberOfFragments, 966 HoareAnnotationTreeSize, 17 FomulaSimplifications, 82925 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 17 FomulaSimplificationsInter, 630 FormulaSimplificationTreeSizeReductionInter, 3.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 380 ConstructedInterpolants, 18 QuantifiedInterpolants, 54494 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.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-03_08-48-34-070.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.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-03_08-48-34-070.csv Received shutdown request...