java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f-m [2018-10-04 14:31:47,957 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 14:31:47,959 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 14:31:47,971 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 14:31:47,972 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 14:31:47,973 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 14:31:47,974 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 14:31:47,978 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 14:31:47,981 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 14:31:47,982 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 14:31:47,983 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 14:31:47,983 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 14:31:47,984 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 14:31:47,986 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 14:31:47,987 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 14:31:47,988 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 14:31:47,988 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 14:31:47,990 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 14:31:47,992 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 14:31:47,994 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 14:31:47,995 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 14:31:47,996 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 14:31:47,998 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 14:31:47,999 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 14:31:47,999 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 14:31:48,000 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 14:31:48,001 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 14:31:48,002 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 14:31:48,003 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 14:31:48,004 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 14:31:48,004 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 14:31:48,005 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 14:31:48,005 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 14:31:48,005 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 14:31:48,006 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 14:31:48,007 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 14:31:48,007 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 14:31:48,022 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 14:31:48,022 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 14:31:48,023 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 14:31:48,023 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 14:31:48,024 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 14:31:48,024 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 14:31:48,024 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 14:31:48,024 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 14:31:48,025 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 14:31:48,025 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 14:31:48,025 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 14:31:48,025 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 14:31:48,025 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 14:31:48,026 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 14:31:48,026 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 14:31:48,026 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 14:31:48,026 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 14:31:48,026 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 14:31:48,027 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 14:31:48,027 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 14:31:48,027 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 14:31:48,027 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 14:31:48,027 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:31:48,028 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 14:31:48,028 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 14:31:48,028 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 14:31:48,028 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 14:31:48,028 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 14:31:48,028 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 14:31:48,029 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 14:31:48,029 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 14:31:48,099 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 14:31:48,117 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 14:31:48,124 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 14:31:48,126 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 14:31:48,127 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 14:31:48,128 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl [2018-10-04 14:31:48,128 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl' [2018-10-04 14:31:48,235 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 14:31:48,237 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 14:31:48,238 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 14:31:48,238 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 14:31:48,239 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 14:31:48,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:31:48" (1/1) ... [2018-10-04 14:31:48,282 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:31:48" (1/1) ... [2018-10-04 14:31:48,291 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 14:31:48,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 14:31:48,292 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 14:31:48,293 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 14:31:48,304 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:31:48" (1/1) ... [2018-10-04 14:31:48,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:31:48" (1/1) ... [2018-10-04 14:31:48,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:31:48" (1/1) ... [2018-10-04 14:31:48,309 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:31:48" (1/1) ... [2018-10-04 14:31:48,317 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:31:48" (1/1) ... [2018-10-04 14:31:48,319 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:31:48" (1/1) ... [2018-10-04 14:31:48,321 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:31:48" (1/1) ... [2018-10-04 14:31:48,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 14:31:48,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 14:31:48,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 14:31:48,326 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 14:31:48,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:31:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:31:48,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 14:31:48,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 14:31:49,026 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 14:31:49,026 INFO L202 PluginConnector]: Adding new model pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:31:49 BoogieIcfgContainer [2018-10-04 14:31:49,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 14:31:49,028 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 14:31:49,028 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 14:31:49,031 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 14:31:49,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:31:48" (1/2) ... [2018-10-04 14:31:49,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@524ef34b and model type pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 02:31:49, skipping insertion in model container [2018-10-04 14:31:49,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:31:49" (2/2) ... [2018-10-04 14:31:49,035 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl [2018-10-04 14:31:49,045 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 14:31:49,054 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 14:31:49,109 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 14:31:49,110 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 14:31:49,110 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 14:31:49,110 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 14:31:49,110 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 14:31:49,110 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 14:31:49,110 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 14:31:49,111 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 14:31:49,111 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 14:31:49,126 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-10-04 14:31:49,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:31:49,133 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:49,134 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:31:49,135 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:49,141 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:49,142 INFO L82 PathProgramCache]: Analyzing trace with hash 679324735, now seen corresponding path program 1 times [2018-10-04 14:31:49,144 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:49,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:49,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:49,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:49,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:49,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:31:49,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:49,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:31:49,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:31:49,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:31:49,419 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:49,421 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-10-04 14:31:49,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:49,453 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2018-10-04 14:31:49,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:31:49,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-04 14:31:49,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:49,468 INFO L225 Difference]: With dead ends: 48 [2018-10-04 14:31:49,468 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 14:31:49,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:31:49,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 14:31:49,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-10-04 14:31:49,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 14:31:49,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-10-04 14:31:49,515 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 15 [2018-10-04 14:31:49,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:49,516 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2018-10-04 14:31:49,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:31:49,516 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2018-10-04 14:31:49,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:31:49,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:49,517 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:31:49,517 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:49,518 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:49,518 INFO L82 PathProgramCache]: Analyzing trace with hash 92518721, now seen corresponding path program 1 times [2018-10-04 14:31:49,518 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:49,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:49,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:49,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:49,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:49,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:31:49,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:49,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:31:49,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:31:49,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:31:49,635 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:49,635 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 3 states. [2018-10-04 14:31:49,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:49,681 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2018-10-04 14:31:49,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:31:49,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-04 14:31:49,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:49,683 INFO L225 Difference]: With dead ends: 85 [2018-10-04 14:31:49,683 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 14:31:49,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:31:49,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 14:31:49,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-10-04 14:31:49,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-04 14:31:49,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2018-10-04 14:31:49,701 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 15 [2018-10-04 14:31:49,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:49,702 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2018-10-04 14:31:49,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:31:49,702 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2018-10-04 14:31:49,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:31:49,703 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:49,703 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:31:49,703 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:49,704 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:49,704 INFO L82 PathProgramCache]: Analyzing trace with hash 772577091, now seen corresponding path program 1 times [2018-10-04 14:31:49,704 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:49,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:49,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:49,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:49,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:49,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:31:49,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:49,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:31:49,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:31:49,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:31:49,804 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:49,805 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand 3 states. [2018-10-04 14:31:49,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:49,880 INFO L93 Difference]: Finished difference Result 163 states and 232 transitions. [2018-10-04 14:31:49,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:31:49,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-04 14:31:49,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:49,890 INFO L225 Difference]: With dead ends: 163 [2018-10-04 14:31:49,890 INFO L226 Difference]: Without dead ends: 109 [2018-10-04 14:31:49,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:31:49,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-04 14:31:49,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-10-04 14:31:49,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-04 14:31:49,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 150 transitions. [2018-10-04 14:31:49,928 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 150 transitions. Word has length 15 [2018-10-04 14:31:49,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:49,929 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 150 transitions. [2018-10-04 14:31:49,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:31:49,929 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 150 transitions. [2018-10-04 14:31:49,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:31:49,930 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:49,934 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:31:49,935 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:49,935 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:49,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1002430271, now seen corresponding path program 1 times [2018-10-04 14:31:49,935 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:49,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:49,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:49,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:49,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:50,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:31:50,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:50,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:31:50,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:31:50,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:31:50,037 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:50,037 INFO L87 Difference]: Start difference. First operand 107 states and 150 transitions. Second operand 3 states. [2018-10-04 14:31:50,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:50,115 INFO L93 Difference]: Finished difference Result 269 states and 378 transitions. [2018-10-04 14:31:50,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:31:50,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-04 14:31:50,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:50,122 INFO L225 Difference]: With dead ends: 269 [2018-10-04 14:31:50,125 INFO L226 Difference]: Without dead ends: 163 [2018-10-04 14:31:50,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:31:50,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-04 14:31:50,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2018-10-04 14:31:50,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-04 14:31:50,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 220 transitions. [2018-10-04 14:31:50,181 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 220 transitions. Word has length 15 [2018-10-04 14:31:50,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:50,181 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 220 transitions. [2018-10-04 14:31:50,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:31:50,182 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 220 transitions. [2018-10-04 14:31:50,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:31:50,182 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:50,183 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:31:50,184 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:50,184 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:50,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1000583229, now seen corresponding path program 1 times [2018-10-04 14:31:50,184 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:50,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:50,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:50,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:50,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:50,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:31:50,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:50,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 14:31:50,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 14:31:50,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 14:31:50,302 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:50,302 INFO L87 Difference]: Start difference. First operand 161 states and 220 transitions. Second operand 4 states. [2018-10-04 14:31:50,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:50,419 INFO L93 Difference]: Finished difference Result 293 states and 396 transitions. [2018-10-04 14:31:50,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 14:31:50,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-10-04 14:31:50,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:50,423 INFO L225 Difference]: With dead ends: 293 [2018-10-04 14:31:50,423 INFO L226 Difference]: Without dead ends: 291 [2018-10-04 14:31:50,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 3 [2018-10-04 14:31:50,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-10-04 14:31:50,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 177. [2018-10-04 14:31:50,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-04 14:31:50,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2018-10-04 14:31:50,493 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 15 [2018-10-04 14:31:50,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:50,494 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2018-10-04 14:31:50,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 14:31:50,497 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2018-10-04 14:31:50,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 14:31:50,498 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:50,499 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:31:50,499 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:50,500 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:50,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1080825333, now seen corresponding path program 1 times [2018-10-04 14:31:50,500 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:50,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:50,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:50,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:50,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:50,626 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:31:50,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:31:50,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:31:50,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:31:50,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:31:50,629 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:50,629 INFO L87 Difference]: Start difference. First operand 177 states and 232 transitions. Second operand 3 states. [2018-10-04 14:31:50,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:50,739 INFO L93 Difference]: Finished difference Result 525 states and 690 transitions. [2018-10-04 14:31:50,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:31:50,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-04 14:31:50,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:50,744 INFO L225 Difference]: With dead ends: 525 [2018-10-04 14:31:50,744 INFO L226 Difference]: Without dead ends: 351 [2018-10-04 14:31:50,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:31:50,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-10-04 14:31:50,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2018-10-04 14:31:50,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-10-04 14:31:50,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 448 transitions. [2018-10-04 14:31:50,815 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 448 transitions. Word has length 28 [2018-10-04 14:31:50,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:50,815 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 448 transitions. [2018-10-04 14:31:50,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:31:50,816 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 448 transitions. [2018-10-04 14:31:50,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 14:31:50,818 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:50,818 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:31:50,818 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:50,818 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:50,819 INFO L82 PathProgramCache]: Analyzing trace with hash 379760755, now seen corresponding path program 1 times [2018-10-04 14:31:50,819 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:50,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:50,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:50,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:50,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:50,988 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 14:31:50,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:31:50,989 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:31:51,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:51,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:31:52,025 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 14:31:52,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:31:52,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2018-10-04 14:31:52,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 14:31:52,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 14:31:52,061 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:52,062 INFO L87 Difference]: Start difference. First operand 349 states and 448 transitions. Second operand 5 states. [2018-10-04 14:31:52,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:52,440 INFO L93 Difference]: Finished difference Result 799 states and 1041 transitions. [2018-10-04 14:31:52,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 14:31:52,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-10-04 14:31:52,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:52,445 INFO L225 Difference]: With dead ends: 799 [2018-10-04 14:31:52,445 INFO L226 Difference]: Without dead ends: 557 [2018-10-04 14:31:52,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.1s impTime 3 [2018-10-04 14:31:52,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-10-04 14:31:52,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2018-10-04 14:31:52,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2018-10-04 14:31:52,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 688 transitions. [2018-10-04 14:31:52,583 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 688 transitions. Word has length 28 [2018-10-04 14:31:52,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:52,583 INFO L480 AbstractCegarLoop]: Abstraction has 557 states and 688 transitions. [2018-10-04 14:31:52,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 14:31:52,584 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 688 transitions. [2018-10-04 14:31:52,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-04 14:31:52,595 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:31:52,595 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 14:31:52,595 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:31:52,595 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:31:52,596 INFO L82 PathProgramCache]: Analyzing trace with hash 415408239, now seen corresponding path program 2 times [2018-10-04 14:31:52,596 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:31:52,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:31:52,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:52,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:31:52,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:31:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:31:52,986 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 43 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-04 14:31:52,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:31:52,987 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:31:53,003 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:31:53,113 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:31:53,113 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:31:53,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:31:53,900 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 41 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-04 14:31:53,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:31:53,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-10-04 14:31:53,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:31:53,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:31:53,933 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:31:53,934 INFO L87 Difference]: Start difference. First operand 557 states and 688 transitions. Second operand 8 states. [2018-10-04 14:31:56,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:31:56,312 INFO L93 Difference]: Finished difference Result 623 states and 764 transitions. [2018-10-04 14:31:56,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:31:56,313 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-10-04 14:31:56,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:31:56,313 INFO L225 Difference]: With dead ends: 623 [2018-10-04 14:31:56,313 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 14:31:56,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time 1.3s impTime 14 [2018-10-04 14:31:56,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 14:31:56,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 14:31:56,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 14:31:56,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 14:31:56,316 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-10-04 14:31:56,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:31:56,316 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 14:31:56,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:31:56,318 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 14:31:56,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 14:31:56,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 14:31:56,436 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 108 [2018-10-04 14:31:59,075 WARN L178 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 103 DAG size of output: 65 [2018-10-04 14:31:59,772 WARN L178 SmtUtils]: Spent 693.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2018-10-04 14:32:00,042 WARN L178 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2018-10-04 14:32:00,329 WARN L178 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 41 [2018-10-04 14:32:00,719 WARN L178 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2018-10-04 14:32:01,145 WARN L178 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2018-10-04 14:32:01,405 WARN L178 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 43 [2018-10-04 14:32:01,910 WARN L178 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 41 [2018-10-04 14:32:02,154 WARN L178 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 43 [2018-10-04 14:32:02,665 WARN L178 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 65 [2018-10-04 14:32:02,862 WARN L178 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2018-10-04 14:32:03,139 WARN L178 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 50 [2018-10-04 14:32:03,367 WARN L178 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2018-10-04 14:32:03,371 INFO L421 ceAbstractionStarter]: At program point L300(lines 300 311) the Hoare annotation is: (let ((.cse5 (<= ~r1 0)) (.cse0 (<= 0 ~send1)) (.cse1 (<= 0 ~send4)) (.cse7 (<= ~send1 127)) (.cse8 (<= ~send4 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (not (= ~p1_new ~nomsg))) (.cse4 (<= 0 ~r1))) (or (and (not (= ~p1_old ~nomsg)) (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 (<= ~mode2 1) .cse2 (<= 1 ULTIMATE.start_check_~tmp~83) .cse3 .cse4 .cse5 (exists ((v_prenex_2 Int)) (let ((.cse6 (mod v_prenex_2 256))) (and (<= .cse6 127) (= ~p4_old .cse6) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) (<= 1 ~mode2) .cse7 .cse8 (<= 1 ULTIMATE.start_assert_~arg)) (and .cse5 .cse0 .cse1 .cse7 .cse8 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse3 .cse4))) [2018-10-04 14:32:03,371 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 66 376) no Hoare annotation was computed. [2018-10-04 14:32:03,371 INFO L421 ceAbstractionStarter]: At program point L317(lines 310 318) the Hoare annotation is: (let ((.cse1 (<= 0 ~send1)) (.cse2 (<= 0 ~send4)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p1_new ~nomsg))) (.cse8 (<= 0 ~r1)) (.cse0 (<= ~r1 0)) (.cse3 (<= ~send1 127)) (.cse4 (<= ~send4 127))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (exists ((v_prenex_2 Int)) (let ((.cse7 (mod v_prenex_2 256))) (and (<= .cse7 127) (<= v_prenex_2 127) (<= 0 v_prenex_2) (= ~p4_new .cse7)))) .cse8) (and (not (= ~p1_old ~nomsg)) (<= ULTIMATE.start_assert_~arg 1) .cse1 .cse2 (<= ~mode2 1) .cse5 (<= 1 ULTIMATE.start_check_~tmp~83) (= ~mode4 (* 256 (div ~mode4 256))) .cse6 .cse8 .cse0 (exists ((v_prenex_2 Int)) (let ((.cse9 (mod v_prenex_2 256))) (and (<= .cse9 127) (= ~p4_old .cse9) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) (<= 1 ~mode2) .cse3 .cse4 (<= 1 ULTIMATE.start_assert_~arg)))) [2018-10-04 14:32:03,372 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 66 376) no Hoare annotation was computed. [2018-10-04 14:32:03,372 INFO L421 ceAbstractionStarter]: At program point L251(lines 243 252) the Hoare annotation is: (let ((.cse11 (<= ~mode2 1)) (.cse6 (= ~mode4 (* 256 (div ~mode4 256)))) (.cse13 (<= 1 ~mode2)) (.cse9 (not (= ~p1_old ~nomsg))) (.cse10 (<= ULTIMATE.start_assert_~arg 1)) (.cse1 (<= 0 ~send1)) (.cse2 (<= 0 ~send4)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse12 (<= 1 ULTIMATE.start_check_~tmp~83)) (.cse7 (not (= ~p1_new ~nomsg))) (.cse8 (<= 0 ~r1)) (.cse0 (<= ~r1 0)) (.cse3 (<= ~send1 127)) (.cse4 (<= ~send4 127)) (.cse14 (<= 1 ULTIMATE.start_assert_~arg))) (or (and .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse1 .cse2 .cse11 .cse5 .cse12 .cse6 .cse7 .cse8 .cse0 .cse13 .cse3 .cse4 .cse14) (and .cse9 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse15 (mod (+ v_~r1_9 1) 256))) (and (<= v_~r1_9 0) (<= ~r1 .cse15) (<= .cse15 127) (<= 0 v_~r1_9)))) .cse2 .cse11 .cse5 .cse6 (= ~mode1 (* 256 (div ~mode1 256))) .cse13 .cse3 .cse4) (and .cse9 .cse10 .cse1 .cse2 .cse5 .cse12 .cse7 .cse8 .cse0 (exists ((v_prenex_2 Int)) (let ((.cse16 (mod v_prenex_2 256))) (and (<= .cse16 127) (= ~p4_old .cse16) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse3 .cse4 .cse14))) [2018-10-04 14:32:03,372 INFO L421 ceAbstractionStarter]: At program point L367(lines 367 374) the Hoare annotation is: false [2018-10-04 14:32:03,372 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 66 376) no Hoare annotation was computed. [2018-10-04 14:32:03,372 INFO L421 ceAbstractionStarter]: At program point L256(lines 256 266) the Hoare annotation is: (let ((.cse11 (<= ~mode2 1)) (.cse6 (= ~mode4 (* 256 (div ~mode4 256)))) (.cse13 (<= 1 ~mode2)) (.cse9 (not (= ~p1_old ~nomsg))) (.cse10 (<= ULTIMATE.start_assert_~arg 1)) (.cse1 (<= 0 ~send1)) (.cse2 (<= 0 ~send4)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse12 (<= 1 ULTIMATE.start_check_~tmp~83)) (.cse7 (not (= ~p1_new ~nomsg))) (.cse8 (<= 0 ~r1)) (.cse0 (<= ~r1 0)) (.cse3 (<= ~send1 127)) (.cse4 (<= ~send4 127)) (.cse14 (<= 1 ULTIMATE.start_assert_~arg))) (or (and .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse1 .cse2 .cse11 .cse5 .cse12 .cse6 .cse7 .cse8 .cse0 .cse13 .cse3 .cse4 .cse14) (and .cse9 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse15 (mod (+ v_~r1_9 1) 256))) (and (<= v_~r1_9 0) (<= ~r1 .cse15) (<= .cse15 127) (<= 0 v_~r1_9)))) .cse2 .cse11 .cse5 .cse6 (= ~mode1 (* 256 (div ~mode1 256))) .cse13 .cse3 .cse4) (and .cse9 .cse10 .cse1 .cse2 .cse5 .cse12 .cse7 .cse8 .cse0 (exists ((v_prenex_2 Int)) (let ((.cse16 (mod v_prenex_2 256))) (and (<= .cse16 127) (= ~p4_old .cse16) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse3 .cse4 .cse14))) [2018-10-04 14:32:03,373 INFO L421 ceAbstractionStarter]: At program point L351(lines 346 352) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse2 (<= 0 ~send1)) (.cse4 (<= 0 ~send4)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (<= 1 ULTIMATE.start_check_~tmp~83)) (.cse9 (<= 0 ~r1)) (.cse1 (<= ~r1 0)) (.cse5 (<= ~send1 127)) (.cse6 (<= ~send4 127))) (or (and .cse0 .cse1 .cse2 (exists ((v_prenex_2 Int)) (let ((.cse3 (mod v_prenex_2 256))) (and (<= .cse3 127) (= ~p4_old .cse3) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (<= ULTIMATE.start_assert_~arg 1) .cse2 .cse4 (<= ~mode2 1) .cse7 .cse8 (= ~mode4 (* 256 (div ~mode4 256))) .cse9 .cse1 (<= 1 ~mode2) .cse5 .cse6 (<= 1 ULTIMATE.start_assert_~arg)))) [2018-10-04 14:32:03,373 INFO L421 ceAbstractionStarter]: At program point L273(lines 265 274) the Hoare annotation is: (let ((.cse1 (<= 0 ~send1)) (.cse2 (<= 0 ~send4)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p1_new ~nomsg))) (.cse7 (<= 0 ~r1)) (.cse0 (<= ~r1 0)) (.cse3 (<= ~send1 127)) (.cse4 (<= ~send4 127))) (or (and .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 (= ~mode4 (* 256 (div ~mode4 256))) .cse6 .cse7) (and (not (= ~p1_old ~nomsg)) (<= ULTIMATE.start_assert_~arg 1) .cse1 .cse2 (<= ~mode2 1) .cse5 (<= 1 ULTIMATE.start_check_~tmp~83) .cse6 .cse7 .cse0 (exists ((v_prenex_2 Int)) (let ((.cse8 (mod v_prenex_2 256))) (and (<= .cse8 127) (= ~p4_old .cse8) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) (<= 1 ~mode2) .cse3 .cse4 (<= 1 ULTIMATE.start_assert_~arg)))) [2018-10-04 14:32:03,373 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 375) no Hoare annotation was computed. [2018-10-04 14:32:03,373 INFO L421 ceAbstractionStarter]: At program point L331(lines 331 337) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse5 (<= ~r1 0)) (.cse1 (<= 0 ~send1)) (.cse2 (<= 0 ~send4)) (.cse6 (<= ~send1 127)) (.cse7 (<= ~send4 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~r1))) (or (and .cse0 (<= ULTIMATE.start_assert_~arg 1) .cse1 .cse2 (<= ~mode2 1) .cse3 (= ~mode4 (* 256 (div ~mode4 256))) .cse4 .cse5 (<= 1 ~mode2) .cse6 .cse7 (<= 1 ULTIMATE.start_assert_~arg)) (and .cse0 .cse5 .cse1 (exists ((v_prenex_2 Int)) (let ((.cse8 (mod v_prenex_2 256))) (and (<= .cse8 127) (= ~p4_old .cse8) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse2 .cse6 .cse7 .cse3 .cse4))) [2018-10-04 14:32:03,373 INFO L421 ceAbstractionStarter]: At program point L278(lines 278 288) the Hoare annotation is: (let ((.cse1 (<= 0 ~send1)) (.cse2 (<= 0 ~send4)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p1_new ~nomsg))) (.cse7 (<= 0 ~r1)) (.cse0 (<= ~r1 0)) (.cse3 (<= ~send1 127)) (.cse4 (<= ~send4 127))) (or (and .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 (= ~mode4 (* 256 (div ~mode4 256))) .cse6 .cse7) (and (not (= ~p1_old ~nomsg)) (<= ULTIMATE.start_assert_~arg 1) .cse1 .cse2 (<= ~mode2 1) .cse5 (<= 1 ULTIMATE.start_check_~tmp~83) .cse6 .cse7 .cse0 (exists ((v_prenex_2 Int)) (let ((.cse8 (mod v_prenex_2 256))) (and (<= .cse8 127) (= ~p4_old .cse8) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) (<= 1 ~mode2) .cse3 .cse4 (<= 1 ULTIMATE.start_assert_~arg)))) [2018-10-04 14:32:03,374 INFO L421 ceAbstractionStarter]: At program point L373(lines 226 373) the Hoare annotation is: (let ((.cse8 (not (= ~p1_old ~nomsg))) (.cse9 (<= ULTIMATE.start_assert_~arg 1)) (.cse1 (<= 0 ~send1)) (.cse2 (<= 0 ~send4)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse10 (<= 1 ULTIMATE.start_check_~tmp~83)) (.cse6 (= ~mode4 (* 256 (div ~mode4 256)))) (.cse7 (<= 0 ~r1)) (.cse0 (<= ~r1 0)) (.cse3 (<= ~send1 127)) (.cse4 (<= ~send4 127)) (.cse12 (<= 1 ULTIMATE.start_assert_~arg))) (or (and .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse1 .cse2 .cse5 .cse10 .cse7 .cse0 (exists ((v_prenex_2 Int)) (let ((.cse11 (mod v_prenex_2 256))) (and (<= .cse11 127) (= ~p4_old .cse11) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse3 .cse4 .cse12) (and .cse8 .cse9 .cse1 .cse2 (<= ~mode2 1) .cse5 .cse10 .cse6 .cse7 .cse0 (<= 1 ~mode2) .cse3 .cse4 .cse12))) [2018-10-04 14:32:03,374 INFO L421 ceAbstractionStarter]: At program point L340(lines 336 347) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse5 (<= ~r1 0)) (.cse1 (<= 0 ~send1)) (.cse2 (<= 0 ~send4)) (.cse6 (<= ~send1 127)) (.cse7 (<= ~send4 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~r1))) (or (and .cse0 (<= ULTIMATE.start_assert_~arg 1) .cse1 .cse2 (<= ~mode2 1) .cse3 (= ~mode4 (* 256 (div ~mode4 256))) .cse4 .cse5 (<= 1 ~mode2) .cse6 .cse7 (<= 1 ULTIMATE.start_assert_~arg)) (and .cse0 .cse5 .cse1 (exists ((v_prenex_2 Int)) (let ((.cse8 (mod v_prenex_2 256))) (and (<= .cse8 127) (= ~p4_old .cse8) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse2 .cse6 .cse7 .cse3 .cse4))) [2018-10-04 14:32:03,374 INFO L421 ceAbstractionStarter]: At program point L233(lines 233 244) the Hoare annotation is: (let ((.cse8 (not (= ~p1_old ~nomsg))) (.cse9 (<= ULTIMATE.start_assert_~arg 1)) (.cse1 (<= 0 ~send1)) (.cse2 (<= 0 ~send4)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse10 (<= 1 ULTIMATE.start_check_~tmp~83)) (.cse6 (= ~mode4 (* 256 (div ~mode4 256)))) (.cse7 (<= 0 ~r1)) (.cse0 (<= ~r1 0)) (.cse3 (<= ~send1 127)) (.cse4 (<= ~send4 127)) (.cse12 (<= 1 ULTIMATE.start_assert_~arg))) (or (and .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse1 .cse2 .cse5 .cse10 .cse7 .cse0 (exists ((v_prenex_2 Int)) (let ((.cse11 (mod v_prenex_2 256))) (and (<= .cse11 127) (= ~p4_old .cse11) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse3 .cse4 .cse12) (and .cse8 .cse9 .cse1 .cse2 (<= ~mode2 1) .cse5 .cse10 .cse6 .cse7 .cse0 (<= 1 ~mode2) .cse3 .cse4 .cse12))) [2018-10-04 14:32:03,374 INFO L421 ceAbstractionStarter]: At program point L361(lines 361 368) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= ULTIMATE.start_assert_~arg 1)) (.cse2 (<= 0 ~send1)) (.cse3 (<= 0 ~send4)) (.cse4 (= 0 (+ ~nomsg 1))) (.cse5 (<= 1 ULTIMATE.start_check_~tmp~83)) (.cse6 (<= 0 ~r1)) (.cse7 (<= ~r1 0)) (.cse9 (<= ~send1 127)) (.cse10 (<= ~send4 127)) (.cse11 (<= 1 ULTIMATE.start_assert_~arg))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (exists ((v_prenex_2 Int)) (let ((.cse8 (mod v_prenex_2 256))) (and (<= .cse8 127) (= ~p4_old .cse8) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 (<= ~mode2 1) .cse4 .cse5 (= ~mode4 (* 256 (div ~mode4 256))) .cse6 .cse7 (<= 1 ~mode2) .cse9 .cse10 .cse11))) [2018-10-04 14:32:03,374 INFO L421 ceAbstractionStarter]: At program point L295(lines 287 296) the Hoare annotation is: (let ((.cse5 (<= ~r1 0)) (.cse0 (<= 0 ~send1)) (.cse1 (<= 0 ~send4)) (.cse7 (<= ~send1 127)) (.cse8 (<= ~send4 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (not (= ~p1_new ~nomsg))) (.cse4 (<= 0 ~r1))) (or (and (not (= ~p1_old ~nomsg)) (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 (<= ~mode2 1) .cse2 (<= 1 ULTIMATE.start_check_~tmp~83) .cse3 .cse4 .cse5 (exists ((v_prenex_2 Int)) (let ((.cse6 (mod v_prenex_2 256))) (and (<= .cse6 127) (= ~p4_old .cse6) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) (<= 1 ~mode2) .cse7 .cse8 (<= 1 ULTIMATE.start_assert_~arg)) (and .cse5 .cse0 .cse1 .cse7 .cse8 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse3 .cse4))) [2018-10-04 14:32:03,385 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 14:32:03,386 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 14:32:03,386 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 14:32:03,386 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 14:32:03,387 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,387 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,388 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,388 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,396 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 14:32:03,396 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 14:32:03,397 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 14:32:03,397 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 14:32:03,398 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,398 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,398 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,398 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,401 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,402 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,402 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,402 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,404 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,405 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,405 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,405 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,407 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,408 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,408 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,408 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,410 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,411 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,411 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,411 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,413 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,413 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,413 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,413 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,415 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,415 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,416 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,416 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,418 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,418 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,419 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,419 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,421 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,421 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,422 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,422 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,424 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,424 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,425 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,425 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,427 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,427 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,428 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,428 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,430 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,430 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,431 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,431 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,433 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,433 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,433 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,433 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,435 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,435 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,436 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,436 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,437 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,438 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,438 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,438 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,440 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,440 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,440 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,441 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,442 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,443 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,443 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,443 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,446 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 14:32:03,446 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 14:32:03,446 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 14:32:03,447 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 14:32:03,447 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,447 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,448 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,448 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,451 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 14:32:03,451 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 14:32:03,452 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 14:32:03,452 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 14:32:03,452 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,453 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,453 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,453 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,455 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,455 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,455 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,456 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,461 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,461 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,461 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,462 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,463 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,464 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,464 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,464 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,464 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,465 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,465 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,465 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,469 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,470 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,470 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,470 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,471 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,471 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,471 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,471 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,475 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,476 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,476 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,476 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,477 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,477 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,477 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,480 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,482 INFO L202 PluginConnector]: Adding new model pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 02:32:03 BoogieIcfgContainer [2018-10-04 14:32:03,482 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 14:32:03,487 INFO L168 Benchmark]: Toolchain (without parser) took 15250.26 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 49.3 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 387.7 MB). Peak memory consumption was 490.8 MB. Max. memory is 7.1 GB. [2018-10-04 14:32:03,488 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:32:03,489 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.60 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:32:03,492 INFO L168 Benchmark]: Boogie Preprocessor took 32.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:32:03,493 INFO L168 Benchmark]: RCFGBuilder took 701.36 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-04 14:32:03,497 INFO L168 Benchmark]: TraceAbstraction took 14454.66 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 49.3 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 345.4 MB). Peak memory consumption was 448.5 MB. Max. memory is 7.1 GB. [2018-10-04 14:32:03,502 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.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 53.60 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 701.36 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14454.66 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 49.3 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 345.4 MB). Peak memory consumption was 448.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 375]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 243]: Loop Invariant [2018-10-04 14:32:03,529 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 14:32:03,530 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 14:32:03,530 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 14:32:03,530 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 14:32:03,530 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,531 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,531 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,531 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,532 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 14:32:03,532 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 14:32:03,533 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 14:32:03,533 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 14:32:03,533 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,533 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,534 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,534 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((((~r1 <= 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && !(~p1_new == ~nomsg)) && 0 <= ~r1) || ((((((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && ~mode4 == 256 * (~mode4 / 256)) && !(~p1_new == ~nomsg)) && 0 <= ~r1) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg)) || ((((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && (exists v_~r1_9 : int :: ((v_~r1_9 <= 0 && ~r1 <= (v_~r1_9 + 1) % 256) && (v_~r1_9 + 1) % 256 <= 127) && 0 <= v_~r1_9)) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127)) || ((((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && !(~p1_new == ~nomsg)) && 0 <= ~r1) && ~r1 <= 0) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) - InvariantResult [Line: 265]: Loop Invariant [2018-10-04 14:32:03,535 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,535 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,535 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,536 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,536 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,537 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,537 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,537 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((~r1 <= 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && !(~p1_new == ~nomsg)) && 0 <= ~r1) || ((((((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && !(~p1_new == ~nomsg)) && 0 <= ~r1) && ~r1 <= 0) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) - InvariantResult [Line: 287]: Loop Invariant [2018-10-04 14:32:03,538 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,538 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,538 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,539 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,539 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,539 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,540 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,540 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && !(~p1_new == ~nomsg)) && 0 <= ~r1) && ~r1 <= 0) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) || ((((((((~r1 <= 0 && 0 <= ~send1) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && !(~p1_new == ~nomsg)) && 0 <= ~r1) - InvariantResult [Line: 331]: Loop Invariant [2018-10-04 14:32:03,541 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,541 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,541 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,541 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,542 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,542 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,543 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,543 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) || ((((((((!(~p1_old == ~nomsg) && ~r1 <= 0) && 0 <= ~send1) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1) - InvariantResult [Line: 226]: Loop Invariant [2018-10-04 14:32:03,544 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,544 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,544 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,544 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,545 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,545 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,546 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,546 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((~r1 <= 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) || (((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && 0 <= ~r1) && ~r1 <= 0) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg)) || (((((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) - InvariantResult [Line: 233]: Loop Invariant [2018-10-04 14:32:03,547 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,547 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,547 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,547 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,548 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,548 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,549 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,549 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((~r1 <= 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) || (((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && 0 <= ~r1) && ~r1 <= 0) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg)) || (((((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) - InvariantResult [Line: 346]: Loop Invariant [2018-10-04 14:32:03,550 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,550 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,550 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,550 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,551 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,551 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,551 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,552 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((!(~p1_old == ~nomsg) && ~r1 <= 0) && 0 <= ~send1) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && 0 <= ~r1) || (((((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) - InvariantResult [Line: 336]: Loop Invariant [2018-10-04 14:32:03,552 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,553 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,553 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,553 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,554 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,554 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,554 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,554 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) || ((((((((!(~p1_old == ~nomsg) && ~r1 <= 0) && 0 <= ~send1) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1) - InvariantResult [Line: 361]: Loop Invariant [2018-10-04 14:32:03,555 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,555 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,555 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,556 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,556 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,556 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,557 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,557 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && 0 <= ~r1) && ~r1 <= 0) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) || (((((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~r1) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) - InvariantResult [Line: 256]: Loop Invariant [2018-10-04 14:32:03,558 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 14:32:03,558 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 14:32:03,558 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 14:32:03,558 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 14:32:03,559 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,559 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,559 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,559 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,560 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 14:32:03,561 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 14:32:03,561 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 14:32:03,561 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 14:32:03,561 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,561 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,562 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,562 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((((~r1 <= 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && !(~p1_new == ~nomsg)) && 0 <= ~r1) || ((((((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && ~mode4 == 256 * (~mode4 / 256)) && !(~p1_new == ~nomsg)) && 0 <= ~r1) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg)) || ((((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && (exists v_~r1_9 : int :: ((v_~r1_9 <= 0 && ~r1 <= (v_~r1_9 + 1) % 256) && (v_~r1_9 + 1) % 256 <= 127) && 0 <= v_~r1_9)) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127)) || ((((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && !(~p1_new == ~nomsg)) && 0 <= ~r1) && ~r1 <= 0) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) - InvariantResult [Line: 278]: Loop Invariant [2018-10-04 14:32:03,563 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,563 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,563 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,563 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,564 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,564 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,564 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,565 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((~r1 <= 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && !(~p1_new == ~nomsg)) && 0 <= ~r1) || ((((((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && !(~p1_new == ~nomsg)) && 0 <= ~r1) && ~r1 <= 0) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) - InvariantResult [Line: 310]: Loop Invariant [2018-10-04 14:32:03,565 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,566 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,566 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,566 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,566 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,566 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,567 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,567 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,567 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,568 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,568 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,568 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,568 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,568 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,569 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,569 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((~r1 <= 0 && 0 <= ~send1) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p1_new == ~nomsg)) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && v_prenex_2 <= 127) && 0 <= v_prenex_2) && ~p4_new == v_prenex_2 % 256)) && 0 <= ~r1) || (((((((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && ~mode4 == 256 * (~mode4 / 256)) && !(~p1_new == ~nomsg)) && 0 <= ~r1) && ~r1 <= 0) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) - InvariantResult [Line: 300]: Loop Invariant [2018-10-04 14:32:03,570 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,570 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,570 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,570 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,571 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,571 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,571 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 14:32:03,571 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && 0 <= ~send1) && 0 <= ~send4) && ~mode2 <= 1) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && !(~p1_new == ~nomsg)) && 0 <= ~r1) && ~r1 <= 0) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) || ((((((((~r1 <= 0 && 0 <= ~send1) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && !(~p1_new == ~nomsg)) && 0 <= ~r1) - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. SAFE Result, 14.2s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 7.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 215 SDtfs, 185 SDslu, 174 SDs, 0 SdLazy, 120 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=557occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 124 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 82 NumberOfFragments, 1674 HoareAnnotationTreeSize, 14 FomulaSimplifications, 2001 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 14 FomulaSimplificationsInter, 7309 FormulaSimplificationTreeSizeReductionInter, 6.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 257 ConstructedInterpolants, 15 QuantifiedInterpolants, 105206 SizeOfPredicates, 5 NumberOfNonLiveVariables, 676 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 173/195 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_14-32-03-583.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_14-32-03-583.csv Received shutdown request...