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-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-00a8621 [2018-09-30 10:53:42,590 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:53:42,592 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:53:42,603 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:53:42,604 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:53:42,605 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:53:42,606 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:53:42,608 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:53:42,609 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:53:42,610 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:53:42,611 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:53:42,611 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:53:42,612 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:53:42,613 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:53:42,614 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:53:42,615 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:53:42,616 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:53:42,618 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:53:42,620 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:53:42,622 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:53:42,623 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:53:42,624 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:53:42,627 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:53:42,627 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:53:42,627 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:53:42,628 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:53:42,629 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:53:42,630 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:53:42,631 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:53:42,632 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:53:42,632 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:53:42,633 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:53:42,633 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:53:42,634 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:53:42,635 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:53:42,636 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:53:42,636 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-09-30 10:53:42,663 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:53:42,663 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:53:42,664 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:53:42,668 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:53:42,669 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:53:42,670 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:53:42,670 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:53:42,670 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:53:42,670 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:53:42,670 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:53:42,671 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:53:42,671 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:53:42,671 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:53:42,671 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:53:42,671 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:53:42,673 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:53:42,674 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:53:42,674 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:53:42,674 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:53:42,674 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:53:42,676 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:53:42,676 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:53:42,676 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:53:42,676 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:53:42,676 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:53:42,677 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:53:42,677 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:53:42,677 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:53:42,677 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:53:42,677 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:53:42,677 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 10:53:42,740 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:53:42,753 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:53:42,757 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:53:42,759 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:53:42,759 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:53:42,760 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl [2018-09-30 10:53:42,760 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl' [2018-09-30 10:53:42,834 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:53:42,838 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:53:42,839 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:53:42,839 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:53:42,840 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:53:42,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:53:42" (1/1) ... [2018-09-30 10:53:42,878 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:53:42" (1/1) ... [2018-09-30 10:53:42,886 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:53:42,887 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:53:42,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:53:42,887 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:53:42,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:53:42" (1/1) ... [2018-09-30 10:53:42,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:53:42" (1/1) ... [2018-09-30 10:53:42,902 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:53:42" (1/1) ... [2018-09-30 10:53:42,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:53:42" (1/1) ... [2018-09-30 10:53:42,909 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:53:42" (1/1) ... [2018-09-30 10:53:42,912 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:53:42" (1/1) ... [2018-09-30 10:53:42,914 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:53:42" (1/1) ... [2018-09-30 10:53:42,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:53:42,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:53:42,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:53:42,919 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:53:42,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:53:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:53:43,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 10:53:43,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 10:53:43,491 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 10:53:43,492 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:53:43 BoogieIcfgContainer [2018-09-30 10:53:43,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:53:43,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:53:43,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:53:43,497 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:53:43,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:53:42" (1/2) ... [2018-09-30 10:53:43,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84827f3 and model type pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:53:43, skipping insertion in model container [2018-09-30 10:53:43,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:53:43" (2/2) ... [2018-09-30 10:53:43,500 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl [2018-09-30 10:53:43,510 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:53:43,518 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 10:53:43,568 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:53:43,569 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:53:43,569 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:53:43,569 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:53:43,569 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:53:43,570 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:53:43,570 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:53:43,570 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:53:43,570 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:53:43,585 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2018-09-30 10:53:43,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:53:43,592 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:53:43,593 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:53:43,594 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:53:43,601 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:53:43,602 INFO L82 PathProgramCache]: Analyzing trace with hash -100896173, now seen corresponding path program 1 times [2018-09-30 10:53:43,604 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:53:43,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:53:43,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:53:43,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:53:43,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:53:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:53:43,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:53:43,842 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:53:43,842 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:53:43,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:53:43,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:53:43,858 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:53:43,860 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2018-09-30 10:53:43,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:53:43,970 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2018-09-30 10:53:43,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:53:43,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-09-30 10:53:43,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:53:43,984 INFO L225 Difference]: With dead ends: 39 [2018-09-30 10:53:43,984 INFO L226 Difference]: Without dead ends: 25 [2018-09-30 10:53:43,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:53:44,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-30 10:53:44,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-09-30 10:53:44,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-30 10:53:44,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2018-09-30 10:53:44,030 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 12 [2018-09-30 10:53:44,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:53:44,031 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2018-09-30 10:53:44,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:53:44,031 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2018-09-30 10:53:44,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:53:44,032 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:53:44,032 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:53:44,033 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:53:44,033 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:53:44,033 INFO L82 PathProgramCache]: Analyzing trace with hash -43637871, now seen corresponding path program 1 times [2018-09-30 10:53:44,033 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:53:44,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:53:44,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:53:44,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:53:44,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:53:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:53:44,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:53:44,144 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:53:44,144 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:53:44,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:53:44,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:53:44,146 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:53:44,146 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 3 states. [2018-09-30 10:53:44,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:53:44,254 INFO L93 Difference]: Finished difference Result 67 states and 91 transitions. [2018-09-30 10:53:44,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:53:44,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-09-30 10:53:44,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:53:44,256 INFO L225 Difference]: With dead ends: 67 [2018-09-30 10:53:44,257 INFO L226 Difference]: Without dead ends: 45 [2018-09-30 10:53:44,257 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:53:44,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-30 10:53:44,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-09-30 10:53:44,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-30 10:53:44,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2018-09-30 10:53:44,270 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 12 [2018-09-30 10:53:44,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:53:44,270 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2018-09-30 10:53:44,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:53:44,271 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2018-09-30 10:53:44,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:53:44,272 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:53:44,272 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:53:44,272 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:53:44,272 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:53:44,273 INFO L82 PathProgramCache]: Analyzing trace with hash -43697453, now seen corresponding path program 1 times [2018-09-30 10:53:44,273 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:53:44,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:53:44,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:53:44,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:53:44,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:53:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:53:44,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:53:44,488 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:53:44,488 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:53:44,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:53:44,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:53:44,489 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:53:44,489 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 4 states. [2018-09-30 10:53:44,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:53:44,905 INFO L93 Difference]: Finished difference Result 78 states and 103 transitions. [2018-09-30 10:53:44,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:53:44,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-09-30 10:53:44,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:53:44,908 INFO L225 Difference]: With dead ends: 78 [2018-09-30 10:53:44,909 INFO L226 Difference]: Without dead ends: 76 [2018-09-30 10:53:44,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:53:44,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-30 10:53:44,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 47. [2018-09-30 10:53:44,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-30 10:53:44,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2018-09-30 10:53:44,947 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 12 [2018-09-30 10:53:44,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:53:44,948 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2018-09-30 10:53:44,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:53:44,948 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2018-09-30 10:53:44,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:53:44,949 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:53:44,955 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:53:44,959 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:53:44,959 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:53:44,959 INFO L82 PathProgramCache]: Analyzing trace with hash -436664881, now seen corresponding path program 1 times [2018-09-30 10:53:44,959 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:53:44,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:53:44,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:53:44,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:53:44,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:53:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:53:45,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:53:45,017 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:53:45,018 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:53:45,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:53:45,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:53:45,019 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:53:45,019 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand 3 states. [2018-09-30 10:53:45,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:53:45,113 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2018-09-30 10:53:45,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:53:45,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-09-30 10:53:45,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:53:45,117 INFO L225 Difference]: With dead ends: 101 [2018-09-30 10:53:45,117 INFO L226 Difference]: Without dead ends: 75 [2018-09-30 10:53:45,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:53:45,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-30 10:53:45,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-09-30 10:53:45,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-30 10:53:45,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 93 transitions. [2018-09-30 10:53:45,141 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 93 transitions. Word has length 12 [2018-09-30 10:53:45,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:53:45,141 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 93 transitions. [2018-09-30 10:53:45,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:53:45,141 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2018-09-30 10:53:45,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-30 10:53:45,142 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:53:45,143 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:53:45,143 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:53:45,143 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:53:45,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1645106231, now seen corresponding path program 1 times [2018-09-30 10:53:45,144 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:53:45,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:53:45,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:53:45,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:53:45,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:53:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:53:45,282 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:53:45,283 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:53:45,283 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:53:45,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:53:45,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:53:45,284 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:53:45,284 INFO L87 Difference]: Start difference. First operand 73 states and 93 transitions. Second operand 3 states. [2018-09-30 10:53:45,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:53:45,396 INFO L93 Difference]: Finished difference Result 213 states and 273 transitions. [2018-09-30 10:53:45,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:53:45,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-09-30 10:53:45,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:53:45,405 INFO L225 Difference]: With dead ends: 213 [2018-09-30 10:53:45,406 INFO L226 Difference]: Without dead ends: 143 [2018-09-30 10:53:45,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:53:45,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-30 10:53:45,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-09-30 10:53:45,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-30 10:53:45,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 176 transitions. [2018-09-30 10:53:45,443 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 176 transitions. Word has length 22 [2018-09-30 10:53:45,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:53:45,444 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 176 transitions. [2018-09-30 10:53:45,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:53:45,444 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 176 transitions. [2018-09-30 10:53:45,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-30 10:53:45,445 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:53:45,445 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:53:45,446 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:53:45,446 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:53:45,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1840514439, now seen corresponding path program 1 times [2018-09-30 10:53:45,446 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:53:45,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:53:45,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:53:45,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:53:45,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:53:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:53:45,573 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:53:45,573 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:53:45,573 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:53:45,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:53:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:53:45,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:53:46,360 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:53:46,393 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:53:46,393 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-09-30 10:53:46,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:53:46,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:53:46,394 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:53:46,395 INFO L87 Difference]: Start difference. First operand 141 states and 176 transitions. Second operand 7 states. [2018-09-30 10:53:47,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:53:47,365 INFO L93 Difference]: Finished difference Result 296 states and 368 transitions. [2018-09-30 10:53:47,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:53:47,367 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-09-30 10:53:47,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:53:47,369 INFO L225 Difference]: With dead ends: 296 [2018-09-30 10:53:47,369 INFO L226 Difference]: Without dead ends: 158 [2018-09-30 10:53:47,370 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:53:47,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-30 10:53:47,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 113. [2018-09-30 10:53:47,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-30 10:53:47,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 142 transitions. [2018-09-30 10:53:47,438 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 142 transitions. Word has length 22 [2018-09-30 10:53:47,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:53:47,438 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 142 transitions. [2018-09-30 10:53:47,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:53:47,439 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 142 transitions. [2018-09-30 10:53:47,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-30 10:53:47,441 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:53:47,442 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:53:47,442 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:53:47,442 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:53:47,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1783256137, now seen corresponding path program 1 times [2018-09-30 10:53:47,444 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:53:47,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:53:47,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:53:47,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:53:47,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:53:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:53:47,572 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:53:47,573 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:53:47,573 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:53:47,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:53:47,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:53:47,574 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:53:47,575 INFO L87 Difference]: Start difference. First operand 113 states and 142 transitions. Second operand 3 states. [2018-09-30 10:53:47,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:53:47,807 INFO L93 Difference]: Finished difference Result 259 states and 322 transitions. [2018-09-30 10:53:47,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:53:47,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-09-30 10:53:47,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:53:47,810 INFO L225 Difference]: With dead ends: 259 [2018-09-30 10:53:47,810 INFO L226 Difference]: Without dead ends: 121 [2018-09-30 10:53:47,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:53:47,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-09-30 10:53:47,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2018-09-30 10:53:47,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-30 10:53:47,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 133 transitions. [2018-09-30 10:53:47,866 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 133 transitions. Word has length 22 [2018-09-30 10:53:47,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:53:47,866 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 133 transitions. [2018-09-30 10:53:47,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:53:47,866 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 133 transitions. [2018-09-30 10:53:47,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-30 10:53:47,867 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:53:47,870 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:53:47,870 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:53:47,870 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:53:47,870 INFO L82 PathProgramCache]: Analyzing trace with hash -655716359, now seen corresponding path program 2 times [2018-09-30 10:53:47,871 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:53:47,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:53:47,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:53:47,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:53:47,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:53:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:53:47,968 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-09-30 10:53:47,968 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:53:47,968 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:53:47,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:53:47,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:53:47,969 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:53:47,970 INFO L87 Difference]: Start difference. First operand 111 states and 133 transitions. Second operand 3 states. [2018-09-30 10:53:47,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:53:47,977 INFO L93 Difference]: Finished difference Result 113 states and 135 transitions. [2018-09-30 10:53:47,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:53:47,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-09-30 10:53:47,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:53:47,977 INFO L225 Difference]: With dead ends: 113 [2018-09-30 10:53:47,978 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 10:53:47,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:53:47,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 10:53:47,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 10:53:47,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 10:53:47,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 10:53:47,981 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-09-30 10:53:47,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:53:47,982 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 10:53:47,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:53:47,982 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 10:53:47,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 10:53:47,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 10:53:48,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:53:48,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:53:48,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:53:48,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:53:48,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:53:48,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:53:48,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:53:48,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:53:48,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:53:48,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:53:48,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:53:48,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:53:48,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:53:48,963 WARN L178 SmtUtils]: Spent 772.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2018-09-30 10:53:49,626 WARN L178 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2018-09-30 10:53:50,169 WARN L178 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2018-09-30 10:53:50,533 WARN L178 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2018-09-30 10:53:50,766 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 30 [2018-09-30 10:53:50,886 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2018-09-30 10:53:51,013 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 38 [2018-09-30 10:53:51,213 WARN L178 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 38 [2018-09-30 10:53:51,283 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 57 313) no Hoare annotation was computed. [2018-09-30 10:53:51,284 INFO L422 ceAbstractionStarter]: At program point L250(lines 250 260) the Hoare annotation is: (let ((.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (<= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) (<= 1 ~mode2) (<= ~mode2 1) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= ~p2_new .cse0) (<= 0 v_prenex_1)))) .cse1 .cse2 .cse3) (and (<= ~mode3 1) (and .cse1 .cse2 (and .cse3 (exists ((v_prenex_1 Int)) (let ((.cse4 (mod v_prenex_1 256))) (and (<= .cse4 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse4 ~p2_old)))))) (<= 1 ~mode3)))) [2018-09-30 10:53:51,285 INFO L422 ceAbstractionStarter]: At program point L310(lines 200 310) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (<= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2) (and (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) (and .cse2 (exists ((v_prenex_1 Int)) (let ((.cse3 (mod v_prenex_1 256))) (and (<= .cse3 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse3 ~p2_old)))))))) [2018-09-30 10:53:51,285 INFO L422 ceAbstractionStarter]: At program point L277(lines 277 284) the Hoare annotation is: (and (<= ~r1 0) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse0 ~p2_old))))) [2018-09-30 10:53:51,285 INFO L422 ceAbstractionStarter]: At program point L304(lines 304 311) the Hoare annotation is: false [2018-09-30 10:53:51,285 INFO L422 ceAbstractionStarter]: At program point L207(lines 207 215) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (<= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2) (and (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) (and .cse2 (exists ((v_prenex_1 Int)) (let ((.cse3 (mod v_prenex_1 256))) (and (<= .cse3 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse3 ~p2_old)))))))) [2018-09-30 10:53:51,285 INFO L422 ceAbstractionStarter]: At program point L298(lines 298 305) the Hoare annotation is: (and (<= 1 ULTIMATE.start_check_~tmp~75) (= ULTIMATE.start_assert_~arg 1) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse0 ~p2_old))))) [2018-09-30 10:53:51,286 INFO L422 ceAbstractionStarter]: At program point L265(lines 259 266) the Hoare annotation is: (and (<= ~r1 0) (<= 1 ~mode2) (<= ~mode2 1) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= ~p2_new .cse0) (<= 0 v_prenex_1)))) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-09-30 10:53:51,286 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 312) no Hoare annotation was computed. [2018-09-30 10:53:51,286 INFO L422 ceAbstractionStarter]: At program point L288(lines 283 289) the Hoare annotation is: (and (<= 1 ULTIMATE.start_check_~tmp~75) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse0 ~p2_old))))) [2018-09-30 10:53:51,287 INFO L422 ceAbstractionStarter]: At program point L222(lines 214 223) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (and (<= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2) (= ~mode2 (* 256 (div ~mode2 256)))) (and (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) (and .cse2 (exists ((v_prenex_1 Int)) (let ((.cse3 (mod v_prenex_1 256))) (and (<= .cse3 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse3 ~p2_old)))))))) [2018-09-30 10:53:51,287 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 57 313) no Hoare annotation was computed. [2018-09-30 10:53:51,287 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 57 313) no Hoare annotation was computed. [2018-09-30 10:53:51,287 INFO L422 ceAbstractionStarter]: At program point L245(lines 236 246) the Hoare annotation is: (let ((.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (<= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) (<= 1 ~mode2) (<= ~mode2 1) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= ~p2_new .cse0) (<= 0 v_prenex_1)))) .cse1 .cse2 .cse3) (and (<= ~mode3 1) (and .cse1 .cse2 (and .cse3 (exists ((v_prenex_1 Int)) (let ((.cse4 (mod v_prenex_1 256))) (and (<= .cse4 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse4 ~p2_old)))))) (<= 1 ~mode3)))) [2018-09-30 10:53:51,288 INFO L422 ceAbstractionStarter]: At program point L227(lines 227 237) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (and (<= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2) (= ~mode2 (* 256 (div ~mode2 256)))) (and (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) (and .cse2 (exists ((v_prenex_1 Int)) (let ((.cse3 (mod v_prenex_1 256))) (and (<= .cse3 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse3 ~p2_old)))))))) [2018-09-30 10:53:51,295 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,296 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,296 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,297 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,304 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,304 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,305 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,305 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,308 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,308 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,308 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,309 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,309 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,309 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,310 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,310 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,312 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,312 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,312 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,313 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,313 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,313 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,314 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,314 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,315 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,316 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,316 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,316 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,317 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,318 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,318 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,318 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,320 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,320 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,321 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,321 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,321 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,322 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,322 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,322 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,324 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,325 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,325 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,325 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,326 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,326 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,326 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,326 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,328 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,328 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,328 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,329 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,332 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,333 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,333 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,333 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,337 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,338 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,338 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,338 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,339 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,340 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,340 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,340 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,343 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,347 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,347 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,347 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,349 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,349 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,349 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,349 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,353 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,353 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,353 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,353 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,356 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,357 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,357 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,357 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,359 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,359 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,359 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,359 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,364 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,364 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,364 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,364 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,365 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,366 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,366 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,366 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,367 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,368 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,368 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,368 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,371 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:53:51 BoogieIcfgContainer [2018-09-30 10:53:51,371 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:53:51,372 INFO L168 Benchmark]: Toolchain (without parser) took 8537.46 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 383.3 MB). Peak memory consumption was 383.3 MB. Max. memory is 7.1 GB. [2018-09-30 10:53:51,377 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:53:51,377 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.44 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:53:51,378 INFO L168 Benchmark]: Boogie Preprocessor took 30.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:53:51,382 INFO L168 Benchmark]: RCFGBuilder took 574.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-30 10:53:51,384 INFO L168 Benchmark]: TraceAbstraction took 7878.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 351.6 MB). Peak memory consumption was 351.6 MB. Max. memory is 7.1 GB. [2018-09-30 10:53:51,392 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.44 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 574.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7878.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 351.6 MB). Peak memory consumption was 351.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 312]: 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: 207]: Loop Invariant [2018-09-30 10:53:51,407 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,407 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,407 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,408 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,408 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,409 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,409 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,409 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((~r1 <= 0 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) || ((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old)) - InvariantResult [Line: 250]: Loop Invariant [2018-09-30 10:53:51,410 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,410 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,411 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,411 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,411 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,412 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,412 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,412 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,413 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,413 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,413 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,413 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,414 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,414 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,414 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,414 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((~r1 <= 0 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) || ((~mode3 <= 1 && (~send2 <= 127 && 0 <= ~send2) && 0 == ~nomsg + 1 && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old)) && 1 <= ~mode3) - InvariantResult [Line: 298]: Loop Invariant [2018-09-30 10:53:51,415 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,415 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,416 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,416 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,416 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,417 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,417 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,417 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((1 <= check_~tmp~75 && assert_~arg == 1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old) - InvariantResult [Line: 236]: Loop Invariant [2018-09-30 10:53:51,418 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,418 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,418 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,419 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,419 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,419 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,419 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,419 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,420 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,420 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,421 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,421 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,421 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,421 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,422 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,422 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((~r1 <= 0 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) || ((~mode3 <= 1 && (~send2 <= 127 && 0 <= ~send2) && 0 == ~nomsg + 1 && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old)) && 1 <= ~mode3) - InvariantResult [Line: 277]: Loop Invariant [2018-09-30 10:53:51,423 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,423 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,423 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,423 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,424 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,424 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,424 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,425 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((~r1 <= 0 && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old) - InvariantResult [Line: 283]: Loop Invariant [2018-09-30 10:53:51,425 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,426 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,426 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,426 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,427 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,427 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,427 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,427 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= check_~tmp~75 && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old) - InvariantResult [Line: 200]: Loop Invariant [2018-09-30 10:53:51,428 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,428 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,428 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,429 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,433 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,433 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,433 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,433 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((~r1 <= 0 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) || ((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old)) - InvariantResult [Line: 227]: Loop Invariant [2018-09-30 10:53:51,435 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,435 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,435 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,435 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,437 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,438 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,438 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,438 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((~r1 <= 0 && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~mode2 == 256 * (~mode2 / 256)) || ((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old)) - InvariantResult [Line: 304]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 214]: Loop Invariant [2018-09-30 10:53:51,440 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,440 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,441 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,441 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,442 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,443 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,443 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,443 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((~r1 <= 0 && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~mode2 == 256 * (~mode2 / 256)) || ((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old)) - InvariantResult [Line: 259]: Loop Invariant [2018-09-30 10:53:51,444 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,444 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,445 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,445 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,446 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,447 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,447 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:53:51,447 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((~r1 <= 0 && 1 <= ~mode2) && ~mode2 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 1 error locations. SAFE Result, 7.7s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 3.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 157 SDtfs, 95 SDslu, 117 SDs, 0 SdLazy, 65 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=5, 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.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 92 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 11 PreInvPairs, 43 NumberOfFragments, 666 HoareAnnotationTreeSize, 11 FomulaSimplifications, 3910 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 11 FomulaSimplificationsInter, 957 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 158 NumberOfCodeBlocks, 158 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 149 ConstructedInterpolants, 12 QuantifiedInterpolants, 21665 SizeOfPredicates, 4 NumberOfNonLiveVariables, 200 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 38/50 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_10-53-51-458.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_10-53-51-458.csv Received shutdown request...