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.4.ufo.BOUNDED-8.pals.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:52:40,777 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:52:40,779 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:52:40,791 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:52:40,791 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:52:40,792 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:52:40,794 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:52:40,795 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:52:40,797 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:52:40,798 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:52:40,799 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:52:40,799 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:52:40,800 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:52:40,802 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:52:40,803 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:52:40,804 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:52:40,804 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:52:40,806 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:52:40,808 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:52:40,810 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:52:40,811 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:52:40,813 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:52:40,815 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:52:40,815 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:52:40,816 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:52:40,817 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:52:40,818 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:52:40,819 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:52:40,820 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:52:40,821 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:52:40,821 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:52:40,822 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:52:40,822 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:52:40,822 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:52:40,823 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:52:40,824 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:52:40,825 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-04 12:52:40,840 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:52:40,840 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:52:40,841 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:52:40,841 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:52:40,842 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:52:40,842 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:52:40,842 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:52:40,843 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:52:40,843 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:52:40,843 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:52:40,843 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:52:40,844 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:52:40,844 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:52:40,844 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:52:40,844 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:52:40,844 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:52:40,845 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:52:40,845 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:52:40,845 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:52:40,845 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:52:40,845 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:52:40,846 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:52:40,846 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:52:40,846 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:52:40,846 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:52:40,847 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:52:40,847 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:52:40,847 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:52:40,847 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:52:40,847 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:52:40,848 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:52:40,910 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:52:40,928 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:52:40,933 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:52:40,935 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:52:40,936 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:52:40,937 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl [2018-10-04 12:52:40,937 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl' [2018-10-04 12:52:41,015 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:52:41,017 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:52:41,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:52:41,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:52:41,019 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:52:41,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:41" (1/1) ... [2018-10-04 12:52:41,058 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:41" (1/1) ... [2018-10-04 12:52:41,077 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:52:41,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:52:41,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:52:41,079 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:52:41,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:41" (1/1) ... [2018-10-04 12:52:41,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:41" (1/1) ... [2018-10-04 12:52:41,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:41" (1/1) ... [2018-10-04 12:52:41,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:41" (1/1) ... [2018-10-04 12:52:41,117 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:41" (1/1) ... [2018-10-04 12:52:41,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:41" (1/1) ... [2018-10-04 12:52:41,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:41" (1/1) ... [2018-10-04 12:52:41,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:52:41,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:52:41,132 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:52:41,132 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:52:41,133 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:52:41,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:52:41,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:52:41,866 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:52:41,867 INFO L202 PluginConnector]: Adding new model pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:52:41 BoogieIcfgContainer [2018-10-04 12:52:41,867 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:52:41,869 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:52:41,869 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:52:41,874 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:52:41,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:41" (1/2) ... [2018-10-04 12:52:41,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26e81c77 and model type pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:52:41, skipping insertion in model container [2018-10-04 12:52:41,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:52:41" (2/2) ... [2018-10-04 12:52:41,877 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl [2018-10-04 12:52:41,887 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:52:41,895 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:52:41,943 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:52:41,943 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:52:41,944 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:52:41,944 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:52:41,944 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:52:41,944 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:52:41,944 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:52:41,945 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:52:41,945 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:52:41,961 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-10-04 12:52:41,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:52:41,968 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:41,970 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:52:41,971 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:41,978 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:41,978 INFO L82 PathProgramCache]: Analyzing trace with hash 679324735, now seen corresponding path program 1 times [2018-10-04 12:52:41,980 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:41,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:42,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:42,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:42,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:42,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:52:42,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:42,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:52:42,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:42,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:42,217 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:42,219 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-10-04 12:52:42,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:42,289 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2018-10-04 12:52:42,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:42,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-04 12:52:42,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:42,308 INFO L225 Difference]: With dead ends: 48 [2018-10-04 12:52:42,308 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:52:42,311 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 1 [2018-10-04 12:52:42,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:52:42,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-10-04 12:52:42,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 12:52:42,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-10-04 12:52:42,351 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 15 [2018-10-04 12:52:42,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:42,352 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2018-10-04 12:52:42,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:52:42,352 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2018-10-04 12:52:42,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:52:42,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:42,353 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:52:42,353 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:42,354 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:42,354 INFO L82 PathProgramCache]: Analyzing trace with hash 92518721, now seen corresponding path program 1 times [2018-10-04 12:52:42,354 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:42,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:42,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:42,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:42,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:42,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:52:42,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:42,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:52:42,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:42,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:42,519 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:42,520 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 3 states. [2018-10-04 12:52:42,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:42,569 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2018-10-04 12:52:42,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:42,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-04 12:52:42,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:42,574 INFO L225 Difference]: With dead ends: 85 [2018-10-04 12:52:42,574 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:52:42,576 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 1 [2018-10-04 12:52:42,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:52:42,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-10-04 12:52:42,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-04 12:52:42,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2018-10-04 12:52:42,601 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 15 [2018-10-04 12:52:42,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:42,602 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2018-10-04 12:52:42,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:52:42,602 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2018-10-04 12:52:42,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:52:42,603 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:42,603 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:52:42,603 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:42,603 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:42,604 INFO L82 PathProgramCache]: Analyzing trace with hash 772577091, now seen corresponding path program 1 times [2018-10-04 12:52:42,604 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:42,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:42,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:42,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:42,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:42,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:52:42,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:42,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:52:42,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:42,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:42,693 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:42,694 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand 3 states. [2018-10-04 12:52:42,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:42,740 INFO L93 Difference]: Finished difference Result 163 states and 232 transitions. [2018-10-04 12:52:42,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:42,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-04 12:52:42,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:42,745 INFO L225 Difference]: With dead ends: 163 [2018-10-04 12:52:42,745 INFO L226 Difference]: Without dead ends: 109 [2018-10-04 12:52:42,746 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 1 [2018-10-04 12:52:42,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-04 12:52:42,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-10-04 12:52:42,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-04 12:52:42,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 150 transitions. [2018-10-04 12:52:42,772 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 150 transitions. Word has length 15 [2018-10-04 12:52:42,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:42,772 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 150 transitions. [2018-10-04 12:52:42,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:52:42,773 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 150 transitions. [2018-10-04 12:52:42,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:52:42,774 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:42,774 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:52:42,774 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:42,775 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:42,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1002430271, now seen corresponding path program 1 times [2018-10-04 12:52:42,775 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:42,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:42,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:42,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:42,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:42,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:52:42,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:42,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:52:42,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:42,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:42,930 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:42,930 INFO L87 Difference]: Start difference. First operand 107 states and 150 transitions. Second operand 3 states. [2018-10-04 12:52:43,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:43,072 INFO L93 Difference]: Finished difference Result 269 states and 378 transitions. [2018-10-04 12:52:43,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:43,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-04 12:52:43,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:43,079 INFO L225 Difference]: With dead ends: 269 [2018-10-04 12:52:43,080 INFO L226 Difference]: Without dead ends: 163 [2018-10-04 12:52:43,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:52:43,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-04 12:52:43,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2018-10-04 12:52:43,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-04 12:52:43,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 220 transitions. [2018-10-04 12:52:43,138 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 220 transitions. Word has length 15 [2018-10-04 12:52:43,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:43,139 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 220 transitions. [2018-10-04 12:52:43,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:52:43,139 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 220 transitions. [2018-10-04 12:52:43,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:52:43,140 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:43,140 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:52:43,140 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:43,140 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:43,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1000583229, now seen corresponding path program 1 times [2018-10-04 12:52:43,141 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:43,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:43,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:43,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:43,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:43,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:52:43,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:43,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:52:43,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:52:43,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:52:43,336 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:43,336 INFO L87 Difference]: Start difference. First operand 161 states and 220 transitions. Second operand 4 states. [2018-10-04 12:52:43,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:43,509 INFO L93 Difference]: Finished difference Result 293 states and 396 transitions. [2018-10-04 12:52:43,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:52:43,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-10-04 12:52:43,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:43,518 INFO L225 Difference]: With dead ends: 293 [2018-10-04 12:52:43,518 INFO L226 Difference]: Without dead ends: 291 [2018-10-04 12:52:43,519 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 3 [2018-10-04 12:52:43,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-10-04 12:52:43,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 177. [2018-10-04 12:52:43,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-04 12:52:43,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2018-10-04 12:52:43,590 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 15 [2018-10-04 12:52:43,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:43,591 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2018-10-04 12:52:43,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:52:43,591 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2018-10-04 12:52:43,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 12:52:43,593 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:43,594 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:52:43,595 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:43,595 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:43,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1080825333, now seen corresponding path program 1 times [2018-10-04 12:52:43,595 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:43,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:43,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:43,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:43,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:43,704 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:52:43,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:43,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:52:43,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:43,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:43,705 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:43,706 INFO L87 Difference]: Start difference. First operand 177 states and 232 transitions. Second operand 3 states. [2018-10-04 12:52:43,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:43,799 INFO L93 Difference]: Finished difference Result 525 states and 690 transitions. [2018-10-04 12:52:43,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:43,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-04 12:52:43,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:43,802 INFO L225 Difference]: With dead ends: 525 [2018-10-04 12:52:43,802 INFO L226 Difference]: Without dead ends: 351 [2018-10-04 12:52:43,804 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 1 [2018-10-04 12:52:43,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-10-04 12:52:43,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2018-10-04 12:52:43,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-10-04 12:52:43,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 448 transitions. [2018-10-04 12:52:43,875 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 448 transitions. Word has length 28 [2018-10-04 12:52:43,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:43,878 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 448 transitions. [2018-10-04 12:52:43,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:52:43,878 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 448 transitions. [2018-10-04 12:52:43,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 12:52:43,881 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:43,882 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:52:43,882 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:43,882 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:43,883 INFO L82 PathProgramCache]: Analyzing trace with hash 379760755, now seen corresponding path program 1 times [2018-10-04 12:52:43,883 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:43,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:43,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:43,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:43,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:44,075 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:52:44,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:52:44,076 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:52:44,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:44,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:52:45,063 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:52:45,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:52:45,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2018-10-04 12:52:45,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:52:45,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:52:45,098 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:45,099 INFO L87 Difference]: Start difference. First operand 349 states and 448 transitions. Second operand 5 states. [2018-10-04 12:52:45,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:45,442 INFO L93 Difference]: Finished difference Result 799 states and 1041 transitions. [2018-10-04 12:52:45,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:52:45,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-10-04 12:52:45,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:45,450 INFO L225 Difference]: With dead ends: 799 [2018-10-04 12:52:45,450 INFO L226 Difference]: Without dead ends: 557 [2018-10-04 12:52:45,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.0s impTime 3 [2018-10-04 12:52:45,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-10-04 12:52:45,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2018-10-04 12:52:45,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2018-10-04 12:52:45,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 688 transitions. [2018-10-04 12:52:45,580 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 688 transitions. Word has length 28 [2018-10-04 12:52:45,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:45,580 INFO L480 AbstractCegarLoop]: Abstraction has 557 states and 688 transitions. [2018-10-04 12:52:45,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:52:45,581 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 688 transitions. [2018-10-04 12:52:45,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-04 12:52:45,592 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:45,592 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 12:52:45,594 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:45,594 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:45,594 INFO L82 PathProgramCache]: Analyzing trace with hash 415408239, now seen corresponding path program 2 times [2018-10-04 12:52:45,595 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:45,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:45,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:45,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:45,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:45,995 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 43 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-04 12:52:45,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:52:45,996 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:52:46,010 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:52:46,100 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:52:46,100 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:52:46,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:52:46,884 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 41 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-04 12:52:46,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:52:46,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-10-04 12:52:46,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:52:46,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:52:46,915 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:46,915 INFO L87 Difference]: Start difference. First operand 557 states and 688 transitions. Second operand 8 states. [2018-10-04 12:52:48,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:48,708 INFO L93 Difference]: Finished difference Result 623 states and 764 transitions. [2018-10-04 12:52:48,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:52:48,709 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-10-04 12:52:48,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:48,710 INFO L225 Difference]: With dead ends: 623 [2018-10-04 12:52:48,710 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:52:48,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 0.9s impTime 14 [2018-10-04 12:52:48,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:52:48,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:52:48,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:52:48,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:52:48,712 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-10-04 12:52:48,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:48,713 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:52:48,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:52:48,713 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:52:48,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:52:48,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:52:51,199 WARN L178 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 103 DAG size of output: 65 [2018-10-04 12:52:51,534 WARN L178 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2018-10-04 12:52:51,803 WARN L178 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2018-10-04 12:52:52,063 WARN L178 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 41 [2018-10-04 12:52:52,420 WARN L178 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2018-10-04 12:52:52,818 WARN L178 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2018-10-04 12:52:53,601 WARN L178 SmtUtils]: Spent 781.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 43 [2018-10-04 12:52:53,903 WARN L178 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 41 [2018-10-04 12:52:54,161 WARN L178 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 43 [2018-10-04 12:52:54,832 WARN L178 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 65 [2018-10-04 12:52:55,036 WARN L178 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2018-10-04 12:52:55,346 WARN L178 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 50 [2018-10-04 12:52:55,563 WARN L178 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2018-10-04 12:52:55,567 INFO L421 ceAbstractionStarter]: At program point L300(lines 300 311) the Hoare annotation is: (let ((.cse5 (<= ~r1 0)) (.cse0 (<= 0 ~send1)) (.cse1 (<= 0 ~send4)) (.cse7 (<= ~send1 127)) (.cse8 (<= ~send4 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (not (= ~p1_new ~nomsg))) (.cse4 (<= 0 ~r1))) (or (and (not (= ~p1_old ~nomsg)) (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 (<= ~mode2 1) .cse2 (<= 1 ULTIMATE.start_check_~tmp~83) .cse3 .cse4 .cse5 (exists ((v_prenex_2 Int)) (let ((.cse6 (mod v_prenex_2 256))) (and (<= .cse6 127) (= ~p4_old .cse6) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) (<= 1 ~mode2) .cse7 .cse8 (<= 1 ULTIMATE.start_assert_~arg)) (and .cse5 .cse0 .cse1 .cse7 .cse8 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse3 .cse4))) [2018-10-04 12:52:55,568 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 66 376) no Hoare annotation was computed. [2018-10-04 12:52:55,568 INFO L421 ceAbstractionStarter]: At program point L317(lines 310 318) the Hoare annotation is: (let ((.cse1 (<= 0 ~send1)) (.cse2 (<= 0 ~send4)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p1_new ~nomsg))) (.cse8 (<= 0 ~r1)) (.cse0 (<= ~r1 0)) (.cse3 (<= ~send1 127)) (.cse4 (<= ~send4 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (exists ((v_prenex_2 Int)) (let ((.cse7 (mod v_prenex_2 256))) (and (<= .cse7 127) (<= v_prenex_2 127) (<= 0 v_prenex_2) (= ~p4_new .cse7)))) .cse8) (and (not (= ~p1_old ~nomsg)) (<= ULTIMATE.start_assert_~arg 1) .cse1 .cse2 (<= ~mode2 1) .cse5 (<= 1 ULTIMATE.start_check_~tmp~83) (= ~mode4 (* 256 (div ~mode4 256))) .cse6 .cse8 .cse0 (exists ((v_prenex_2 Int)) (let ((.cse9 (mod v_prenex_2 256))) (and (<= .cse9 127) (= ~p4_old .cse9) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) (<= 1 ~mode2) .cse3 .cse4 (<= 1 ULTIMATE.start_assert_~arg)))) [2018-10-04 12:52:55,568 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 66 376) no Hoare annotation was computed. [2018-10-04 12:52:55,568 INFO L421 ceAbstractionStarter]: At program point L251(lines 243 252) the Hoare annotation is: (let ((.cse11 (<= ~mode2 1)) (.cse6 (= ~mode4 (* 256 (div ~mode4 256)))) (.cse13 (<= 1 ~mode2)) (.cse9 (not (= ~p1_old ~nomsg))) (.cse10 (<= ULTIMATE.start_assert_~arg 1)) (.cse1 (<= 0 ~send1)) (.cse2 (<= 0 ~send4)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse12 (<= 1 ULTIMATE.start_check_~tmp~83)) (.cse7 (not (= ~p1_new ~nomsg))) (.cse8 (<= 0 ~r1)) (.cse0 (<= ~r1 0)) (.cse3 (<= ~send1 127)) (.cse4 (<= ~send4 127)) (.cse14 (<= 1 ULTIMATE.start_assert_~arg))) (or (and .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse1 .cse2 .cse11 .cse5 .cse12 .cse6 .cse7 .cse8 .cse0 .cse13 .cse3 .cse4 .cse14) (and .cse9 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse15 (mod (+ v_~r1_9 1) 256))) (and (<= v_~r1_9 0) (<= ~r1 .cse15) (<= .cse15 127) (<= 0 v_~r1_9)))) .cse2 .cse11 .cse5 .cse6 (= ~mode1 (* 256 (div ~mode1 256))) .cse13 .cse3 .cse4) (and .cse9 .cse10 .cse1 .cse2 .cse5 .cse12 .cse7 .cse8 .cse0 (exists ((v_prenex_2 Int)) (let ((.cse16 (mod v_prenex_2 256))) (and (<= .cse16 127) (= ~p4_old .cse16) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse3 .cse4 .cse14))) [2018-10-04 12:52:55,568 INFO L421 ceAbstractionStarter]: At program point L367(lines 367 374) the Hoare annotation is: false [2018-10-04 12:52:55,568 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 375) no Hoare annotation was computed. [2018-10-04 12:52:55,569 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 66 376) no Hoare annotation was computed. [2018-10-04 12:52:55,569 INFO L421 ceAbstractionStarter]: At program point L256(lines 256 266) the Hoare annotation is: (let ((.cse11 (<= ~mode2 1)) (.cse6 (= ~mode4 (* 256 (div ~mode4 256)))) (.cse13 (<= 1 ~mode2)) (.cse9 (not (= ~p1_old ~nomsg))) (.cse10 (<= ULTIMATE.start_assert_~arg 1)) (.cse1 (<= 0 ~send1)) (.cse2 (<= 0 ~send4)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse12 (<= 1 ULTIMATE.start_check_~tmp~83)) (.cse7 (not (= ~p1_new ~nomsg))) (.cse8 (<= 0 ~r1)) (.cse0 (<= ~r1 0)) (.cse3 (<= ~send1 127)) (.cse4 (<= ~send4 127)) (.cse14 (<= 1 ULTIMATE.start_assert_~arg))) (or (and .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse1 .cse2 .cse11 .cse5 .cse12 .cse6 .cse7 .cse8 .cse0 .cse13 .cse3 .cse4 .cse14) (and .cse9 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse15 (mod (+ v_~r1_9 1) 256))) (and (<= v_~r1_9 0) (<= ~r1 .cse15) (<= .cse15 127) (<= 0 v_~r1_9)))) .cse2 .cse11 .cse5 .cse6 (= ~mode1 (* 256 (div ~mode1 256))) .cse13 .cse3 .cse4) (and .cse9 .cse10 .cse1 .cse2 .cse5 .cse12 .cse7 .cse8 .cse0 (exists ((v_prenex_2 Int)) (let ((.cse16 (mod v_prenex_2 256))) (and (<= .cse16 127) (= ~p4_old .cse16) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse3 .cse4 .cse14))) [2018-10-04 12:52:55,569 INFO L421 ceAbstractionStarter]: At program point L351(lines 346 352) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse2 (<= 0 ~send1)) (.cse4 (<= 0 ~send4)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (<= 1 ULTIMATE.start_check_~tmp~83)) (.cse9 (<= 0 ~r1)) (.cse1 (<= ~r1 0)) (.cse5 (<= ~send1 127)) (.cse6 (<= ~send4 127))) (or (and .cse0 .cse1 .cse2 (exists ((v_prenex_2 Int)) (let ((.cse3 (mod v_prenex_2 256))) (and (<= .cse3 127) (= ~p4_old .cse3) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (<= ULTIMATE.start_assert_~arg 1) .cse2 .cse4 (<= ~mode2 1) .cse7 .cse8 (= ~mode4 (* 256 (div ~mode4 256))) .cse9 .cse1 (<= 1 ~mode2) .cse5 .cse6 (<= 1 ULTIMATE.start_assert_~arg)))) [2018-10-04 12:52:55,569 INFO L421 ceAbstractionStarter]: At program point L273(lines 265 274) the Hoare annotation is: (let ((.cse1 (<= 0 ~send1)) (.cse2 (<= 0 ~send4)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p1_new ~nomsg))) (.cse7 (<= 0 ~r1)) (.cse0 (<= ~r1 0)) (.cse3 (<= ~send1 127)) (.cse4 (<= ~send4 127))) (or (and .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 (= ~mode4 (* 256 (div ~mode4 256))) .cse6 .cse7) (and (not (= ~p1_old ~nomsg)) (<= ULTIMATE.start_assert_~arg 1) .cse1 .cse2 (<= ~mode2 1) .cse5 (<= 1 ULTIMATE.start_check_~tmp~83) .cse6 .cse7 .cse0 (exists ((v_prenex_2 Int)) (let ((.cse8 (mod v_prenex_2 256))) (and (<= .cse8 127) (= ~p4_old .cse8) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) (<= 1 ~mode2) .cse3 .cse4 (<= 1 ULTIMATE.start_assert_~arg)))) [2018-10-04 12:52:55,569 INFO L421 ceAbstractionStarter]: At program point L331(lines 331 337) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse5 (<= ~r1 0)) (.cse1 (<= 0 ~send1)) (.cse2 (<= 0 ~send4)) (.cse6 (<= ~send1 127)) (.cse7 (<= ~send4 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~r1))) (or (and .cse0 (<= ULTIMATE.start_assert_~arg 1) .cse1 .cse2 (<= ~mode2 1) .cse3 (= ~mode4 (* 256 (div ~mode4 256))) .cse4 .cse5 (<= 1 ~mode2) .cse6 .cse7 (<= 1 ULTIMATE.start_assert_~arg)) (and .cse0 .cse5 .cse1 (exists ((v_prenex_2 Int)) (let ((.cse8 (mod v_prenex_2 256))) (and (<= .cse8 127) (= ~p4_old .cse8) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse2 .cse6 .cse7 .cse3 .cse4))) [2018-10-04 12:52:55,570 INFO L421 ceAbstractionStarter]: At program point L278(lines 278 288) the Hoare annotation is: (let ((.cse1 (<= 0 ~send1)) (.cse2 (<= 0 ~send4)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p1_new ~nomsg))) (.cse7 (<= 0 ~r1)) (.cse0 (<= ~r1 0)) (.cse3 (<= ~send1 127)) (.cse4 (<= ~send4 127))) (or (and .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 (= ~mode4 (* 256 (div ~mode4 256))) .cse6 .cse7) (and (not (= ~p1_old ~nomsg)) (<= ULTIMATE.start_assert_~arg 1) .cse1 .cse2 (<= ~mode2 1) .cse5 (<= 1 ULTIMATE.start_check_~tmp~83) .cse6 .cse7 .cse0 (exists ((v_prenex_2 Int)) (let ((.cse8 (mod v_prenex_2 256))) (and (<= .cse8 127) (= ~p4_old .cse8) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) (<= 1 ~mode2) .cse3 .cse4 (<= 1 ULTIMATE.start_assert_~arg)))) [2018-10-04 12:52:55,570 INFO L421 ceAbstractionStarter]: At program point L373(lines 226 373) the Hoare annotation is: (let ((.cse8 (not (= ~p1_old ~nomsg))) (.cse9 (<= ULTIMATE.start_assert_~arg 1)) (.cse1 (<= 0 ~send1)) (.cse2 (<= 0 ~send4)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse10 (<= 1 ULTIMATE.start_check_~tmp~83)) (.cse6 (= ~mode4 (* 256 (div ~mode4 256)))) (.cse7 (<= 0 ~r1)) (.cse0 (<= ~r1 0)) (.cse3 (<= ~send1 127)) (.cse4 (<= ~send4 127)) (.cse12 (<= 1 ULTIMATE.start_assert_~arg))) (or (and .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse1 .cse2 .cse5 .cse10 .cse7 .cse0 (exists ((v_prenex_2 Int)) (let ((.cse11 (mod v_prenex_2 256))) (and (<= .cse11 127) (= ~p4_old .cse11) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse3 .cse4 .cse12) (and .cse8 .cse9 .cse1 .cse2 (<= ~mode2 1) .cse5 .cse10 .cse6 .cse7 .cse0 (<= 1 ~mode2) .cse3 .cse4 .cse12))) [2018-10-04 12:52:55,570 INFO L421 ceAbstractionStarter]: At program point L340(lines 336 347) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse5 (<= ~r1 0)) (.cse1 (<= 0 ~send1)) (.cse2 (<= 0 ~send4)) (.cse6 (<= ~send1 127)) (.cse7 (<= ~send4 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~r1))) (or (and .cse0 (<= ULTIMATE.start_assert_~arg 1) .cse1 .cse2 (<= ~mode2 1) .cse3 (= ~mode4 (* 256 (div ~mode4 256))) .cse4 .cse5 (<= 1 ~mode2) .cse6 .cse7 (<= 1 ULTIMATE.start_assert_~arg)) (and .cse0 .cse5 .cse1 (exists ((v_prenex_2 Int)) (let ((.cse8 (mod v_prenex_2 256))) (and (<= .cse8 127) (= ~p4_old .cse8) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse2 .cse6 .cse7 .cse3 .cse4))) [2018-10-04 12:52:55,571 INFO L421 ceAbstractionStarter]: At program point L233(lines 233 244) the Hoare annotation is: (let ((.cse8 (not (= ~p1_old ~nomsg))) (.cse9 (<= ULTIMATE.start_assert_~arg 1)) (.cse1 (<= 0 ~send1)) (.cse2 (<= 0 ~send4)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse10 (<= 1 ULTIMATE.start_check_~tmp~83)) (.cse6 (= ~mode4 (* 256 (div ~mode4 256)))) (.cse7 (<= 0 ~r1)) (.cse0 (<= ~r1 0)) (.cse3 (<= ~send1 127)) (.cse4 (<= ~send4 127)) (.cse12 (<= 1 ULTIMATE.start_assert_~arg))) (or (and .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse1 .cse2 .cse5 .cse10 .cse7 .cse0 (exists ((v_prenex_2 Int)) (let ((.cse11 (mod v_prenex_2 256))) (and (<= .cse11 127) (= ~p4_old .cse11) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse3 .cse4 .cse12) (and .cse8 .cse9 .cse1 .cse2 (<= ~mode2 1) .cse5 .cse10 .cse6 .cse7 .cse0 (<= 1 ~mode2) .cse3 .cse4 .cse12))) [2018-10-04 12:52:55,571 INFO L421 ceAbstractionStarter]: At program point L361(lines 361 368) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= ULTIMATE.start_assert_~arg 1)) (.cse2 (<= 0 ~send1)) (.cse3 (<= 0 ~send4)) (.cse4 (= 0 (+ ~nomsg 1))) (.cse5 (<= 1 ULTIMATE.start_check_~tmp~83)) (.cse6 (<= 0 ~r1)) (.cse7 (<= ~r1 0)) (.cse9 (<= ~send1 127)) (.cse10 (<= ~send4 127)) (.cse11 (<= 1 ULTIMATE.start_assert_~arg))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (exists ((v_prenex_2 Int)) (let ((.cse8 (mod v_prenex_2 256))) (and (<= .cse8 127) (= ~p4_old .cse8) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 (<= ~mode2 1) .cse4 .cse5 (= ~mode4 (* 256 (div ~mode4 256))) .cse6 .cse7 (<= 1 ~mode2) .cse9 .cse10 .cse11))) [2018-10-04 12:52:55,571 INFO L421 ceAbstractionStarter]: At program point L295(lines 287 296) the Hoare annotation is: (let ((.cse5 (<= ~r1 0)) (.cse0 (<= 0 ~send1)) (.cse1 (<= 0 ~send4)) (.cse7 (<= ~send1 127)) (.cse8 (<= ~send4 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (not (= ~p1_new ~nomsg))) (.cse4 (<= 0 ~r1))) (or (and (not (= ~p1_old ~nomsg)) (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 (<= ~mode2 1) .cse2 (<= 1 ULTIMATE.start_check_~tmp~83) .cse3 .cse4 .cse5 (exists ((v_prenex_2 Int)) (let ((.cse6 (mod v_prenex_2 256))) (and (<= .cse6 127) (= ~p4_old .cse6) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) (<= 1 ~mode2) .cse7 .cse8 (<= 1 ULTIMATE.start_assert_~arg)) (and .cse5 .cse0 .cse1 .cse7 .cse8 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse3 .cse4))) [2018-10-04 12:52:55,581 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:55,582 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:55,583 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:55,583 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:55,583 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,584 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,584 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,584 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,593 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:55,593 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:55,594 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:55,594 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:55,594 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,594 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,595 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,595 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,598 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,599 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,599 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,599 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,601 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,602 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,602 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,602 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,604 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,604 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,605 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,605 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,607 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,607 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,607 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,608 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,609 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,609 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,610 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,610 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,612 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,612 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,612 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,612 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,615 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,615 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,616 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,616 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,618 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,618 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,619 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,619 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,621 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,622 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,622 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,622 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,624 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,625 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,625 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,625 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,627 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,627 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,627 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,628 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,629 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,630 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,630 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,630 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,632 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,632 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,632 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,633 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,634 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,634 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,635 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,635 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,636 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,637 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,637 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,637 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,638 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,639 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,639 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,639 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,641 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:55,641 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:55,641 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:55,642 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:55,642 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,642 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,643 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,643 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,645 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:55,645 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:55,646 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:55,646 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:55,646 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,646 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,647 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,647 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,649 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,649 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,649 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,649 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,651 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,651 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,651 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,651 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,653 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,653 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,654 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,654 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,654 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,654 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,655 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,655 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,656 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,656 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,657 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,657 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,657 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,657 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,658 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,658 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,659 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,659 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,659 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,660 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,661 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,661 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,661 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,661 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,664 INFO L202 PluginConnector]: Adding new model pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:52:55 BoogieIcfgContainer [2018-10-04 12:52:55,664 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:52:55,665 INFO L168 Benchmark]: Toolchain (without parser) took 14649.20 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 36.2 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 399.1 MB). Peak memory consumption was 490.8 MB. Max. memory is 7.1 GB. [2018-10-04 12:52:55,666 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:52:55,667 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.65 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:52:55,668 INFO L168 Benchmark]: Boogie Preprocessor took 52.59 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:52:55,668 INFO L168 Benchmark]: RCFGBuilder took 735.87 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-04 12:52:55,669 INFO L168 Benchmark]: TraceAbstraction took 13795.47 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 36.2 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 367.4 MB). Peak memory consumption was 459.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:52:55,674 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.22 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 58.65 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 52.59 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 735.87 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13795.47 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 36.2 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 367.4 MB). Peak memory consumption was 459.1 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_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 375]: 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: 243]: Loop Invariant [2018-10-04 12:52:55,694 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:55,694 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:55,695 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:55,698 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:55,699 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,699 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,699 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,699 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,700 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:55,701 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:55,701 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:55,701 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:55,702 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,705 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,705 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,705 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((((~r1 <= 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && !(~p1_new == ~nomsg)) && 0 <= ~r1) || ((((((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && ~mode4 == 256 * (~mode4 / 256)) && !(~p1_new == ~nomsg)) && 0 <= ~r1) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg)) || ((((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && (exists v_~r1_9 : int :: ((v_~r1_9 <= 0 && ~r1 <= (v_~r1_9 + 1) % 256) && (v_~r1_9 + 1) % 256 <= 127) && 0 <= v_~r1_9)) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127)) || ((((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && !(~p1_new == ~nomsg)) && 0 <= ~r1) && ~r1 <= 0) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) - InvariantResult [Line: 265]: Loop Invariant [2018-10-04 12:52:55,706 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,707 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,707 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,707 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,710 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,710 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,710 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,711 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((~r1 <= 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && !(~p1_new == ~nomsg)) && 0 <= ~r1) || ((((((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && !(~p1_new == ~nomsg)) && 0 <= ~r1) && ~r1 <= 0) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) - InvariantResult [Line: 287]: Loop Invariant [2018-10-04 12:52:55,711 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,714 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,714 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,714 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,715 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,715 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,716 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,716 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && !(~p1_new == ~nomsg)) && 0 <= ~r1) && ~r1 <= 0) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) || ((((((((~r1 <= 0 && 0 <= ~send1) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && !(~p1_new == ~nomsg)) && 0 <= ~r1) - InvariantResult [Line: 331]: Loop Invariant [2018-10-04 12:52:55,717 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,719 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,720 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,720 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,721 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,721 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,721 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,721 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) || ((((((((!(~p1_old == ~nomsg) && ~r1 <= 0) && 0 <= ~send1) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1) - InvariantResult [Line: 226]: Loop Invariant [2018-10-04 12:52:55,722 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,722 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,722 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,723 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,728 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,728 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,728 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,728 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((~r1 <= 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) || (((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && 0 <= ~r1) && ~r1 <= 0) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg)) || (((((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) - InvariantResult [Line: 233]: Loop Invariant [2018-10-04 12:52:55,729 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,729 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,730 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,730 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,730 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,731 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,733 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,734 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((~r1 <= 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) || (((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && 0 <= ~r1) && ~r1 <= 0) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg)) || (((((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) - InvariantResult [Line: 346]: Loop Invariant [2018-10-04 12:52:55,735 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,735 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,735 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,735 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,736 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,736 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,736 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,737 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((!(~p1_old == ~nomsg) && ~r1 <= 0) && 0 <= ~send1) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && 0 <= ~r1) || (((((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) - InvariantResult [Line: 336]: Loop Invariant [2018-10-04 12:52:55,737 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,737 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,738 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,738 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,739 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,739 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,739 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,740 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) || ((((((((!(~p1_old == ~nomsg) && ~r1 <= 0) && 0 <= ~send1) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1) - InvariantResult [Line: 361]: Loop Invariant [2018-10-04 12:52:55,740 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,741 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,741 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,742 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,742 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,742 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,743 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,743 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && 0 <= ~r1) && ~r1 <= 0) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) || (((((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) - InvariantResult [Line: 256]: Loop Invariant [2018-10-04 12:52:55,744 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:55,744 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:55,744 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:55,745 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:55,745 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,745 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,745 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,746 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,747 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:55,747 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:55,747 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:55,747 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 12:52:55,749 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,749 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,749 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,749 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((((~r1 <= 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && !(~p1_new == ~nomsg)) && 0 <= ~r1) || ((((((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && ~mode4 == 256 * (~mode4 / 256)) && !(~p1_new == ~nomsg)) && 0 <= ~r1) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg)) || ((((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && (exists v_~r1_9 : int :: ((v_~r1_9 <= 0 && ~r1 <= (v_~r1_9 + 1) % 256) && (v_~r1_9 + 1) % 256 <= 127) && 0 <= v_~r1_9)) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127)) || ((((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && !(~p1_new == ~nomsg)) && 0 <= ~r1) && ~r1 <= 0) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) - InvariantResult [Line: 278]: Loop Invariant [2018-10-04 12:52:55,750 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,750 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,754 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,754 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,755 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,755 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,755 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,755 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((~r1 <= 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && !(~p1_new == ~nomsg)) && 0 <= ~r1) || ((((((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && !(~p1_new == ~nomsg)) && 0 <= ~r1) && ~r1 <= 0) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) - InvariantResult [Line: 310]: Loop Invariant [2018-10-04 12:52:55,756 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,756 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,757 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,757 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,757 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,757 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,757 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,758 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,758 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,759 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,759 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,759 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,759 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,759 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,760 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,760 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((~r1 <= 0 && 0 <= ~send1) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p1_new == ~nomsg)) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && v_prenex_2 <= 127) && 0 <= v_prenex_2) && ~p4_new == v_prenex_2 % 256)) && 0 <= ~r1) || (((((((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && ~mode4 == 256 * (~mode4 / 256)) && !(~p1_new == ~nomsg)) && 0 <= ~r1) && ~r1 <= 0) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) - InvariantResult [Line: 300]: Loop Invariant [2018-10-04 12:52:55,761 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,761 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,761 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,761 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,762 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,762 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,762 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:52:55,762 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && !(~p1_new == ~nomsg)) && 0 <= ~r1) && ~r1 <= 0) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) || ((((((((~r1 <= 0 && 0 <= ~send1) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && !(~p1_new == ~nomsg)) && 0 <= ~r1) - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. SAFE Result, 13.6s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 6.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 215 SDtfs, 185 SDslu, 174 SDs, 0 SdLazy, 120 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=557occurred 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.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 124 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 82 NumberOfFragments, 1674 HoareAnnotationTreeSize, 14 FomulaSimplifications, 2001 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 14 FomulaSimplificationsInter, 7309 FormulaSimplificationTreeSizeReductionInter, 6.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 257 ConstructedInterpolants, 15 QuantifiedInterpolants, 105206 SizeOfPredicates, 5 NumberOfNonLiveVariables, 676 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 173/195 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.4.ufo.BOUNDED-8.pals.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-52-55-770.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-52-55-770.csv Received shutdown request...