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-00a8621 [2018-09-30 10:27:56,079 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:27:56,081 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:27:56,094 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:27:56,095 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:27:56,096 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:27:56,099 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:27:56,101 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:27:56,103 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:27:56,103 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:27:56,104 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:27:56,105 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:27:56,105 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:27:56,106 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:27:56,108 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:27:56,108 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:27:56,109 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:27:56,111 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:27:56,113 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:27:56,114 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:27:56,116 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:27:56,117 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:27:56,119 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:27:56,120 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:27:56,120 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:27:56,121 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:27:56,122 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:27:56,123 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:27:56,123 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:27:56,124 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:27:56,125 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:27:56,125 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:27:56,126 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:27:56,126 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:27:56,127 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:27:56,127 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:27:56,128 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-09-30 10:27:56,142 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:27:56,143 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:27:56,144 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:27:56,144 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:27:56,144 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:27:56,145 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:27:56,145 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:27:56,145 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:27:56,145 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:27:56,145 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:27:56,146 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:27:56,146 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:27:56,146 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:27:56,146 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:27:56,146 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:27:56,147 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:27:56,147 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:27:56,147 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:27:56,147 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:27:56,147 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:27:56,148 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:27:56,148 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:27:56,148 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:27:56,148 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:27:56,148 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:27:56,149 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:27:56,149 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:27:56,149 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:27:56,149 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:27:56,149 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:27:56,191 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:27:56,204 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:27:56,207 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:27:56,209 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:27:56,209 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:27:56,210 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-09-30 10:27:56,211 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-09-30 10:27:56,307 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:27:56,311 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:27:56,312 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:27:56,313 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:27:56,313 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:27:56,333 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 30.09 10:27:56" (1/1) ... [2018-09-30 10:27:56,355 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 30.09 10:27:56" (1/1) ... [2018-09-30 10:27:56,368 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:27:56,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:27:56,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:27:56,369 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:27:56,381 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 30.09 10:27:56" (1/1) ... [2018-09-30 10:27:56,381 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 30.09 10:27:56" (1/1) ... [2018-09-30 10:27:56,394 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 30.09 10:27:56" (1/1) ... [2018-09-30 10:27:56,394 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 30.09 10:27:56" (1/1) ... [2018-09-30 10:27:56,414 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 30.09 10:27:56" (1/1) ... [2018-09-30 10:27:56,419 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 30.09 10:27:56" (1/1) ... [2018-09-30 10:27:56,422 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 30.09 10:27:56" (1/1) ... [2018-09-30 10:27:56,426 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:27:56,427 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:27:56,427 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:27:56,428 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:27:56,428 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 30.09 10:27:56" (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-09-30 10:27:56,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 10:27:56,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 10:27:57,295 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 10:27:57,296 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 30.09 10:27:57 BoogieIcfgContainer [2018-09-30 10:27:57,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:27:57,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:27:57,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:27:57,300 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:27:57,300 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 30.09 10:27:56" (1/2) ... [2018-09-30 10:27:57,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@544d7365 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 30.09 10:27:57, skipping insertion in model container [2018-09-30 10:27:57,302 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 30.09 10:27:57" (2/2) ... [2018-09-30 10:27:57,303 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_12.bpl [2018-09-30 10:27:57,313 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:27:57,321 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 10:27:57,363 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:27:57,364 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:27:57,364 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:27:57,364 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:27:57,364 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:27:57,364 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:27:57,365 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:27:57,365 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:27:57,365 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:27:57,380 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-09-30 10:27:57,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:27:57,387 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:57,388 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:27:57,389 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:57,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:57,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-09-30 10:27:57,398 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:57,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:57,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:57,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:57,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:57,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:57,661 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:57,661 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:27:57,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:57,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:57,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:57,683 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-09-30 10:27:57,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:57,756 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-09-30 10:27:57,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:57,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-30 10:27:57,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:57,772 INFO L225 Difference]: With dead ends: 57 [2018-09-30 10:27:57,772 INFO L226 Difference]: Without dead ends: 37 [2018-09-30 10:27:57,779 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-09-30 10:27:57,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-30 10:27:57,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-09-30 10:27:57,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-30 10:27:57,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-09-30 10:27:57,828 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-09-30 10:27:57,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:57,829 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-09-30 10:27:57,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:57,829 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-09-30 10:27:57,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:27:57,830 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:57,830 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:27:57,830 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:57,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:57,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-09-30 10:27:57,831 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:57,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:57,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:57,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:57,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:57,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:57,993 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:57,993 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:27:57,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:57,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:57,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:57,996 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-09-30 10:27:58,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:58,025 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-09-30 10:27:58,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:58,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-30 10:27:58,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:58,027 INFO L225 Difference]: With dead ends: 103 [2018-09-30 10:27:58,027 INFO L226 Difference]: Without dead ends: 69 [2018-09-30 10:27:58,029 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-09-30 10:27:58,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-30 10:27:58,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-09-30 10:27:58,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-30 10:27:58,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-09-30 10:27:58,048 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-09-30 10:27:58,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:58,049 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-09-30 10:27:58,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:58,049 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-09-30 10:27:58,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:27:58,050 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:58,050 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:27:58,050 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:58,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:58,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-09-30 10:27:58,051 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:58,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:58,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:58,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:58,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:58,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:58,167 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:58,167 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:27:58,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:58,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:58,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:58,169 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 3 states. [2018-09-30 10:27:58,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:58,248 INFO L93 Difference]: Finished difference Result 199 states and 280 transitions. [2018-09-30 10:27:58,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:58,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-30 10:27:58,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:58,258 INFO L225 Difference]: With dead ends: 199 [2018-09-30 10:27:58,258 INFO L226 Difference]: Without dead ends: 133 [2018-09-30 10:27:58,259 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-09-30 10:27:58,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-09-30 10:27:58,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-09-30 10:27:58,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-30 10:27:58,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 182 transitions. [2018-09-30 10:27:58,315 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 182 transitions. Word has length 18 [2018-09-30 10:27:58,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:58,316 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 182 transitions. [2018-09-30 10:27:58,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:58,316 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 182 transitions. [2018-09-30 10:27:58,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:27:58,317 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:58,317 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:27:58,317 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:58,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:58,318 INFO L82 PathProgramCache]: Analyzing trace with hash 823143127, now seen corresponding path program 1 times [2018-09-30 10:27:58,318 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:58,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:58,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:58,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:58,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:58,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:58,476 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:58,476 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:27:58,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:27:58,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:27:58,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 10:27:58,478 INFO L87 Difference]: Start difference. First operand 131 states and 182 transitions. Second operand 4 states. [2018-09-30 10:27:58,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:58,688 INFO L93 Difference]: Finished difference Result 277 states and 379 transitions. [2018-09-30 10:27:58,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:27:58,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-09-30 10:27:58,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:58,700 INFO L225 Difference]: With dead ends: 277 [2018-09-30 10:27:58,700 INFO L226 Difference]: Without dead ends: 275 [2018-09-30 10:27:58,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-30 10:27:58,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-09-30 10:27:58,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 147. [2018-09-30 10:27:58,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-30 10:27:58,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 198 transitions. [2018-09-30 10:27:58,767 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 198 transitions. Word has length 18 [2018-09-30 10:27:58,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:58,770 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 198 transitions. [2018-09-30 10:27:58,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:27:58,770 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 198 transitions. [2018-09-30 10:27:58,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:27:58,771 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:58,771 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:27:58,771 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:58,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:58,772 INFO L82 PathProgramCache]: Analyzing trace with hash 823202709, now seen corresponding path program 1 times [2018-09-30 10:27:58,772 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:58,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:58,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:58,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:58,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:58,876 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:58,876 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:27:58,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:58,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:58,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:58,878 INFO L87 Difference]: Start difference. First operand 147 states and 198 transitions. Second operand 3 states. [2018-09-30 10:27:58,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:58,966 INFO L93 Difference]: Finished difference Result 359 states and 485 transitions. [2018-09-30 10:27:58,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:58,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-30 10:27:58,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:58,972 INFO L225 Difference]: With dead ends: 359 [2018-09-30 10:27:58,972 INFO L226 Difference]: Without dead ends: 213 [2018-09-30 10:27:58,974 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-09-30 10:27:58,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-09-30 10:27:59,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-09-30 10:27:59,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-30 10:27:59,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-09-30 10:27:59,036 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 18 [2018-09-30 10:27:59,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:59,036 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-09-30 10:27:59,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:59,037 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-09-30 10:27:59,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 10:27:59,038 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:59,038 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-09-30 10:27:59,039 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:59,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:59,039 INFO L82 PathProgramCache]: Analyzing trace with hash 748385901, now seen corresponding path program 1 times [2018-09-30 10:27:59,039 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:59,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:59,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:59,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:59,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:59,232 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:59,233 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:59,233 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:27:59,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:59,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:59,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:59,236 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-09-30 10:27:59,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:59,363 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-09-30 10:27:59,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:59,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-30 10:27:59,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:59,369 INFO L225 Difference]: With dead ends: 633 [2018-09-30 10:27:59,369 INFO L226 Difference]: Without dead ends: 423 [2018-09-30 10:27:59,371 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-09-30 10:27:59,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-09-30 10:27:59,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-09-30 10:27:59,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-09-30 10:27:59,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-09-30 10:27:59,444 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-09-30 10:27:59,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:59,444 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-09-30 10:27:59,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:59,446 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-09-30 10:27:59,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 10:27:59,450 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:59,450 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-09-30 10:27:59,452 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:59,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:59,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1759503151, now seen corresponding path program 1 times [2018-09-30 10:27:59,453 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:59,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:59,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:59,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:59,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:59,557 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:59,558 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:59,558 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:27:59,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:59,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:59,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:59,559 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-09-30 10:27:59,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:59,742 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-09-30 10:27:59,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:59,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-30 10:27:59,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:59,747 INFO L225 Difference]: With dead ends: 1257 [2018-09-30 10:27:59,748 INFO L226 Difference]: Without dead ends: 839 [2018-09-30 10:27:59,749 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-09-30 10:27:59,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-09-30 10:27:59,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-09-30 10:27:59,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-09-30 10:27:59,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-09-30 10:27:59,874 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-09-30 10:27:59,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:59,874 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-09-30 10:27:59,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:59,874 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-09-30 10:27:59,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 10:27:59,877 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:59,878 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-09-30 10:27:59,878 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:59,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:59,878 INFO L82 PathProgramCache]: Analyzing trace with hash -2142437135, now seen corresponding path program 1 times [2018-09-30 10:27:59,878 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:59,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:59,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:59,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:59,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:00,028 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:28:00,029 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:00,029 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:28:00,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:00,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:00,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:00,030 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-09-30 10:28:00,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:00,367 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-09-30 10:28:00,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:00,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-30 10:28:00,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:00,377 INFO L225 Difference]: With dead ends: 2505 [2018-09-30 10:28:00,377 INFO L226 Difference]: Without dead ends: 1671 [2018-09-30 10:28:00,380 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-09-30 10:28:00,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-09-30 10:28:00,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-09-30 10:28:00,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-09-30 10:28:00,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-09-30 10:28:00,633 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-09-30 10:28:00,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:00,634 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-09-30 10:28:00,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:00,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-09-30 10:28:00,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 10:28:00,637 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:00,637 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-09-30 10:28:00,637 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:00,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:00,639 INFO L82 PathProgramCache]: Analyzing trace with hash 2095271859, now seen corresponding path program 1 times [2018-09-30 10:28:00,639 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:00,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:00,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:00,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:00,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:00,919 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 10:28:00,920 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:28:00,920 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-09-30 10:28:00,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:01,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:28:01,573 WARN L178 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-09-30 10:28:01,893 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:28:01,925 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:28:01,926 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2018-09-30 10:28:01,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:28:01,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:28:01,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:28:01,927 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-09-30 10:28:03,050 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-30 10:28:03,411 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-30 10:28:05,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:05,069 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-09-30 10:28:05,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 10:28:05,069 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-09-30 10:28:05,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:05,085 INFO L225 Difference]: With dead ends: 4801 [2018-09-30 10:28:05,085 INFO L226 Difference]: Without dead ends: 3135 [2018-09-30 10:28:05,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2018-09-30 10:28:05,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-09-30 10:28:05,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-09-30 10:28:05,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-09-30 10:28:05,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-09-30 10:28:05,498 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-09-30 10:28:05,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:05,498 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-09-30 10:28:05,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:28:05,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-09-30 10:28:05,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-30 10:28:05,503 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:05,503 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-09-30 10:28:05,503 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:05,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:05,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1417215583, now seen corresponding path program 2 times [2018-09-30 10:28:05,504 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:05,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:05,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:05,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:05,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:05,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:05,665 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-30 10:28:05,665 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:05,665 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:28:05,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:05,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:05,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:05,666 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-09-30 10:28:06,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:06,232 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-09-30 10:28:06,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:06,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-30 10:28:06,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:06,244 INFO L225 Difference]: With dead ends: 4873 [2018-09-30 10:28:06,244 INFO L226 Difference]: Without dead ends: 2215 [2018-09-30 10:28:06,247 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-09-30 10:28:06,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-09-30 10:28:06,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-09-30 10:28:06,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-09-30 10:28:06,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-09-30 10:28:06,595 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-09-30 10:28:06,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:06,595 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-09-30 10:28:06,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:06,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-09-30 10:28:06,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-30 10:28:06,598 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:06,598 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-09-30 10:28:06,599 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:06,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:06,599 INFO L82 PathProgramCache]: Analyzing trace with hash 79784675, now seen corresponding path program 3 times [2018-09-30 10:28:06,599 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:06,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:06,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:06,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:28:06,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:06,681 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-09-30 10:28:06,682 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:06,682 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:28:06,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:06,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:06,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:06,683 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-09-30 10:28:06,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:06,712 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-09-30 10:28:06,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:06,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-30 10:28:06,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:06,712 INFO L225 Difference]: With dead ends: 1799 [2018-09-30 10:28:06,712 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 10:28:06,716 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-09-30 10:28:06,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 10:28:06,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 10:28:06,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 10:28:06,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 10:28:06,717 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-09-30 10:28:06,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:06,718 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 10:28:06,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:06,718 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 10:28:06,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 10:28:06,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 10:28:06,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:06,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,150 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 43 [2018-09-30 10:28:07,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:07,842 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 43 [2018-09-30 10:28:08,502 WARN L178 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-09-30 10:28:09,761 WARN L178 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-09-30 10:28:10,249 WARN L178 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-09-30 10:28:10,417 WARN L178 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-09-30 10:28:10,537 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-09-30 10:28:11,216 WARN L178 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2018-09-30 10:28:11,398 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-09-30 10:28:11,566 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-09-30 10:28:12,060 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2018-09-30 10:28:12,064 INFO L422 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-09-30 10:28:12,065 INFO L422 ceAbstractionStarter]: At program point L535(lines 535 542) the Hoare annotation is: false [2018-09-30 10:28:12,065 INFO L422 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-09-30 10:28:12,065 INFO L422 ceAbstractionStarter]: At program point L519(lines 514 520) the Hoare annotation is: (and (<= 1 ULTIMATE.start_check_~tmp~156) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse0 ~p2_old))))) [2018-09-30 10:28:12,065 INFO L422 ceAbstractionStarter]: At program point L387(lines 382 388) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= (+ ~nomsg 1) 0))) (or (and (= ~mode2 (* 256 (div ~mode2 256))) (and (<= ~r1 0) (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= 0 ~r1))) (and (<= 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-09-30 10:28:12,066 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 544) no Hoare annotation was computed. [2018-09-30 10:28:12,066 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 544) no Hoare annotation was computed. [2018-09-30 10:28:12,066 INFO L422 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-09-30 10:28:12,067 INFO L422 ceAbstractionStarter]: At program point L392(lines 392 402) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= (+ ~nomsg 1) 0))) (or (and (= ~mode2 (* 256 (div ~mode2 256))) (and (<= ~r1 0) (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= 0 ~r1))) (and (<= 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-09-30 10:28:12,067 INFO L422 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-09-30 10:28:12,067 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 544) no Hoare annotation was computed. [2018-09-30 10:28:12,068 INFO L422 ceAbstractionStarter]: At program point L541(lines 365 541) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= (+ ~nomsg 1) 0))) (or (and (<= ~r1 0) (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= 0 ~r1)) (and (<= 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-09-30 10:28:12,068 INFO L422 ceAbstractionStarter]: At program point L508(lines 508 515) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (<= ~r1 1) (<= ~send2 127) (<= 0 ~send2) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse0 ~p2_old))))) [2018-09-30 10:28:12,068 INFO L422 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-09-30 10:28:12,069 INFO L422 ceAbstractionStarter]: At program point L372(lines 372 383) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= (+ ~nomsg 1) 0))) (or (and (<= ~r1 0) (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= 0 ~r1)) (and (<= 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-09-30 10:28:12,069 INFO L422 ceAbstractionStarter]: At program point L529(lines 529 536) the Hoare annotation is: (and (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~156) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (= (+ ~nomsg 1) 0) (<= ~mode3 1) (<= 1 ~mode3) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse0 ~p2_old))))) [2018-09-30 10:28:12,069 INFO L422 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-09-30 10:28:12,069 INFO L422 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-09-30 10:28:12,069 INFO L422 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-09-30 10:28:12,070 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 543) no Hoare annotation was computed. [2018-09-30 10:28:12,070 INFO L422 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-09-30 10:28:12,077 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,078 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,078 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,078 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,084 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,085 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,085 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,085 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,088 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,088 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,088 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,088 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,091 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,091 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,091 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,092 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,093 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,093 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,094 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,094 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,095 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,096 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,096 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,096 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,098 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,098 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,098 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,099 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,100 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,100 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,100 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,101 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,102 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,102 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,102 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,103 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,104 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,104 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,105 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,105 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,108 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,109 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,109 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,109 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,109 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,110 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,110 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,110 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,116 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,116 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,116 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,117 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,117 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,117 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,117 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,121 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,124 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,125 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,125 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,125 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,126 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,126 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,127 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,127 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,131 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,131 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,131 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,132 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,132 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,133 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,133 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,133 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,134 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,134 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,135 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,135 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,136 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,136 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,141 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,141 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,142 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,143 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,143 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,143 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,146 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,146 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,147 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,147 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,147 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,148 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,148 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,148 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,151 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,152 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,152 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,152 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,153 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,153 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,153 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,155 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,156 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,156 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,156 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,157 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,157 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,157 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,158 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,158 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,161 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,161 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,161 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,162 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,162 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,162 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,163 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,163 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,169 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,169 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,169 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,169 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,170 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,170 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,170 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,171 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,171 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,174 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,175 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,175 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,176 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,176 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,176 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,177 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,177 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,177 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,180 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,181 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,182 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,182 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,182 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,182 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,183 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,183 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,183 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,184 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,188 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 30.09 10:28:12 BoogieIcfgContainer [2018-09-30 10:28:12,188 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:28:12,190 INFO L168 Benchmark]: Toolchain (without parser) took 15881.92 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 192.4 MB). Free memory was 1.5 GB in the beginning and 971.9 MB in the end (delta: 505.2 MB). Peak memory consumption was 697.6 MB. Max. memory is 7.1 GB. [2018-09-30 10:28:12,191 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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-09-30 10:28:12,192 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.01 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-09-30 10:28:12,192 INFO L168 Benchmark]: Boogie Preprocessor took 57.83 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-09-30 10:28:12,193 INFO L168 Benchmark]: RCFGBuilder took 868.77 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-09-30 10:28:12,196 INFO L168 Benchmark]: TraceAbstraction took 14891.21 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 192.4 MB). Free memory was 1.4 GB in the beginning and 971.9 MB in the end (delta: 463.0 MB). Peak memory consumption was 655.4 MB. Max. memory is 7.1 GB. [2018-09-30 10:28:12,200 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.20 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 56.01 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 57.83 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 868.77 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 14891.21 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 192.4 MB). Free memory was 1.4 GB in the beginning and 971.9 MB in the end (delta: 463.0 MB). Peak memory consumption was 655.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 543]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 424]: Loop Invariant [2018-09-30 10:28:12,217 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,217 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,217 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,217 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,218 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,218 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,218 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,218 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= ~mode2 && ~mode2 <= 1) && ~r1 <= 1) && ~send2 <= 127) && 0 <= ~send2) && (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-09-30 10:28:12,219 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,219 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,219 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,220 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,220 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,220 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,221 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,221 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (~mode2 == 256 * (~mode2 / 256) && (((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && 0 <= ~r1) || (((((((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-09-30 10:28:12,221 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,222 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,222 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,222 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,223 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,223 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,223 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,223 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= ~mode2 && ~mode2 <= 1) && ~r1 <= 1) && ~send2 <= 127) && 0 <= ~send2) && (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-09-30 10:28:12,224 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,224 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,224 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,225 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,225 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,225 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,225 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,226 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= ~mode2 && ~mode2 <= 1) && ~r1 <= 1) && ~send2 <= 127) && 0 <= ~send2) && (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-09-30 10:28:12,226 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,226 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,227 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,227 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,227 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,227 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,228 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,228 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= ~mode2 && ~mode2 <= 1) && ~r1 <= 1) && ~send2 <= 127) && 0 <= ~send2) && (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-09-30 10:28:12,229 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,229 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,229 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,229 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,229 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,230 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,230 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,230 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,231 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,231 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,231 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,231 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,231 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,232 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,232 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,232 WARN L389 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-09-30 10:28:12,233 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,233 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,233 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,233 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,234 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,234 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,234 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,234 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && ~nomsg + 1 == 0) && 0 <= ~r1) || (((((((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-09-30 10:28:12,235 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,235 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,235 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,235 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,236 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,236 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,236 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,236 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= ~mode2 && ~mode2 <= 1) && ~r1 <= 1) && ~send2 <= 127) && 0 <= ~send2) && (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-09-30 10:28:12,237 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,237 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,238 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,238 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,238 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,238 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,239 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,239 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (~mode2 == 256 * (~mode2 / 256) && (((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && 0 <= ~r1) || (((((((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-09-30 10:28:12,239 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,240 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,240 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,240 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,241 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,241 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,241 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,241 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && ~nomsg + 1 == 0) && 0 <= ~r1) || (((((((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-09-30 10:28:12,242 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,242 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,242 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,242 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,243 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,243 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,243 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,243 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= ~mode2 && ~mode2 <= 1) && ~r1 <= 1) && ~send2 <= 127) && 0 <= ~send2) && (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-09-30 10:28:12,244 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,244 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,244 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,244 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,245 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,245 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,245 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,246 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= check_~tmp~156 && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old) - InvariantResult [Line: 508]: Loop Invariant [2018-09-30 10:28:12,246 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,246 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,246 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,247 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,247 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,247 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,247 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,248 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= ~mode2 && ~mode2 <= 1) && ~r1 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old) - InvariantResult [Line: 529]: Loop Invariant [2018-09-30 10:28:12,248 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,248 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,249 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,249 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,249 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,249 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,250 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,250 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((assert_~arg == 1 && 1 <= check_~tmp~156) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~nomsg + 1 == 0) && ~mode3 <= 1) && 1 <= ~mode3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old) - InvariantResult [Line: 475]: Loop Invariant [2018-09-30 10:28:12,250 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,250 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,251 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,251 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,251 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,251 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,252 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,252 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= ~mode2 && ~mode2 <= 1) && ~r1 <= 1) && ~send2 <= 127) && 0 <= ~send2) && (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-09-30 10:28:12,252 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,253 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,253 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,253 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,253 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,253 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,254 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,254 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,254 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,255 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,255 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,255 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,255 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,255 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,256 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:28:12,256 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((~send2 <= 127 && 0 <= ~send2) && ~nomsg + 1 == 0) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old)) && ~mode3 <= 1) && 1 <= ~mode3) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~r1 <= 1) && ~send2 <= 127) && 0 <= ~send2) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~nomsg + 1 == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. SAFE Result, 14.7s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 5.0s AutomataDifference, 0.0s DeadEndRemovalTime, 5.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 370 SDtfs, 335 SDslu, 296 SDs, 0 SdLazy, 187 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 2.4s 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.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 1592 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 581 NumberOfFragments, 966 HoareAnnotationTreeSize, 17 FomulaSimplifications, 82925 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 17 FomulaSimplificationsInter, 630 FormulaSimplificationTreeSizeReductionInter, 4.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s 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-09-30_10-28-12-262.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-09-30_10-28-12-262.csv Received shutdown request...