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-d19836b [2018-09-26 21:53:09,730 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:53:09,732 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:53:09,743 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:53:09,744 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:53:09,745 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:53:09,746 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:53:09,748 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:53:09,750 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:53:09,751 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:53:09,751 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:53:09,752 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:53:09,753 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:53:09,754 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:53:09,755 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:53:09,756 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:53:09,757 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:53:09,759 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:53:09,761 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:53:09,762 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:53:09,763 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:53:09,765 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:53:09,767 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:53:09,768 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:53:09,768 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:53:09,769 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:53:09,770 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:53:09,771 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:53:09,772 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:53:09,773 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:53:09,773 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:53:09,774 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:53:09,774 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:53:09,774 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:53:09,776 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:53:09,776 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:53:09,777 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-09-26 21:53:09,794 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:53:09,794 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:53:09,795 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:53:09,795 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:53:09,796 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:53:09,796 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:53:09,796 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:53:09,797 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:53:09,797 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:53:09,797 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:53:09,797 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:53:09,797 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:53:09,798 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:53:09,798 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:53:09,798 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:53:09,798 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:53:09,798 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:53:09,799 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:53:09,799 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:53:09,799 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:53:09,799 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:53:09,799 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:53:09,800 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:53:09,800 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:53:09,800 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:53:09,800 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:53:09,800 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:53:09,801 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:53:09,801 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:53:09,801 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:53:09,801 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-26 21:53:09,861 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:53:09,874 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:53:09,877 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:53:09,879 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:53:09,880 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:53:09,880 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-09-26 21:53:09,881 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-09-26 21:53:09,964 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:53:09,967 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:53:09,968 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:53:09,968 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:53:09,968 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:53:09,987 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 26.09 09:53:09" (1/1) ... [2018-09-26 21:53:10,006 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 26.09 09:53:09" (1/1) ... [2018-09-26 21:53:10,016 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:53:10,017 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:53:10,017 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:53:10,017 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:53:10,029 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 26.09 09:53:09" (1/1) ... [2018-09-26 21:53:10,029 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 26.09 09:53:09" (1/1) ... [2018-09-26 21:53:10,032 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 26.09 09:53:09" (1/1) ... [2018-09-26 21:53:10,041 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 26.09 09:53:09" (1/1) ... [2018-09-26 21:53:10,056 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 26.09 09:53:09" (1/1) ... [2018-09-26 21:53:10,062 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 26.09 09:53:09" (1/1) ... [2018-09-26 21:53:10,064 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 26.09 09:53:09" (1/1) ... [2018-09-26 21:53:10,068 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:53:10,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:53:10,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:53:10,069 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:53:10,070 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 26.09 09:53:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:53:10,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 21:53:10,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 21:53:10,771 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 21:53:10,772 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 26.09 09:53:10 BoogieIcfgContainer [2018-09-26 21:53:10,772 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:53:10,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:53:10,773 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:53:10,776 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:53:10,777 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 26.09 09:53:09" (1/2) ... [2018-09-26 21:53:10,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a172bc and model type pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:53:10, skipping insertion in model container [2018-09-26 21:53:10,778 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 26.09 09:53:10" (2/2) ... [2018-09-26 21:53:10,780 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl [2018-09-26 21:53:10,790 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:53:10,798 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 21:53:10,841 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:53:10,842 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:53:10,842 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:53:10,843 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:53:10,843 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:53:10,843 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:53:10,843 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:53:10,843 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:53:10,843 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:53:10,859 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-09-26 21:53:10,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 21:53:10,866 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:10,867 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:10,868 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:10,875 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:10,876 INFO L82 PathProgramCache]: Analyzing trace with hash 679324735, now seen corresponding path program 1 times [2018-09-26 21:53:10,878 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:10,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:10,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:10,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:10,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:11,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:53:11,118 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:11,119 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:53:11,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:11,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:11,136 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:11,138 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-09-26 21:53:11,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:11,257 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2018-09-26 21:53:11,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:11,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-26 21:53:11,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:11,271 INFO L225 Difference]: With dead ends: 48 [2018-09-26 21:53:11,272 INFO L226 Difference]: Without dead ends: 31 [2018-09-26 21:53:11,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:11,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-26 21:53:11,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-09-26 21:53:11,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 21:53:11,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-09-26 21:53:11,321 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 15 [2018-09-26 21:53:11,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:11,322 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2018-09-26 21:53:11,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:11,322 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2018-09-26 21:53:11,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 21:53:11,323 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:11,323 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:11,324 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:11,324 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:11,324 INFO L82 PathProgramCache]: Analyzing trace with hash 92518721, now seen corresponding path program 1 times [2018-09-26 21:53:11,324 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:11,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:11,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:11,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:11,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:11,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:53:11,429 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:11,430 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:53:11,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:11,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:11,432 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:11,433 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 3 states. [2018-09-26 21:53:11,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:11,550 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2018-09-26 21:53:11,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:11,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-26 21:53:11,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:11,554 INFO L225 Difference]: With dead ends: 85 [2018-09-26 21:53:11,554 INFO L226 Difference]: Without dead ends: 57 [2018-09-26 21:53:11,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:11,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-26 21:53:11,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-09-26 21:53:11,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-26 21:53:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2018-09-26 21:53:11,578 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 15 [2018-09-26 21:53:11,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:11,579 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2018-09-26 21:53:11,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:11,579 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2018-09-26 21:53:11,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 21:53:11,580 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:11,580 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:11,580 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:11,581 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:11,581 INFO L82 PathProgramCache]: Analyzing trace with hash 772577091, now seen corresponding path program 1 times [2018-09-26 21:53:11,581 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:11,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:11,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:11,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:11,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:11,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:53:11,705 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:11,705 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:53:11,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:11,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:11,706 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:11,706 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand 3 states. [2018-09-26 21:53:11,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:11,786 INFO L93 Difference]: Finished difference Result 163 states and 232 transitions. [2018-09-26 21:53:11,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:11,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-26 21:53:11,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:11,790 INFO L225 Difference]: With dead ends: 163 [2018-09-26 21:53:11,790 INFO L226 Difference]: Without dead ends: 109 [2018-09-26 21:53:11,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:11,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-26 21:53:11,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-09-26 21:53:11,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-26 21:53:11,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 150 transitions. [2018-09-26 21:53:11,818 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 150 transitions. Word has length 15 [2018-09-26 21:53:11,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:11,819 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 150 transitions. [2018-09-26 21:53:11,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:11,819 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 150 transitions. [2018-09-26 21:53:11,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 21:53:11,820 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:11,820 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:11,820 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:11,821 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:11,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1002430271, now seen corresponding path program 1 times [2018-09-26 21:53:11,821 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:11,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:11,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:11,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:11,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:11,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:53:11,902 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:11,902 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:53:11,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:11,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:11,903 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:11,904 INFO L87 Difference]: Start difference. First operand 107 states and 150 transitions. Second operand 3 states. [2018-09-26 21:53:12,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:12,124 INFO L93 Difference]: Finished difference Result 269 states and 378 transitions. [2018-09-26 21:53:12,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:12,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-26 21:53:12,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:12,134 INFO L225 Difference]: With dead ends: 269 [2018-09-26 21:53:12,135 INFO L226 Difference]: Without dead ends: 163 [2018-09-26 21:53:12,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:12,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-09-26 21:53:12,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2018-09-26 21:53:12,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-26 21:53:12,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 220 transitions. [2018-09-26 21:53:12,172 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 220 transitions. Word has length 15 [2018-09-26 21:53:12,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:12,173 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 220 transitions. [2018-09-26 21:53:12,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:12,173 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 220 transitions. [2018-09-26 21:53:12,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 21:53:12,174 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:12,174 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:12,174 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:12,174 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:12,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1000583229, now seen corresponding path program 1 times [2018-09-26 21:53:12,175 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:12,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:12,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:12,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:12,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:12,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:53:12,364 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:12,365 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:53:12,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 21:53:12,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 21:53:12,366 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:12,366 INFO L87 Difference]: Start difference. First operand 161 states and 220 transitions. Second operand 4 states. [2018-09-26 21:53:12,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:12,672 INFO L93 Difference]: Finished difference Result 293 states and 396 transitions. [2018-09-26 21:53:12,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 21:53:12,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-09-26 21:53:12,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:12,678 INFO L225 Difference]: With dead ends: 293 [2018-09-26 21:53:12,678 INFO L226 Difference]: Without dead ends: 291 [2018-09-26 21:53:12,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:12,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-09-26 21:53:12,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 177. [2018-09-26 21:53:12,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-26 21:53:12,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2018-09-26 21:53:12,731 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 15 [2018-09-26 21:53:12,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:12,731 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2018-09-26 21:53:12,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 21:53:12,731 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2018-09-26 21:53:12,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 21:53:12,733 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:12,733 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-09-26 21:53:12,734 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:12,734 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:12,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1080825333, now seen corresponding path program 1 times [2018-09-26 21:53:12,734 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:12,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:12,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:12,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:12,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:12,862 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:53:12,863 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:12,863 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:12,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:12,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:12,864 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:12,864 INFO L87 Difference]: Start difference. First operand 177 states and 232 transitions. Second operand 3 states. [2018-09-26 21:53:13,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:13,019 INFO L93 Difference]: Finished difference Result 525 states and 690 transitions. [2018-09-26 21:53:13,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:13,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-09-26 21:53:13,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:13,023 INFO L225 Difference]: With dead ends: 525 [2018-09-26 21:53:13,024 INFO L226 Difference]: Without dead ends: 351 [2018-09-26 21:53:13,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:13,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-09-26 21:53:13,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2018-09-26 21:53:13,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-09-26 21:53:13,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 448 transitions. [2018-09-26 21:53:13,112 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 448 transitions. Word has length 28 [2018-09-26 21:53:13,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:13,115 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 448 transitions. [2018-09-26 21:53:13,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:13,116 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 448 transitions. [2018-09-26 21:53:13,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 21:53:13,118 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:13,119 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-09-26 21:53:13,119 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:13,119 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:13,119 INFO L82 PathProgramCache]: Analyzing trace with hash 379760755, now seen corresponding path program 1 times [2018-09-26 21:53:13,120 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:13,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:13,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:13,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:13,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:13,279 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-26 21:53:13,279 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:53:13,279 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:53:13,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:13,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:53:14,083 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-26 21:53:14,115 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:53:14,115 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2018-09-26 21:53:14,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 21:53:14,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 21:53:14,116 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:14,119 INFO L87 Difference]: Start difference. First operand 349 states and 448 transitions. Second operand 5 states. [2018-09-26 21:53:15,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:15,109 INFO L93 Difference]: Finished difference Result 799 states and 1041 transitions. [2018-09-26 21:53:15,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 21:53:15,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-09-26 21:53:15,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:15,113 INFO L225 Difference]: With dead ends: 799 [2018-09-26 21:53:15,113 INFO L226 Difference]: Without dead ends: 557 [2018-09-26 21:53:15,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:15,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-09-26 21:53:15,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2018-09-26 21:53:15,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2018-09-26 21:53:15,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 688 transitions. [2018-09-26 21:53:15,216 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 688 transitions. Word has length 28 [2018-09-26 21:53:15,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:15,216 INFO L480 AbstractCegarLoop]: Abstraction has 557 states and 688 transitions. [2018-09-26 21:53:15,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 21:53:15,217 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 688 transitions. [2018-09-26 21:53:15,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-26 21:53:15,229 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:15,229 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-09-26 21:53:15,234 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:15,235 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:15,235 INFO L82 PathProgramCache]: Analyzing trace with hash 415408239, now seen corresponding path program 2 times [2018-09-26 21:53:15,235 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:15,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:15,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:15,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:15,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:15,653 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 43 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-09-26 21:53:15,653 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:53:15,653 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-09-26 21:53:15,671 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:53:15,780 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:53:15,781 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:53:15,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:53:16,763 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 41 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-09-26 21:53:16,801 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:53:16,801 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-09-26 21:53:16,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:53:16,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:53:16,802 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:16,802 INFO L87 Difference]: Start difference. First operand 557 states and 688 transitions. Second operand 8 states. [2018-09-26 21:53:20,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:20,203 INFO L93 Difference]: Finished difference Result 623 states and 764 transitions. [2018-09-26 21:53:20,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 21:53:20,204 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-09-26 21:53:20,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:20,204 INFO L225 Difference]: With dead ends: 623 [2018-09-26 21:53:20,204 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 21:53:20,206 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:20,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 21:53:20,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 21:53:20,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 21:53:20,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 21:53:20,206 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-09-26 21:53:20,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:20,207 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 21:53:20,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:53:20,207 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 21:53:20,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 21:53:20,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 21:53:22,390 WARN L178 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 87 DAG size of output: 57 [2018-09-26 21:53:23,432 WARN L178 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2018-09-26 21:53:23,672 WARN L178 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2018-09-26 21:53:23,908 WARN L178 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 41 [2018-09-26 21:53:24,343 WARN L178 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2018-09-26 21:53:24,661 WARN L178 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2018-09-26 21:53:25,278 WARN L178 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 43 [2018-09-26 21:53:25,523 WARN L178 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 41 [2018-09-26 21:53:25,815 WARN L178 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 43 [2018-09-26 21:53:26,294 WARN L178 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 57 [2018-09-26 21:53:26,479 WARN L178 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2018-09-26 21:53:26,784 WARN L178 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 50 [2018-09-26 21:53:27,066 WARN L178 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2018-09-26 21:53:27,080 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 375) no Hoare annotation was computed. [2018-09-26 21:53:27,081 INFO L422 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-09-26 21:53:27,081 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 66 376) no Hoare annotation was computed. [2018-09-26 21:53:27,081 INFO L422 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-09-26 21:53:27,081 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 66 376) no Hoare annotation was computed. [2018-09-26 21:53:27,081 INFO L422 ceAbstractionStarter]: At program point L251(lines 243 252) the Hoare annotation is: (let ((.cse10 (<= ULTIMATE.start_assert_~arg 1)) (.cse12 (<= 1 ULTIMATE.start_check_~tmp~83)) (.cse7 (not (= ~p1_new ~nomsg))) (.cse8 (<= 0 ~r1)) (.cse0 (<= ~r1 0)) (.cse14 (<= 1 ULTIMATE.start_assert_~arg)) (.cse9 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 0 ~send4)) (.cse11 (<= ~mode2 1)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (= ~mode4 (* 256 (div ~mode4 256)))) (.cse13 (<= 1 ~mode2)) (.cse3 (<= ~send1 127)) (.cse4 (<= ~send4 127))) (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 .cse10 .cse1 .cse2 .cse5 .cse12 .cse7 .cse8 .cse0 (exists ((v_prenex_2 Int)) (let ((.cse15 (mod v_prenex_2 256))) (and (<= .cse15 127) (= ~p4_old .cse15) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse3 .cse4 .cse14) (and .cse9 .cse1 .cse2 (<= ~r1 1) .cse11 .cse5 .cse6 (= ~mode1 (* 256 (div ~mode1 256))) .cse13 .cse3 .cse4))) [2018-09-26 21:53:27,081 INFO L422 ceAbstractionStarter]: At program point L367(lines 367 374) the Hoare annotation is: false [2018-09-26 21:53:27,082 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 66 376) no Hoare annotation was computed. [2018-09-26 21:53:27,082 INFO L422 ceAbstractionStarter]: At program point L256(lines 256 266) the Hoare annotation is: (let ((.cse10 (<= ULTIMATE.start_assert_~arg 1)) (.cse12 (<= 1 ULTIMATE.start_check_~tmp~83)) (.cse7 (not (= ~p1_new ~nomsg))) (.cse8 (<= 0 ~r1)) (.cse0 (<= ~r1 0)) (.cse14 (<= 1 ULTIMATE.start_assert_~arg)) (.cse9 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 0 ~send4)) (.cse11 (<= ~mode2 1)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (= ~mode4 (* 256 (div ~mode4 256)))) (.cse13 (<= 1 ~mode2)) (.cse3 (<= ~send1 127)) (.cse4 (<= ~send4 127))) (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 .cse10 .cse1 .cse2 .cse5 .cse12 .cse7 .cse8 .cse0 (exists ((v_prenex_2 Int)) (let ((.cse15 (mod v_prenex_2 256))) (and (<= .cse15 127) (= ~p4_old .cse15) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse3 .cse4 .cse14) (and .cse9 .cse1 .cse2 (<= ~r1 1) .cse11 .cse5 .cse6 (= ~mode1 (* 256 (div ~mode1 256))) .cse13 .cse3 .cse4))) [2018-09-26 21:53:27,082 INFO L422 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-09-26 21:53:27,082 INFO L422 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-09-26 21:53:27,083 INFO L422 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-09-26 21:53:27,083 INFO L422 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-09-26 21:53:27,083 INFO L422 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-09-26 21:53:27,084 INFO L422 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-09-26 21:53:27,084 INFO L422 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-09-26 21:53:27,084 INFO L422 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-09-26 21:53:27,084 INFO L422 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-09-26 21:53:27,093 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,094 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,094 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,095 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,103 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,104 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,104 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,104 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,107 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,107 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,107 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,108 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,110 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,110 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,111 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,111 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,113 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,113 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,114 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,114 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,116 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,116 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,116 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,117 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,118 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,118 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,119 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,119 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,121 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,121 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,121 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,122 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,124 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,124 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,124 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,125 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,127 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,127 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,127 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,127 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,129 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,130 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,130 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,130 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,132 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,132 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,133 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,133 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,134 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,135 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,135 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,135 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,137 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,137 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,137 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,138 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,139 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,139 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,140 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,140 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,141 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,142 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,142 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,142 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,144 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,145 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,145 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,145 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,147 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,147 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,147 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,147 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,149 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,150 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,150 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,150 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,152 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,152 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,153 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,153 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,154 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,155 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,155 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,155 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,157 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,158 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,158 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,158 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,160 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,160 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,160 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,160 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,161 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,161 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,161 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,161 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,163 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,163 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,163 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,164 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,164 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,164 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,165 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,165 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,166 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,166 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,167 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,167 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,168 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,168 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,168 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,169 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,171 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 26.09 09:53:27 BoogieIcfgContainer [2018-09-26 21:53:27,171 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:53:27,172 INFO L168 Benchmark]: Toolchain (without parser) took 17207.94 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 25.7 MB). Free memory was 1.5 GB in the beginning and 915.1 MB in the end (delta: 558.5 MB). Peak memory consumption was 584.1 MB. Max. memory is 7.1 GB. [2018-09-26 21:53:27,174 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:53:27,174 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.34 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:53:27,175 INFO L168 Benchmark]: Boogie Preprocessor took 51.62 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:53:27,175 INFO L168 Benchmark]: RCFGBuilder took 703.35 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-09-26 21:53:27,176 INFO L168 Benchmark]: TraceAbstraction took 16398.20 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 25.7 MB). Free memory was 1.4 GB in the beginning and 915.1 MB in the end (delta: 526.7 MB). Peak memory consumption was 552.4 MB. Max. memory is 7.1 GB. [2018-09-26 21:53:27,181 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.34 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 51.62 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 703.35 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 16398.20 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 25.7 MB). Free memory was 1.4 GB in the beginning and 915.1 MB in the end (delta: 526.7 MB). Peak memory consumption was 552.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_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_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] * 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-09-26 21:53:27,203 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,203 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,204 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,204 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,205 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,205 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,206 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,206 WARN L389 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) && 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)) || ((((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 0 <= ~send4) && ~r1 <= 1) && ~mode2 <= 1) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) - InvariantResult [Line: 265]: Loop Invariant [2018-09-26 21:53:27,207 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,207 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,207 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,211 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,212 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,212 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,215 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,215 WARN L389 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-09-26 21:53:27,216 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,219 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,219 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,219 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,220 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,221 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,221 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,222 WARN L389 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-09-26 21:53:27,223 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,223 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,223 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,224 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,224 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,225 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,225 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,225 WARN L389 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-09-26 21:53:27,226 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,226 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,227 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,227 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,230 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,230 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,230 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,231 WARN L389 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-09-26 21:53:27,232 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,232 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,232 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,232 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,233 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,235 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,236 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,236 WARN L389 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-09-26 21:53:27,237 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,240 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,241 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,241 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,242 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,242 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,244 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,244 WARN L389 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-09-26 21:53:27,245 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,245 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,246 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,247 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,248 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,248 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,248 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,248 WARN L389 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-09-26 21:53:27,249 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,249 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,250 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,250 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,254 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,254 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,255 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,255 WARN L389 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-09-26 21:53:27,257 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,257 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,257 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,258 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,259 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,260 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,260 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,260 WARN L389 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) && 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)) || ((((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 0 <= ~send4) && ~r1 <= 1) && ~mode2 <= 1) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) - InvariantResult [Line: 278]: Loop Invariant [2018-09-26 21:53:27,261 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,261 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,262 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,262 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,263 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,263 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,264 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,264 WARN L389 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-09-26 21:53:27,265 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,266 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,266 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,266 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,266 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,267 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,267 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,267 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,268 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,268 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,268 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,269 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,269 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,269 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,269 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,269 WARN L389 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-09-26 21:53:27,270 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,271 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,271 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,271 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,272 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,272 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,272 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-09-26 21:53:27,272 WARN L389 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, 16.2s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 5.4s AutomataDifference, 0.0s DeadEndRemovalTime, 6.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 215 SDtfs, 167 SDslu, 190 SDs, 0 SdLazy, 125 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s 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.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 124 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 82 NumberOfFragments, 1636 HoareAnnotationTreeSize, 14 FomulaSimplifications, 2001 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 14 FomulaSimplificationsInter, 7195 FormulaSimplificationTreeSizeReductionInter, 6.5s 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-09-26_21-53-27-282.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-09-26_21-53-27-282.csv Received shutdown request...