java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 12:16:11,839 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 12:16:11,841 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 12:16:11,853 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 12:16:11,853 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 12:16:11,855 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 12:16:11,856 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 12:16:11,857 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 12:16:11,859 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 12:16:11,860 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 12:16:11,861 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 12:16:11,861 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 12:16:11,862 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 12:16:11,863 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 12:16:11,864 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 12:16:11,865 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 12:16:11,866 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 12:16:11,867 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 12:16:11,869 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 12:16:11,871 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 12:16:11,872 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 12:16:11,873 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 12:16:11,876 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 12:16:11,876 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 12:16:11,876 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 12:16:11,877 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 12:16:11,878 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 12:16:11,879 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 12:16:11,880 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 12:16:11,881 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 12:16:11,881 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 12:16:11,882 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 12:16:11,882 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 12:16:11,882 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 12:16:11,883 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 12:16:11,884 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 12:16:11,884 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-02 12:16:11,906 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 12:16:11,907 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 12:16:11,908 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 12:16:11,908 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 12:16:11,909 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 12:16:11,909 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 12:16:11,909 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 12:16:11,909 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 12:16:11,910 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 12:16:11,911 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 12:16:11,911 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 12:16:11,911 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 12:16:11,911 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 12:16:11,911 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 12:16:11,912 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 12:16:11,912 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 12:16:11,912 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 12:16:11,912 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 12:16:11,913 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 12:16:11,913 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 12:16:11,913 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 12:16:11,913 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 12:16:11,914 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 12:16:11,914 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 12:16:11,914 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 12:16:11,914 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 12:16:11,915 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 12:16:11,915 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 12:16:11,915 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 12:16:11,915 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 12:16:11,915 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-02 12:16:11,965 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 12:16:11,980 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 12:16:11,984 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 12:16:11,987 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 12:16:11,987 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 12:16:11,988 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl [2018-10-02 12:16:11,988 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl' [2018-10-02 12:16:12,095 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 12:16:12,099 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 12:16:12,100 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 12:16:12,100 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 12:16:12,100 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 12:16:12,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:12" (1/1) ... [2018-10-02 12:16:12,148 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:12" (1/1) ... [2018-10-02 12:16:12,157 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 12:16:12,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 12:16:12,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 12:16:12,158 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 12:16:12,169 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:12" (1/1) ... [2018-10-02 12:16:12,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:12" (1/1) ... [2018-10-02 12:16:12,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:12" (1/1) ... [2018-10-02 12:16:12,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:12" (1/1) ... [2018-10-02 12:16:12,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:12" (1/1) ... [2018-10-02 12:16:12,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:12" (1/1) ... [2018-10-02 12:16:12,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:12" (1/1) ... [2018-10-02 12:16:12,213 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 12:16:12,214 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 12:16:12,214 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 12:16:12,214 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 12:16:12,215 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 12:16:12,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 12:16:12,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 12:16:12,938 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 12:16:12,939 INFO L202 PluginConnector]: Adding new model pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:16:12 BoogieIcfgContainer [2018-10-02 12:16:12,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 12:16:12,940 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 12:16:12,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 12:16:12,943 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 12:16:12,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:12" (1/2) ... [2018-10-02 12:16:12,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@515babf1 and model type pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:16:12, skipping insertion in model container [2018-10-02 12:16:12,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:16:12" (2/2) ... [2018-10-02 12:16:12,947 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl [2018-10-02 12:16:12,957 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 12:16:12,965 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 12:16:13,016 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 12:16:13,017 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 12:16:13,017 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 12:16:13,017 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 12:16:13,018 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 12:16:13,018 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 12:16:13,018 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 12:16:13,018 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 12:16:13,018 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 12:16:13,035 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-10-02 12:16:13,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-02 12:16:13,042 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:13,043 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:13,044 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:13,050 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:13,051 INFO L82 PathProgramCache]: Analyzing trace with hash -61215035, now seen corresponding path program 1 times [2018-10-02 12:16:13,053 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:13,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:13,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:13,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:13,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:13,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:16:13,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:13,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:16:13,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:13,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:13,361 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:13,363 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2018-10-02 12:16:13,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:13,461 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2018-10-02 12:16:13,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:13,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-02 12:16:13,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:13,476 INFO L225 Difference]: With dead ends: 54 [2018-10-02 12:16:13,476 INFO L226 Difference]: Without dead ends: 35 [2018-10-02 12:16:13,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:16:13,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-02 12:16:13,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-10-02 12:16:13,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-02 12:16:13,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2018-10-02 12:16:13,521 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 17 [2018-10-02 12:16:13,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:13,522 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2018-10-02 12:16:13,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:13,522 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2018-10-02 12:16:13,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-02 12:16:13,523 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:13,523 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:13,523 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:13,524 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:13,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1341078713, now seen corresponding path program 1 times [2018-10-02 12:16:13,524 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:13,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:13,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:13,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:13,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:13,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:16:13,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:13,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:16:13,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:13,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:13,624 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:13,624 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand 3 states. [2018-10-02 12:16:13,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:13,676 INFO L93 Difference]: Finished difference Result 97 states and 139 transitions. [2018-10-02 12:16:13,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:13,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-02 12:16:13,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:13,678 INFO L225 Difference]: With dead ends: 97 [2018-10-02 12:16:13,678 INFO L226 Difference]: Without dead ends: 65 [2018-10-02 12:16:13,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:16:13,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-02 12:16:13,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-10-02 12:16:13,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-02 12:16:13,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2018-10-02 12:16:13,698 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 17 [2018-10-02 12:16:13,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:13,698 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2018-10-02 12:16:13,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:13,699 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2018-10-02 12:16:13,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-02 12:16:13,699 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:13,699 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:13,700 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:13,700 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:13,700 INFO L82 PathProgramCache]: Analyzing trace with hash -754272699, now seen corresponding path program 1 times [2018-10-02 12:16:13,700 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:13,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:13,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:13,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:13,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:13,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:16:13,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:13,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:16:13,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:13,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:13,846 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:13,846 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand 3 states. [2018-10-02 12:16:14,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:14,001 INFO L93 Difference]: Finished difference Result 187 states and 268 transitions. [2018-10-02 12:16:14,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:14,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-02 12:16:14,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:14,006 INFO L225 Difference]: With dead ends: 187 [2018-10-02 12:16:14,006 INFO L226 Difference]: Without dead ends: 125 [2018-10-02 12:16:14,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:16:14,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-02 12:16:14,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-10-02 12:16:14,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-02 12:16:14,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 174 transitions. [2018-10-02 12:16:14,044 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 174 transitions. Word has length 17 [2018-10-02 12:16:14,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:14,044 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 174 transitions. [2018-10-02 12:16:14,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:14,044 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 174 transitions. [2018-10-02 12:16:14,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-02 12:16:14,045 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:14,045 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:14,047 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:14,047 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:14,047 INFO L82 PathProgramCache]: Analyzing trace with hash -53208121, now seen corresponding path program 1 times [2018-10-02 12:16:14,048 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:14,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:14,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:14,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:14,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:14,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:16:14,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:14,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:16:14,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:14,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:14,149 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:14,149 INFO L87 Difference]: Start difference. First operand 123 states and 174 transitions. Second operand 3 states. [2018-10-02 12:16:14,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:14,243 INFO L93 Difference]: Finished difference Result 367 states and 520 transitions. [2018-10-02 12:16:14,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:14,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-02 12:16:14,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:14,247 INFO L225 Difference]: With dead ends: 367 [2018-10-02 12:16:14,247 INFO L226 Difference]: Without dead ends: 245 [2018-10-02 12:16:14,249 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:16:14,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-02 12:16:14,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-10-02 12:16:14,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-02 12:16:14,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 338 transitions. [2018-10-02 12:16:14,305 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 338 transitions. Word has length 17 [2018-10-02 12:16:14,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:14,305 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 338 transitions. [2018-10-02 12:16:14,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:14,306 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 338 transitions. [2018-10-02 12:16:14,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-02 12:16:14,306 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:14,307 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:14,307 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:14,307 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:14,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1721799241, now seen corresponding path program 1 times [2018-10-02 12:16:14,308 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:14,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:14,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:14,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:14,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:14,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:16:14,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:14,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 12:16:14,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 12:16:14,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 12:16:14,445 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:14,445 INFO L87 Difference]: Start difference. First operand 243 states and 338 transitions. Second operand 4 states. [2018-10-02 12:16:15,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:15,165 INFO L93 Difference]: Finished difference Result 517 states and 707 transitions. [2018-10-02 12:16:15,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 12:16:15,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-10-02 12:16:15,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:15,172 INFO L225 Difference]: With dead ends: 517 [2018-10-02 12:16:15,172 INFO L226 Difference]: Without dead ends: 515 [2018-10-02 12:16:15,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:16:15,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-10-02 12:16:15,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 275. [2018-10-02 12:16:15,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-02 12:16:15,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 370 transitions. [2018-10-02 12:16:15,269 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 370 transitions. Word has length 17 [2018-10-02 12:16:15,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:15,270 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 370 transitions. [2018-10-02 12:16:15,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 12:16:15,270 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 370 transitions. [2018-10-02 12:16:15,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-02 12:16:15,271 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:15,271 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:15,271 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:15,272 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:15,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1721858823, now seen corresponding path program 1 times [2018-10-02 12:16:15,272 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:15,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:15,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:15,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:15,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:15,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:16:15,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:15,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:15,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 12:16:15,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 12:16:15,416 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:15,416 INFO L87 Difference]: Start difference. First operand 275 states and 370 transitions. Second operand 4 states. [2018-10-02 12:16:16,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:16,159 INFO L93 Difference]: Finished difference Result 879 states and 1193 transitions. [2018-10-02 12:16:16,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 12:16:16,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-10-02 12:16:16,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:16,165 INFO L225 Difference]: With dead ends: 879 [2018-10-02 12:16:16,165 INFO L226 Difference]: Without dead ends: 605 [2018-10-02 12:16:16,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:16:16,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-10-02 12:16:16,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2018-10-02 12:16:16,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2018-10-02 12:16:16,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 776 transitions. [2018-10-02 12:16:16,276 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 776 transitions. Word has length 17 [2018-10-02 12:16:16,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:16,276 INFO L480 AbstractCegarLoop]: Abstraction has 605 states and 776 transitions. [2018-10-02 12:16:16,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 12:16:16,277 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 776 transitions. [2018-10-02 12:16:16,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-02 12:16:16,282 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:16,283 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-02 12:16:16,283 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:16,283 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:16,283 INFO L82 PathProgramCache]: Analyzing trace with hash 868944887, now seen corresponding path program 1 times [2018-10-02 12:16:16,284 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:16,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:16,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:16,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:16,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:16,434 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-02 12:16:16,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:16,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:16,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:16,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:16,436 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:16,436 INFO L87 Difference]: Start difference. First operand 605 states and 776 transitions. Second operand 3 states. [2018-10-02 12:16:16,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:16,920 INFO L93 Difference]: Finished difference Result 1809 states and 2322 transitions. [2018-10-02 12:16:16,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:16,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-10-02 12:16:16,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:16,927 INFO L225 Difference]: With dead ends: 1809 [2018-10-02 12:16:16,927 INFO L226 Difference]: Without dead ends: 1207 [2018-10-02 12:16:16,929 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:16:16,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2018-10-02 12:16:17,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1205. [2018-10-02 12:16:17,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-10-02 12:16:17,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1508 transitions. [2018-10-02 12:16:17,146 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1508 transitions. Word has length 62 [2018-10-02 12:16:17,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:17,146 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1508 transitions. [2018-10-02 12:16:17,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:17,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1508 transitions. [2018-10-02 12:16:17,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-02 12:16:17,152 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:17,152 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-02 12:16:17,153 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:17,153 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:17,153 INFO L82 PathProgramCache]: Analyzing trace with hash 2034253683, now seen corresponding path program 1 times [2018-10-02 12:16:17,153 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:17,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:17,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:17,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:17,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:17,603 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 53 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-02 12:16:17,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:16:17,604 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:16:17,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:17,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:16:18,773 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-02 12:16:18,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:16:18,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-10-02 12:16:18,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:16:18,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:16:18,808 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:18,808 INFO L87 Difference]: Start difference. First operand 1205 states and 1508 transitions. Second operand 8 states. [2018-10-02 12:16:24,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:24,878 INFO L93 Difference]: Finished difference Result 2024 states and 2520 transitions. [2018-10-02 12:16:24,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-02 12:16:24,882 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2018-10-02 12:16:24,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:24,887 INFO L225 Difference]: With dead ends: 2024 [2018-10-02 12:16:24,888 INFO L226 Difference]: Without dead ends: 565 [2018-10-02 12:16:24,890 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time 1.2s impTime [2018-10-02 12:16:24,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-10-02 12:16:25,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 378. [2018-10-02 12:16:25,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-10-02 12:16:25,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 442 transitions. [2018-10-02 12:16:25,049 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 442 transitions. Word has length 62 [2018-10-02 12:16:25,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:25,049 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 442 transitions. [2018-10-02 12:16:25,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:16:25,049 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 442 transitions. [2018-10-02 12:16:25,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-02 12:16:25,051 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:25,051 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-02 12:16:25,051 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:25,053 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:25,053 INFO L82 PathProgramCache]: Analyzing trace with hash -552343681, now seen corresponding path program 2 times [2018-10-02 12:16:25,053 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:25,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:25,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:25,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:25,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:25,133 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-10-02 12:16:25,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:25,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:16:25,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:25,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:25,135 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:25,135 INFO L87 Difference]: Start difference. First operand 378 states and 442 transitions. Second operand 3 states. [2018-10-02 12:16:25,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:25,146 INFO L93 Difference]: Finished difference Result 384 states and 448 transitions. [2018-10-02 12:16:25,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:25,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-10-02 12:16:25,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:25,147 INFO L225 Difference]: With dead ends: 384 [2018-10-02 12:16:25,147 INFO L226 Difference]: Without dead ends: 0 [2018-10-02 12:16:25,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:16:25,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-02 12:16:25,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-02 12:16:25,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-02 12:16:25,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-02 12:16:25,148 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2018-10-02 12:16:25,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:25,149 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-02 12:16:25,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:25,149 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-02 12:16:25,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-02 12:16:25,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-02 12:16:25,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:25,637 WARN L178 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 138 [2018-10-02 12:16:25,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:25,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:25,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:26,156 WARN L178 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 138 [2018-10-02 12:16:27,827 WARN L178 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2018-10-02 12:16:28,632 WARN L178 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 55 [2018-10-02 12:16:29,268 WARN L178 SmtUtils]: Spent 634.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 52 [2018-10-02 12:16:29,592 WARN L178 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 46 [2018-10-02 12:16:31,064 WARN L178 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 128 DAG size of output: 58 [2018-10-02 12:16:31,375 WARN L178 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 51 [2018-10-02 12:16:31,716 WARN L178 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2018-10-02 12:16:32,041 WARN L178 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 55 [2018-10-02 12:16:32,275 WARN L178 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 41 [2018-10-02 12:16:32,628 WARN L178 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 46 [2018-10-02 12:16:32,946 WARN L178 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 51 [2018-10-02 12:16:33,527 WARN L178 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 43 [2018-10-02 12:16:35,795 WARN L178 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 128 DAG size of output: 58 [2018-10-02 12:16:36,027 WARN L178 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 41 [2018-10-02 12:16:36,302 WARN L178 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 45 [2018-10-02 12:16:36,306 INFO L421 ceAbstractionStarter]: At program point L440(lines 272 440) the Hoare annotation is: (let ((.cse0 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse1 (<= ~send3 127)) (.cse6 (<= 1 ~mode4)) (.cse2 (<= 0 ~send5)) (.cse7 (<= ~mode4 1)) (.cse8 (not (= ~p3_old ~nomsg))) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse5 (<= ~send5 127))) (or (and .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) .cse3 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse4 .cse5) (and .cse1 .cse6 .cse2 .cse7 .cse8 .cse3 (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 256))) (and (= .cse9 ~p5_old) (<= .cse9 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse4 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse7 .cse8 .cse3 .cse4 .cse5))) [2018-10-02 12:16:36,306 INFO L421 ceAbstractionStarter]: At program point L279(lines 279 290) the Hoare annotation is: (let ((.cse0 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse1 (<= ~send3 127)) (.cse6 (<= 1 ~mode4)) (.cse2 (<= 0 ~send5)) (.cse7 (<= ~mode4 1)) (.cse8 (not (= ~p3_old ~nomsg))) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse5 (<= ~send5 127))) (or (and .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) .cse3 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse4 .cse5) (and .cse1 .cse6 .cse2 .cse7 .cse8 .cse3 (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 256))) (and (= .cse9 ~p5_old) (<= .cse9 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse4 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse7 .cse8 .cse3 .cse4 .cse5))) [2018-10-02 12:16:36,306 INFO L421 ceAbstractionStarter]: At program point L341(lines 333 342) the Hoare annotation is: (let ((.cse5 (* 256 (div ~r1 256)))) (let ((.cse8 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse9 (<= 1 ~mode4)) (.cse10 (<= ~mode4 1)) (.cse13 (exists ((v_prenex_1 Int)) (let ((.cse14 (mod v_prenex_1 256))) (and (= .cse14 ~p5_old) (<= .cse14 127) (<= v_prenex_1 127) (<= 0 v_prenex_1))))) (.cse0 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse1 (<= ~send3 127)) (.cse2 (<= 0 ~send5)) (.cse12 (<= ~r1 (+ .cse5 4))) (.cse11 (not (= ~p3_old ~nomsg))) (.cse3 (not (= ~p3_new ~nomsg))) (.cse4 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3)) (.cse7 (<= ~send5 127))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~r1 .cse5) .cse6 .cse7) (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse0 .cse8 .cse1 .cse9 .cse2 .cse10 .cse11 .cse4 .cse6 .cse7) (and .cse1 .cse2 .cse12 .cse11 .cse3 .cse4 .cse13 .cse6 .cse7) (and .cse1 .cse9 .cse8 .cse2 .cse10 .cse11 .cse4 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse11 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse9 .cse2 .cse10 .cse11 .cse3 .cse4 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse12 .cse11 .cse3 .cse4 .cse6 .cse7)))) [2018-10-02 12:16:36,306 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 81 443) no Hoare annotation was computed. [2018-10-02 12:16:36,306 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 81 443) no Hoare annotation was computed. [2018-10-02 12:16:36,307 INFO L421 ceAbstractionStarter]: At program point L346(lines 346 356) the Hoare annotation is: (let ((.cse5 (* 256 (div ~r1 256)))) (let ((.cse8 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse9 (<= 1 ~mode4)) (.cse10 (<= ~mode4 1)) (.cse13 (exists ((v_prenex_1 Int)) (let ((.cse14 (mod v_prenex_1 256))) (and (= .cse14 ~p5_old) (<= .cse14 127) (<= v_prenex_1 127) (<= 0 v_prenex_1))))) (.cse0 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse1 (<= ~send3 127)) (.cse2 (<= 0 ~send5)) (.cse12 (<= ~r1 (+ .cse5 4))) (.cse11 (not (= ~p3_old ~nomsg))) (.cse3 (not (= ~p3_new ~nomsg))) (.cse4 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3)) (.cse7 (<= ~send5 127))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~r1 .cse5) .cse6 .cse7) (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse0 .cse8 .cse1 .cse9 .cse2 .cse10 .cse11 .cse4 .cse6 .cse7) (and .cse1 .cse2 .cse12 .cse11 .cse3 .cse4 .cse13 .cse6 .cse7) (and .cse1 .cse9 .cse8 .cse2 .cse10 .cse11 .cse4 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse11 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse9 .cse2 .cse10 .cse11 .cse3 .cse4 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse12 .cse11 .cse3 .cse4 .cse6 .cse7)))) [2018-10-02 12:16:36,307 INFO L421 ceAbstractionStarter]: At program point L437(lines 437 441) the Hoare annotation is: false [2018-10-02 12:16:36,307 INFO L421 ceAbstractionStarter]: At program point L363(lines 355 364) the Hoare annotation is: (let ((.cse12 (* 256 (div ~r1 256)))) (let ((.cse7 (<= ~r1 (+ .cse12 4))) (.cse9 (not (= ~p3_old ~nomsg))) (.cse5 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse6 (<= 0 ~send5)) (.cse8 (<= ~mode4 1)) (.cse2 (not (= ~p3_new ~nomsg))) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse10 (<= ~send5 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 (exists ((v_prenex_1 Int)) (let ((.cse11 (mod v_prenex_1 256))) (and (= .cse11 ~p5_old) (<= .cse11 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse10) (and .cse5 .cse0 .cse1 .cse6 .cse8 .cse2 .cse3 (<= ~r1 .cse12) .cse4 .cse10)))) [2018-10-02 12:16:36,307 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 442) no Hoare annotation was computed. [2018-10-02 12:16:36,308 INFO L421 ceAbstractionStarter]: At program point L297(lines 289 298) the Hoare annotation is: (let ((.cse1 (<= 1 ~mode4)) (.cse3 (<= ~mode4 1)) (.cse4 (not (= ~p3_old ~nomsg))) (.cse9 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse0 (<= ~send3 127)) (.cse2 (<= 0 ~send5)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (<= 0 ~send3)) (.cse8 (<= ~send5 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_prenex_1 Int)) (let ((.cse6 (mod v_prenex_1 256))) (and (= .cse6 ~p5_old) (<= .cse6 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse7 .cse8) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse9 .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 (= ~mode2 (* 256 (div ~mode2 256))) .cse5 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse7 .cse8))) [2018-10-02 12:16:36,308 INFO L421 ceAbstractionStarter]: At program point L421(lines 416 422) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3)) (.cse4 (<= 0 ~send5)) (.cse5 (<= ~r1 (+ (* 256 (div ~r1 256)) 4))) (.cse6 (<= 1 ULTIMATE.start_check_~tmp~108)) (.cse7 (<= ~mode4 1)) (.cse8 (not (= ~p3_old ~nomsg))) (.cse10 (<= ~send5 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 256))) (and (= .cse9 ~p5_old) (<= .cse9 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ~mode5 (* 256 (div ~mode5 256))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10))) [2018-10-02 12:16:36,308 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 81 443) no Hoare annotation was computed. [2018-10-02 12:16:36,308 INFO L421 ceAbstractionStarter]: At program point L401(lines 401 407) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse2 (<= 0 ~send5)) (.cse3 (<= ~r1 (+ (* 256 (div ~r1 256)) 4))) (.cse4 (<= ~mode4 1)) (.cse5 (not (= ~p3_old ~nomsg))) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= 0 ~send3)) (.cse8 (<= ~send5 127))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 256))) (and (= .cse9 ~p5_old) (<= .cse9 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse7 .cse8))) [2018-10-02 12:16:36,309 INFO L421 ceAbstractionStarter]: At program point L368(lines 368 378) the Hoare annotation is: (let ((.cse12 (* 256 (div ~r1 256)))) (let ((.cse7 (<= ~r1 (+ .cse12 4))) (.cse9 (not (= ~p3_old ~nomsg))) (.cse5 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse6 (<= 0 ~send5)) (.cse8 (<= ~mode4 1)) (.cse2 (not (= ~p3_new ~nomsg))) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse10 (<= ~send5 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 (exists ((v_prenex_1 Int)) (let ((.cse11 (mod v_prenex_1 256))) (and (= .cse11 ~p5_old) (<= .cse11 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse10) (and .cse5 .cse0 .cse1 .cse6 .cse8 .cse2 .cse3 (<= ~r1 .cse12) .cse4 .cse10)))) [2018-10-02 12:16:36,309 INFO L421 ceAbstractionStarter]: At program point L302(lines 302 313) the Hoare annotation is: (let ((.cse1 (<= 1 ~mode4)) (.cse3 (<= ~mode4 1)) (.cse4 (not (= ~p3_old ~nomsg))) (.cse9 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse0 (<= ~send3 127)) (.cse2 (<= 0 ~send5)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (<= 0 ~send3)) (.cse8 (<= ~send5 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_prenex_1 Int)) (let ((.cse6 (mod v_prenex_1 256))) (and (= .cse6 ~p5_old) (<= .cse6 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse7 .cse8) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse9 .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 (= ~mode2 (* 256 (div ~mode2 256))) .cse5 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse7 .cse8))) [2018-10-02 12:16:36,309 INFO L421 ceAbstractionStarter]: At program point L385(lines 377 386) the Hoare annotation is: (let ((.cse10 (* 256 (div ~r1 256))) (.cse11 (+ ~nomsg 1))) (let ((.cse5 (and (= .cse11 0) (exists ((v_prenex_1 Int)) (let ((.cse13 (mod v_prenex_1 256))) (and (= ~p5_new .cse13) (<= .cse13 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))))) (.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse7 (not (= ~p3_new ~nomsg))) (.cse8 (<= 0 ~send3)) (.cse2 (<= 0 ~send5)) (.cse3 (<= ~r1 (+ .cse10 4))) (.cse4 (<= ~mode4 1)) (.cse6 (not (= ~p3_old ~nomsg))) (.cse9 (<= ~send5 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 (<= ~r1 .cse10) .cse8 .cse9) (and .cse0 .cse1 .cse7 (= 0 .cse11) .cse8 (= ~mode5 (* 256 (div ~mode5 256))) .cse2 .cse3 .cse4 .cse6 (exists ((v_prenex_1 Int)) (let ((.cse12 (mod v_prenex_1 256))) (and (= .cse12 ~p5_old) (<= .cse12 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse9)))) [2018-10-02 12:16:36,309 INFO L421 ceAbstractionStarter]: At program point L319(lines 312 320) the Hoare annotation is: (let ((.cse0 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse1 (<= ~send3 127)) (.cse6 (<= 1 ~mode4)) (.cse2 (<= 0 ~send5)) (.cse7 (<= ~mode4 1)) (.cse8 (not (= ~p3_old ~nomsg))) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse5 (<= ~send5 127))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 .cse3 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse4 .cse5) (and .cse1 .cse6 .cse2 .cse7 .cse8 .cse3 (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 256))) (and (= .cse9 ~p5_old) (<= .cse9 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse4 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse7 .cse8 .cse3 .cse4 .cse5))) [2018-10-02 12:16:36,310 INFO L421 ceAbstractionStarter]: At program point L410(lines 406 417) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse2 (<= 0 ~send5)) (.cse3 (<= ~r1 (+ (* 256 (div ~r1 256)) 4))) (.cse4 (<= ~mode4 1)) (.cse5 (not (= ~p3_old ~nomsg))) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= 0 ~send3)) (.cse8 (<= ~send5 127))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 256))) (and (= .cse9 ~p5_old) (<= .cse9 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse7 .cse8))) [2018-10-02 12:16:36,310 INFO L421 ceAbstractionStarter]: At program point L431(lines 431 438) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse2 (= ULTIMATE.start_assert_~arg 1)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse5 (<= 0 ~send5)) (.cse6 (<= ~r1 (+ (* 256 (div ~r1 256)) 4))) (.cse7 (<= 1 ULTIMATE.start_check_~tmp~108)) (.cse8 (<= ~mode4 1)) (.cse9 (not (= ~p3_old ~nomsg))) (.cse10 (<= ~send5 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~mode5 (* 256 (div ~mode5 256))) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((v_prenex_1 Int)) (let ((.cse11 (mod v_prenex_1 256))) (and (= .cse11 ~p5_old) (<= .cse11 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse10))) [2018-10-02 12:16:36,310 INFO L421 ceAbstractionStarter]: At program point L324(lines 324 334) the Hoare annotation is: (let ((.cse0 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse1 (<= ~send3 127)) (.cse6 (<= 1 ~mode4)) (.cse2 (<= 0 ~send5)) (.cse7 (<= ~mode4 1)) (.cse8 (not (= ~p3_old ~nomsg))) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse5 (<= ~send5 127))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 .cse3 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse4 .cse5) (and .cse1 .cse6 .cse2 .cse7 .cse8 .cse3 (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 256))) (and (= .cse9 ~p5_old) (<= .cse9 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse4 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse7 .cse8 .cse3 .cse4 .cse5))) [2018-10-02 12:16:36,319 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,320 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,320 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,320 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,326 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,327 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,327 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,327 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,330 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,331 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,331 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,331 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,333 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,334 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,334 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,334 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,338 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,338 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,338 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,339 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,339 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,339 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,339 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,340 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,340 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,340 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,341 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,341 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,344 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,344 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,344 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,345 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,345 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,345 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,346 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,346 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,346 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,346 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,347 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,347 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,349 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,349 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,350 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,350 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,351 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,352 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,352 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,352 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,355 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,355 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,356 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,356 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,356 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,357 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,357 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,357 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,357 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,358 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,358 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,358 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,362 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,362 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,362 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,363 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,363 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,363 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,363 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,364 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,364 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,364 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,364 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,365 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,367 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,367 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,368 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,368 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,370 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,370 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,370 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,370 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,372 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,373 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,373 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,373 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,375 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,375 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,375 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,375 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,377 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,377 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,378 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,378 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,380 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,380 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,380 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,381 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,382 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,382 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,382 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,383 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,384 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,384 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,384 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,385 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,386 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,386 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,386 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,387 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,388 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,388 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,388 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,389 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,390 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,390 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,391 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,391 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,392 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,392 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,392 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,393 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,394 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,394 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,395 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,395 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,396 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,396 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,396 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,397 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,399 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,399 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,399 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,399 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,400 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,400 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,400 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,401 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,401 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,401 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,402 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,402 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,404 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,405 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,405 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,405 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,406 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,406 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,406 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,406 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,407 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,407 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,407 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,408 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,409 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,409 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,409 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,409 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,410 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,411 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,411 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,411 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,412 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,412 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,412 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,413 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,414 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,414 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,414 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,414 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,416 INFO L202 PluginConnector]: Adding new model pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:16:36 BoogieIcfgContainer [2018-10-02 12:16:36,417 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 12:16:36,418 INFO L168 Benchmark]: Toolchain (without parser) took 24321.55 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 130.0 MB). Free memory was 1.5 GB in the beginning and 983.8 MB in the end (delta: 479.7 MB). Peak memory consumption was 620.2 MB. Max. memory is 7.1 GB. [2018-10-02 12:16:36,419 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:16:36,420 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.07 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:16:36,420 INFO L168 Benchmark]: Boogie Preprocessor took 56.05 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:16:36,421 INFO L168 Benchmark]: RCFGBuilder took 725.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-02 12:16:36,422 INFO L168 Benchmark]: TraceAbstraction took 23476.49 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 130.0 MB). Free memory was 1.4 GB in the beginning and 983.8 MB in the end (delta: 437.5 MB). Peak memory consumption was 577.9 MB. Max. memory is 7.1 GB. [2018-10-02 12:16:36,426 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.25 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 57.07 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.05 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 725.40 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 23476.49 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 130.0 MB). Free memory was 1.4 GB in the beginning and 983.8 MB in the end (delta: 437.5 MB). Peak memory consumption was 577.9 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] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-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: 442]: 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: 324]: Loop Invariant [2018-10-02 12:16:36,449 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,450 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,450 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,450 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,451 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,451 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,451 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,451 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 0 <= ~send5) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~send5 <= 127) || ((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send3) && ~send5 <= 127)) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 272]: Loop Invariant [2018-10-02 12:16:36,452 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,453 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,453 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,453 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,454 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,454 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,454 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,455 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~send5 <= 127) || ((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send3) && ~send5 <= 127)) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 377]: Loop Invariant [2018-10-02 12:16:36,456 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,456 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,456 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,456 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,457 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,457 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,457 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,457 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,458 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,458 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,458 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,458 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,459 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,460 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,460 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,460 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,460 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,461 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,461 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,461 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,461 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,462 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,462 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,462 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && ~mode4 <= 1) && ~nomsg + 1 == 0 && (exists v_prenex_1 : int :: ((~p5_new == v_prenex_1 % 256 && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && !(~p3_old == ~nomsg)) && !(~p3_new == ~nomsg)) && 0 <= ~send3) && ~send5 <= 127) || ((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && ~nomsg + 1 == 0 && (exists v_prenex_1 : int :: ((~p5_new == v_prenex_1 % 256 && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && !(~p3_new == ~nomsg)) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && ~send5 <= 127)) || (((((((((((~send3 <= 127 && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode5 == 256 * (~mode5 / 256)) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && ~send5 <= 127) - InvariantResult [Line: 355]: Loop Invariant [2018-10-02 12:16:36,463 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,463 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,464 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,464 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,464 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,465 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,465 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,465 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((~send3 <= 127 && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode5 == 256 * (~mode5 / 256)) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && ~send5 <= 127) || ((((((((((~send3 <= 127 && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && ~send5 <= 127)) || (((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 333]: Loop Invariant [2018-10-02 12:16:36,466 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,467 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,467 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,467 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,467 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,468 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,468 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,468 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,469 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,469 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,469 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,469 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,471 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,471 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,471 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,471 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,472 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,472 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,472 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,472 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,473 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,473 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,473 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,473 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 0 <= ~send5) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && ~send5 <= 127) && ~mode4 == 256 * (~mode4 / 256)) || (((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127)) || ((((((((~send3 <= 127 && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && !(~p3_old == ~nomsg)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send3) && ~send5 <= 127)) || (((((((((~send3 <= 127 && 1 <= ~mode4) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send3) && ~send5 <= 127)) || (((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127)) || (((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send3) && ~send5 <= 127)) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && !(~p3_old == ~nomsg)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 437]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 289]: Loop Invariant [2018-10-02 12:16:36,474 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,475 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,475 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,475 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,476 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,476 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,476 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,476 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send3) && ~send5 <= 127) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127)) || (((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 312]: Loop Invariant [2018-10-02 12:16:36,477 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,477 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,478 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,478 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,478 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,479 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,479 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,479 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 0 <= ~send5) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~send5 <= 127) || ((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send3) && ~send5 <= 127)) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 279]: Loop Invariant [2018-10-02 12:16:36,480 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,480 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,481 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,481 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,481 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,482 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,482 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,482 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~send5 <= 127) || ((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send3) && ~send5 <= 127)) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 401]: Loop Invariant [2018-10-02 12:16:36,483 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,483 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,483 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,484 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,484 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,484 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,485 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,485 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127) || (((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 368]: Loop Invariant [2018-10-02 12:16:36,486 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,486 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,486 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,486 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,487 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,487 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,488 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,488 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((~send3 <= 127 && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode5 == 256 * (~mode5 / 256)) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && ~send5 <= 127) || ((((((((((~send3 <= 127 && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && ~send5 <= 127)) || (((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 302]: Loop Invariant [2018-10-02 12:16:36,488 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,489 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,489 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,489 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,490 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,490 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,490 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,490 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send3) && ~send5 <= 127) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127)) || (((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 416]: Loop Invariant [2018-10-02 12:16:36,491 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,491 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,492 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,492 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,492 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,493 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,493 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,494 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((((~send3 <= 127 && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && 1 <= check_~tmp~108) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && ~send5 <= 127) || ((((((((((~send3 <= 127 && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode5 == 256 * (~mode5 / 256)) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && 1 <= check_~tmp~108) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && ~send5 <= 127) - InvariantResult [Line: 346]: Loop Invariant [2018-10-02 12:16:36,495 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,495 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,496 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,496 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,496 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,497 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,497 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,497 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,497 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,497 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,498 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,498 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,499 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,499 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,500 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,500 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,500 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,500 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,501 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,501 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,501 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,501 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,502 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,502 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 0 <= ~send5) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && ~send5 <= 127) && ~mode4 == 256 * (~mode4 / 256)) || (((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127)) || ((((((((~send3 <= 127 && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && !(~p3_old == ~nomsg)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send3) && ~send5 <= 127)) || (((((((((~send3 <= 127 && 1 <= ~mode4) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send3) && ~send5 <= 127)) || (((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127)) || (((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send3) && ~send5 <= 127)) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && !(~p3_old == ~nomsg)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 406]: Loop Invariant [2018-10-02 12:16:36,503 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,503 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,503 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,503 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,504 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,504 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,504 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,504 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~send5 <= 127) || (((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send3) && ~send5 <= 127) - InvariantResult [Line: 431]: Loop Invariant [2018-10-02 12:16:36,505 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,505 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,506 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,506 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,506 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,507 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,507 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 12:16:36,507 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((~send3 <= 127 && 1 <= ~mode4) && assert_~arg == 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode5 == 256 * (~mode5 / 256)) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && 1 <= check_~tmp~108) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && ~send5 <= 127) || (((((((((((~send3 <= 127 && 1 <= ~mode4) && assert_~arg == 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && 0 <= ~send5) && ~r1 <= 256 * (~r1 / 256) + 4) && 1 <= check_~tmp~108) && ~mode4 <= 1) && !(~p3_old == ~nomsg)) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && ~send5 <= 127) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. SAFE Result, 23.3s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 8.5s AutomataDifference, 0.0s DeadEndRemovalTime, 11.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 283 SDtfs, 273 SDslu, 241 SDs, 0 SdLazy, 194 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1205occurred in iteration=7, 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: 0.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 437 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 281 NumberOfFragments, 2358 HoareAnnotationTreeSize, 16 FomulaSimplifications, 9830 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 16 FomulaSimplificationsInter, 32504 FormulaSimplificationTreeSizeReductionInter, 10.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 365 NumberOfCodeBlocks, 365 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 355 ConstructedInterpolants, 7 QuantifiedInterpolants, 130688 SizeOfPredicates, 4 NumberOfNonLiveVariables, 489 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 410/420 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.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_12-16-36-514.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_21.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_12-16-36-514.csv Received shutdown request...