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-9f4048f [2018-10-04 12:27:13,655 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:27:13,657 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:27:13,669 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:27:13,669 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:27:13,670 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:27:13,672 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:27:13,673 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:27:13,675 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:27:13,676 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:27:13,677 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:27:13,677 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:27:13,678 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:27:13,679 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:27:13,680 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:27:13,681 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:27:13,682 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:27:13,684 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:27:13,689 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:27:13,691 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:27:13,692 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:27:13,693 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:27:13,696 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:27:13,696 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:27:13,696 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:27:13,697 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:27:13,698 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:27:13,699 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:27:13,700 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:27:13,701 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:27:13,701 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:27:13,702 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:27:13,702 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:27:13,702 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:27:13,703 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:27:13,704 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:27:13,704 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-04 12:27:13,720 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:27:13,720 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:27:13,721 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:27:13,721 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:27:13,722 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:27:13,722 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:27:13,722 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:27:13,722 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:27:13,722 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:27:13,723 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:27:13,723 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:27:13,723 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:27:13,723 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:27:13,723 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:27:13,724 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:27:13,724 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:27:13,724 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:27:13,724 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:27:13,724 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:27:13,725 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:27:13,725 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:27:13,725 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:27:13,725 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:27:13,725 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:27:13,726 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:27:13,726 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:27:13,726 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:27:13,726 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:27:13,726 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:27:13,726 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:27:13,770 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:27:13,783 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:27:13,787 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:27:13,788 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:27:13,789 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:27:13,790 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl [2018-10-04 12:27:13,790 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl' [2018-10-04 12:27:13,873 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:27:13,874 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:27:13,875 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:27:13,875 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:27:13,878 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:27:13,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:13" (1/1) ... [2018-10-04 12:27:13,926 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:13" (1/1) ... [2018-10-04 12:27:13,937 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:27:13,938 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:27:13,939 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:27:13,939 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:27:13,950 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:13" (1/1) ... [2018-10-04 12:27:13,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:13" (1/1) ... [2018-10-04 12:27:13,954 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:13" (1/1) ... [2018-10-04 12:27:13,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:13" (1/1) ... [2018-10-04 12:27:13,965 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:13" (1/1) ... [2018-10-04 12:27:13,968 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:13" (1/1) ... [2018-10-04 12:27:13,971 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:13" (1/1) ... [2018-10-04 12:27:13,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:27:13,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:27:13,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:27:13,977 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:27:13,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:27:14,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:27:14,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:27:14,695 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:27:14,696 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:27:14 BoogieIcfgContainer [2018-10-04 12:27:14,696 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:27:14,697 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:27:14,697 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:27:14,700 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:27:14,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:13" (1/2) ... [2018-10-04 12:27:14,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ff36f8 and model type pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:27:14, skipping insertion in model container [2018-10-04 12:27:14,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:27:14" (2/2) ... [2018-10-04 12:27:14,704 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl [2018-10-04 12:27:14,713 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:27:14,723 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:27:14,774 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:27:14,775 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:27:14,776 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:27:14,776 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:27:14,776 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:27:14,776 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:27:14,776 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:27:14,776 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:27:14,777 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:27:14,793 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-10-04 12:27:14,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:27:14,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:14,801 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:14,802 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:14,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:14,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-10-04 12:27:14,811 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:14,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:14,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:14,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:14,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:15,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:15,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:15,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:27:15,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:15,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:15,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:15,122 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-10-04 12:27:15,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:15,166 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-10-04 12:27:15,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:15,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-04 12:27:15,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:15,179 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:27:15,179 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:27:15,183 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-04 12:27:15,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:27:15,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-10-04 12:27:15,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 12:27:15,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-10-04 12:27:15,232 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-10-04 12:27:15,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:15,233 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-10-04 12:27:15,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:15,233 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-10-04 12:27:15,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:27:15,234 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:15,235 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:15,235 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:15,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:15,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-10-04 12:27:15,236 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:15,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:15,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:15,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:15,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:15,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:15,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:15,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:27:15,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:15,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:15,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:15,389 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-10-04 12:27:15,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:15,453 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-10-04 12:27:15,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:15,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-04 12:27:15,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:15,457 INFO L225 Difference]: With dead ends: 103 [2018-10-04 12:27:15,457 INFO L226 Difference]: Without dead ends: 69 [2018-10-04 12:27:15,458 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-04 12:27:15,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-04 12:27:15,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-10-04 12:27:15,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-04 12:27:15,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-10-04 12:27:15,496 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-10-04 12:27:15,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:15,497 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-10-04 12:27:15,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:15,497 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-10-04 12:27:15,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:27:15,498 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:15,498 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:15,498 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:15,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:15,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-10-04 12:27:15,499 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:15,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:15,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:15,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:15,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:15,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:15,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:15,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:15,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:27:15,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:15,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:15,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:15,678 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 3 states. [2018-10-04 12:27:15,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:15,743 INFO L93 Difference]: Finished difference Result 199 states and 280 transitions. [2018-10-04 12:27:15,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:15,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-04 12:27:15,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:15,748 INFO L225 Difference]: With dead ends: 199 [2018-10-04 12:27:15,749 INFO L226 Difference]: Without dead ends: 133 [2018-10-04 12:27:15,750 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-04 12:27:15,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-04 12:27:15,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-10-04 12:27:15,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-04 12:27:15,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 182 transitions. [2018-10-04 12:27:15,801 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 182 transitions. Word has length 18 [2018-10-04 12:27:15,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:15,805 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 182 transitions. [2018-10-04 12:27:15,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:15,806 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 182 transitions. [2018-10-04 12:27:15,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:27:15,807 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:15,807 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:15,808 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:15,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:15,808 INFO L82 PathProgramCache]: Analyzing trace with hash 823143127, now seen corresponding path program 1 times [2018-10-04 12:27:15,808 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:15,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:15,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:15,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:15,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:15,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:15,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:15,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:27:15,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:27:15,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:27:15,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:27:15,961 INFO L87 Difference]: Start difference. First operand 131 states and 182 transitions. Second operand 4 states. [2018-10-04 12:27:16,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:16,171 INFO L93 Difference]: Finished difference Result 277 states and 379 transitions. [2018-10-04 12:27:16,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:27:16,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-04 12:27:16,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:16,175 INFO L225 Difference]: With dead ends: 277 [2018-10-04 12:27:16,175 INFO L226 Difference]: Without dead ends: 275 [2018-10-04 12:27:16,176 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-04 12:27:16,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-04 12:27:16,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 147. [2018-10-04 12:27:16,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-04 12:27:16,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 198 transitions. [2018-10-04 12:27:16,219 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 198 transitions. Word has length 18 [2018-10-04 12:27:16,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:16,219 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 198 transitions. [2018-10-04 12:27:16,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:27:16,220 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 198 transitions. [2018-10-04 12:27:16,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:27:16,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:16,221 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:16,221 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:16,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:16,221 INFO L82 PathProgramCache]: Analyzing trace with hash 823202709, now seen corresponding path program 1 times [2018-10-04 12:27:16,222 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:16,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:16,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:16,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:16,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:16,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:16,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:16,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:27:16,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:16,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:16,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:16,360 INFO L87 Difference]: Start difference. First operand 147 states and 198 transitions. Second operand 3 states. [2018-10-04 12:27:16,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:16,470 INFO L93 Difference]: Finished difference Result 359 states and 485 transitions. [2018-10-04 12:27:16,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:16,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-04 12:27:16,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:16,474 INFO L225 Difference]: With dead ends: 359 [2018-10-04 12:27:16,474 INFO L226 Difference]: Without dead ends: 213 [2018-10-04 12:27:16,476 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-04 12:27:16,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-10-04 12:27:16,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-10-04 12:27:16,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-04 12:27:16,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-10-04 12:27:16,547 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 18 [2018-10-04 12:27:16,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:16,547 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-10-04 12:27:16,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:16,547 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-10-04 12:27:16,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:27:16,553 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:16,554 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:16,554 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:16,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:16,557 INFO L82 PathProgramCache]: Analyzing trace with hash 748385901, now seen corresponding path program 1 times [2018-10-04 12:27:16,557 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:16,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:16,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:16,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:16,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:16,768 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:16,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:16,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:27:16,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:16,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:16,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:16,770 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-10-04 12:27:16,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:16,911 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-10-04 12:27:16,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:16,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 12:27:16,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:16,916 INFO L225 Difference]: With dead ends: 633 [2018-10-04 12:27:16,916 INFO L226 Difference]: Without dead ends: 423 [2018-10-04 12:27:16,918 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-04 12:27:16,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-04 12:27:17,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-10-04 12:27:17,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-10-04 12:27:17,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-10-04 12:27:17,028 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-10-04 12:27:17,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:17,028 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-10-04 12:27:17,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:17,028 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-10-04 12:27:17,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:27:17,032 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:17,033 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:17,033 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:17,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:17,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1759503151, now seen corresponding path program 1 times [2018-10-04 12:27:17,034 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:17,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:17,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:17,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:17,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:17,183 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:17,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:17,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:27:17,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:17,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:17,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:17,184 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-10-04 12:27:17,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:17,383 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-10-04 12:27:17,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:17,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 12:27:17,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:17,389 INFO L225 Difference]: With dead ends: 1257 [2018-10-04 12:27:17,389 INFO L226 Difference]: Without dead ends: 839 [2018-10-04 12:27:17,391 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-04 12:27:17,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-10-04 12:27:17,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-10-04 12:27:17,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-10-04 12:27:17,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-10-04 12:27:17,526 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-10-04 12:27:17,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:17,527 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-10-04 12:27:17,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:17,527 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-10-04 12:27:17,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:27:17,531 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:17,531 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:17,532 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:17,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:17,532 INFO L82 PathProgramCache]: Analyzing trace with hash -2142437135, now seen corresponding path program 1 times [2018-10-04 12:27:17,532 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:17,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:17,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:17,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:17,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:17,681 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:17,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:17,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:27:17,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:17,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:17,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:17,683 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-10-04 12:27:18,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:18,023 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-10-04 12:27:18,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:18,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 12:27:18,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:18,033 INFO L225 Difference]: With dead ends: 2505 [2018-10-04 12:27:18,033 INFO L226 Difference]: Without dead ends: 1671 [2018-10-04 12:27:18,036 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-04 12:27:18,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-10-04 12:27:18,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-10-04 12:27:18,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-10-04 12:27:18,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-10-04 12:27:18,302 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-10-04 12:27:18,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:18,302 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-10-04 12:27:18,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:18,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-10-04 12:27:18,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:27:18,306 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:18,307 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:18,307 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:18,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:18,307 INFO L82 PathProgramCache]: Analyzing trace with hash 2095271859, now seen corresponding path program 1 times [2018-10-04 12:27:18,308 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:18,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:18,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:18,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:18,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:18,566 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:27:18,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:27:18,567 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:27:18,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:18,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:27:19,268 WARN L178 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-10-04 12:27:19,569 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:19,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:27:19,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2018-10-04 12:27:19,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:27:19,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:27:19,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:27:19,602 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-10-04 12:27:19,837 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-04 12:27:20,149 WARN L178 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-04 12:27:20,654 WARN L178 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-04 12:27:21,006 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-04 12:27:21,260 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-04 12:27:21,621 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-04 12:27:22,991 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-04 12:27:23,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:23,773 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-10-04 12:27:23,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:27:23,774 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-10-04 12:27:23,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:23,791 INFO L225 Difference]: With dead ends: 4801 [2018-10-04 12:27:23,791 INFO L226 Difference]: Without dead ends: 3135 [2018-10-04 12:27:23,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:27:23,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-10-04 12:27:24,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-10-04 12:27:24,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-10-04 12:27:24,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-10-04 12:27:24,288 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-10-04 12:27:24,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:24,288 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-10-04 12:27:24,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:27:24,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-10-04 12:27:24,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-04 12:27:24,293 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:24,294 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 12:27:24,294 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:24,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:24,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1417215583, now seen corresponding path program 2 times [2018-10-04 12:27:24,294 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:24,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:24,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:24,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:24,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:24,442 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-04 12:27:24,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:24,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:27:24,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:24,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:24,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:24,444 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-10-04 12:27:25,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:25,247 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-10-04 12:27:25,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:25,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-04 12:27:25,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:25,259 INFO L225 Difference]: With dead ends: 4873 [2018-10-04 12:27:25,260 INFO L226 Difference]: Without dead ends: 2215 [2018-10-04 12:27:25,264 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-04 12:27:25,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-10-04 12:27:25,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-10-04 12:27:25,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-10-04 12:27:25,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-10-04 12:27:25,680 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-10-04 12:27:25,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:25,680 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-10-04 12:27:25,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:25,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-10-04 12:27:25,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-04 12:27:25,684 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:25,684 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-10-04 12:27:25,684 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:25,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:25,686 INFO L82 PathProgramCache]: Analyzing trace with hash 79784675, now seen corresponding path program 3 times [2018-10-04 12:27:25,686 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:25,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:25,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:25,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:27:25,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:25,779 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-04 12:27:25,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:25,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:27:25,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:25,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:25,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:25,781 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-10-04 12:27:25,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:25,818 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-10-04 12:27:25,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:25,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-04 12:27:25,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:25,819 INFO L225 Difference]: With dead ends: 1799 [2018-10-04 12:27:25,819 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:27:25,821 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-04 12:27:25,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:27:25,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:27:25,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:27:25,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:27:25,822 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-10-04 12:27:25,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:25,823 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:27:25,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:25,823 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:27:25,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:27:25,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:27:25,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:25,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:25,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:25,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:25,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:25,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:25,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:25,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:25,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:25,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:25,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:25,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:25,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:25,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:25,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:25,940 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 34 [2018-10-04 12:27:25,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:25,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:25,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:25,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,054 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 46 [2018-10-04 12:27:26,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,328 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 43 [2018-10-04 12:27:26,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:26,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:27,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:27,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:27,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:27,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:27,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:27,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:27,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:27,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:27,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:27,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:27,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:27,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:27,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:27,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:27,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:27,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:27,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:27,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:27,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:27,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:27,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:27,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:27,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:27,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:27,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:27,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:27,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:27,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:27,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:27,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:27,102 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 43 [2018-10-04 12:27:27,807 WARN L178 SmtUtils]: Spent 703.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-10-04 12:27:29,029 WARN L178 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-10-04 12:27:29,224 WARN L178 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-10-04 12:27:29,375 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-10-04 12:27:29,565 WARN L178 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-10-04 12:27:29,896 WARN L178 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2018-10-04 12:27:30,214 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-10-04 12:27:30,600 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2018-10-04 12:27:30,604 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-04 12:27:30,604 INFO L421 ceAbstractionStarter]: At program point L535(lines 535 542) the Hoare annotation is: false [2018-10-04 12:27:30,604 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-04 12:27:30,604 INFO L421 ceAbstractionStarter]: At program point L519(lines 514 520) the Hoare annotation is: (and (<= 1 ULTIMATE.start_check_~tmp~156) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse0 ~p2_old))))) [2018-10-04 12:27:30,605 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-04 12:27:30,605 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 544) no Hoare annotation was computed. [2018-10-04 12:27:30,605 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 544) no Hoare annotation was computed. [2018-10-04 12:27:30,605 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-04 12:27:30,605 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-04 12:27:30,606 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-04 12:27:30,606 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 544) no Hoare annotation was computed. [2018-10-04 12:27:30,606 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-04 12:27:30,606 INFO L421 ceAbstractionStarter]: At program point L508(lines 508 515) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (<= ~send2 127) (<= 0 ~send2) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse0 ~p2_old))))) [2018-10-04 12:27:30,606 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-04 12:27:30,607 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-04 12:27:30,607 INFO L421 ceAbstractionStarter]: At program point L529(lines 529 536) the Hoare annotation is: (and (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~156) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse0 ~p2_old))))) [2018-10-04 12:27:30,607 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-04 12:27:30,607 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-04 12:27:30,607 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-04 12:27:30,608 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-04 12:27:30,608 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 543) no Hoare annotation was computed. [2018-10-04 12:27:30,615 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,616 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,616 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,616 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,622 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,622 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,622 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,623 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,625 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,625 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,626 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,626 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,628 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,628 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,628 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,629 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,630 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,630 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,631 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,631 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,632 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,632 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,633 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,633 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,634 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,634 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,635 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,635 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,636 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,636 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,637 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,637 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,638 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,639 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,639 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,639 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,640 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,641 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,641 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,641 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,643 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,643 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,643 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,643 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,644 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,644 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,644 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,644 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,646 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,646 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,647 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,647 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,647 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,647 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,648 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,648 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,649 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,650 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,650 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,650 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,652 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,652 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,652 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,652 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,653 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,653 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,654 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,654 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,655 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,655 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,655 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,656 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,657 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,657 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,657 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,658 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,659 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,659 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,659 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,660 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,661 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,661 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,661 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,662 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,663 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,663 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,663 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,664 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,665 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,665 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,665 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,665 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,666 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,667 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,667 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,667 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,668 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,668 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,669 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,669 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,670 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,670 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,670 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,670 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,671 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,672 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,672 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,672 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,673 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,673 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,674 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,674 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,675 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,675 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,675 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,675 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,677 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,677 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,677 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,677 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,678 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,678 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,679 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,679 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,680 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,680 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,680 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,680 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,681 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,682 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,682 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,682 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,683 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,683 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,683 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,683 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,684 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,685 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,685 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,685 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,686 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,686 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,686 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,686 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,689 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:27:30 BoogieIcfgContainer [2018-10-04 12:27:30,689 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:27:30,690 INFO L168 Benchmark]: Toolchain (without parser) took 16816.46 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 195.0 MB). Free memory was 1.5 GB in the beginning and 925.1 MB in the end (delta: 534.8 MB). Peak memory consumption was 729.8 MB. Max. memory is 7.1 GB. [2018-10-04 12:27:30,691 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:27:30,692 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.63 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:27:30,692 INFO L168 Benchmark]: Boogie Preprocessor took 38.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:27:30,693 INFO L168 Benchmark]: RCFGBuilder took 718.81 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-04 12:27:30,693 INFO L168 Benchmark]: TraceAbstraction took 15991.82 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 195.0 MB). Free memory was 1.4 GB in the beginning and 925.1 MB in the end (delta: 492.5 MB). Peak memory consumption was 687.5 MB. Max. memory is 7.1 GB. [2018-10-04 12:27:30,698 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.63 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 718.81 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15991.82 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 195.0 MB). Free memory was 1.4 GB in the beginning and 925.1 MB in the end (delta: 492.5 MB). Peak memory consumption was 687.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 543]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 424]: Loop Invariant [2018-10-04 12:27:30,716 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,716 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,716 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,717 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,717 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,717 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,718 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,718 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-04 12:27:30,719 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,719 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,719 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,719 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,720 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,720 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,720 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,720 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-04 12:27:30,721 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,721 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,722 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,722 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,722 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,723 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,723 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,723 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-04 12:27:30,724 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,724 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,724 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,725 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,725 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,725 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,726 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,726 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-04 12:27:30,727 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,727 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,727 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,727 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,728 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,728 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,728 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,728 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-04 12:27:30,729 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,729 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,730 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,730 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,730 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,730 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,731 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,731 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,732 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,732 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,732 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,732 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,732 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,733 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,733 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,733 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-04 12:27:30,734 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,734 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,734 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,734 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,735 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,735 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,735 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,736 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-04 12:27:30,736 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,736 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,737 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,737 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,737 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,738 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,738 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,738 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-04 12:27:30,739 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,739 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,739 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,739 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,740 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,740 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,741 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,741 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-04 12:27:30,741 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,742 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,742 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,742 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,743 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,743 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,743 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,743 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-04 12:27:30,744 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,744 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,744 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,745 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,745 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,745 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,745 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,746 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-04 12:27:30,746 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,747 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,747 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,747 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,747 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,748 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,748 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,748 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= check_~tmp~156 && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old) - InvariantResult [Line: 508]: Loop Invariant [2018-10-04 12:27:30,748 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,749 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,749 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,749 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,749 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,750 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,750 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,750 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= ~mode2 && ~mode2 <= 1) && ~r1 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old) - InvariantResult [Line: 529]: Loop Invariant [2018-10-04 12:27:30,751 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,751 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,751 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,751 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,752 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,752 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,752 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,752 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((assert_~arg == 1 && 1 <= check_~tmp~156) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old) - InvariantResult [Line: 475]: Loop Invariant [2018-10-04 12:27:30,753 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,753 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,753 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,753 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,754 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,754 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,754 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,755 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-04 12:27:30,755 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,756 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,756 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,756 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,756 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,756 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,757 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,757 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,757 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,758 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,758 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,758 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,758 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,758 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,759 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-04 12:27:30,759 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, 15.8s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 6.3s AutomataDifference, 0.0s DeadEndRemovalTime, 4.7s 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, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2101occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 1592 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 581 NumberOfFragments, 966 HoareAnnotationTreeSize, 17 FomulaSimplifications, 82925 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 17 FomulaSimplificationsInter, 630 FormulaSimplificationTreeSizeReductionInter, 3.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s 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-04_12-27-30-765.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-04_12-27-30-765.csv Received shutdown request...