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.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-4eac566 [2018-09-23 19:43:40,726 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-23 19:43:40,728 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-23 19:43:40,746 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-23 19:43:40,746 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-23 19:43:40,748 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-23 19:43:40,749 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-23 19:43:40,752 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-23 19:43:40,754 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-23 19:43:40,758 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-23 19:43:40,761 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-23 19:43:40,761 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-23 19:43:40,762 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-23 19:43:40,763 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-23 19:43:40,767 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-23 19:43:40,768 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-23 19:43:40,770 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-23 19:43:40,777 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-23 19:43:40,779 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-23 19:43:40,786 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-23 19:43:40,787 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-23 19:43:40,792 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-23 19:43:40,794 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-23 19:43:40,794 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-23 19:43:40,794 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-23 19:43:40,799 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-23 19:43:40,801 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-23 19:43:40,803 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-23 19:43:40,804 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-23 19:43:40,805 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-23 19:43:40,806 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-23 19:43:40,806 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-23 19:43:40,808 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-23 19:43:40,808 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-23 19:43:40,810 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-23 19:43:40,811 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-23 19:43:40,812 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-23 19:43:40,827 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-23 19:43:40,827 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-23 19:43:40,828 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-23 19:43:40,828 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-23 19:43:40,829 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-23 19:43:40,829 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-23 19:43:40,829 INFO L133 SettingsManager]: * Use SBE=true [2018-09-23 19:43:40,830 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-23 19:43:40,830 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-23 19:43:40,830 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-23 19:43:40,830 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-23 19:43:40,830 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-23 19:43:40,831 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-23 19:43:40,831 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-23 19:43:40,831 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-23 19:43:40,831 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-23 19:43:40,831 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-23 19:43:40,832 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-23 19:43:40,832 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-23 19:43:40,832 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-23 19:43:40,832 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-23 19:43:40,833 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-23 19:43:40,833 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 19:43:40,833 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-23 19:43:40,833 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-23 19:43:40,833 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-23 19:43:40,834 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-23 19:43:40,834 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-23 19:43:40,834 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-23 19:43:40,834 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-23 19:43:40,885 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-23 19:43:40,897 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-23 19:43:40,901 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-23 19:43:40,903 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-23 19:43:40,903 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-23 19:43:40,904 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-23 19:43:40,904 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-23 19:43:41,012 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-23 19:43:41,016 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-23 19:43:41,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-23 19:43:41,017 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-23 19:43:41,017 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-23 19:43:41,038 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 23.09 07:43:40" (1/1) ... [2018-09-23 19:43:41,057 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 23.09 07:43:40" (1/1) ... [2018-09-23 19:43:41,066 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-23 19:43:41,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-23 19:43:41,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-23 19:43:41,067 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-23 19:43:41,078 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 23.09 07:43:40" (1/1) ... [2018-09-23 19:43:41,079 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 23.09 07:43:40" (1/1) ... [2018-09-23 19:43:41,082 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 23.09 07:43:40" (1/1) ... [2018-09-23 19:43:41,082 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 23.09 07:43:40" (1/1) ... [2018-09-23 19:43:41,103 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 23.09 07:43:40" (1/1) ... [2018-09-23 19:43:41,107 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 23.09 07:43:40" (1/1) ... [2018-09-23 19:43:41,109 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 23.09 07:43:40" (1/1) ... [2018-09-23 19:43:41,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-23 19:43:41,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-23 19:43:41,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-23 19:43:41,123 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-23 19:43:41,125 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 23.09 07:43:40" (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-23 19:43:41,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-23 19:43:41,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-23 19:43:41,651 INFO L354 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-23 19:43:41,651 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 23.09 07:43:41 BoogieIcfgContainer [2018-09-23 19:43:41,652 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-23 19:43:41,653 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-23 19:43:41,653 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-23 19:43:41,656 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-23 19:43:41,656 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 23.09 07:43:40" (1/2) ... [2018-09-23 19:43:41,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de4ef7a 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 23.09 07:43:41, skipping insertion in model container [2018-09-23 19:43:41,658 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 23.09 07:43:41" (2/2) ... [2018-09-23 19:43:41,659 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl [2018-09-23 19:43:41,669 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-23 19:43:41,678 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-23 19:43:41,729 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-23 19:43:41,730 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-23 19:43:41,730 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-23 19:43:41,731 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-23 19:43:41,731 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-23 19:43:41,731 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-23 19:43:41,731 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-23 19:43:41,731 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-23 19:43:41,731 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-23 19:43:41,747 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2018-09-23 19:43:41,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:43:41,754 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:43:41,755 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:43:41,757 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:43:41,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:43:41,766 INFO L82 PathProgramCache]: Analyzing trace with hash -100896173, now seen corresponding path program 1 times [2018-09-23 19:43:41,768 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:43:41,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:43:41,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:43:41,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:43:41,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:43:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:43:42,016 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-23 19:43:42,018 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:43:42,019 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 19:43:42,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:43:42,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:43:42,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:43:42,038 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2018-09-23 19:43:42,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:43:42,104 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2018-09-23 19:43:42,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:43:42,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-09-23 19:43:42,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:43:42,117 INFO L225 Difference]: With dead ends: 39 [2018-09-23 19:43:42,118 INFO L226 Difference]: Without dead ends: 25 [2018-09-23 19:43:42,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:43:42,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-23 19:43:42,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-09-23 19:43:42,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-23 19:43:42,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2018-09-23 19:43:42,165 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 12 [2018-09-23 19:43:42,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:43:42,166 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2018-09-23 19:43:42,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:43:42,166 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2018-09-23 19:43:42,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:43:42,167 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:43:42,167 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:43:42,168 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:43:42,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:43:42,168 INFO L82 PathProgramCache]: Analyzing trace with hash -43637871, now seen corresponding path program 1 times [2018-09-23 19:43:42,168 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:43:42,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:43:42,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:43:42,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:43:42,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:43:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:43:42,281 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-23 19:43:42,282 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:43:42,282 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 19:43:42,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:43:42,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:43:42,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:43:42,285 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 3 states. [2018-09-23 19:43:42,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:43:42,353 INFO L93 Difference]: Finished difference Result 67 states and 91 transitions. [2018-09-23 19:43:42,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:43:42,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-09-23 19:43:42,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:43:42,357 INFO L225 Difference]: With dead ends: 67 [2018-09-23 19:43:42,358 INFO L226 Difference]: Without dead ends: 45 [2018-09-23 19:43:42,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:43:42,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-23 19:43:42,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-09-23 19:43:42,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-23 19:43:42,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2018-09-23 19:43:42,372 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 12 [2018-09-23 19:43:42,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:43:42,373 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2018-09-23 19:43:42,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:43:42,373 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2018-09-23 19:43:42,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:43:42,374 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:43:42,374 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:43:42,374 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:43:42,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:43:42,375 INFO L82 PathProgramCache]: Analyzing trace with hash -43697453, now seen corresponding path program 1 times [2018-09-23 19:43:42,375 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:43:42,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:43:42,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:43:42,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:43:42,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:43:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:43:42,525 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-23 19:43:42,526 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:43:42,526 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-23 19:43:42,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-23 19:43:42,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-23 19:43:42,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-23 19:43:42,530 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 4 states. [2018-09-23 19:43:42,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:43:42,691 INFO L93 Difference]: Finished difference Result 78 states and 103 transitions. [2018-09-23 19:43:42,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-23 19:43:42,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-09-23 19:43:42,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:43:42,693 INFO L225 Difference]: With dead ends: 78 [2018-09-23 19:43:42,693 INFO L226 Difference]: Without dead ends: 76 [2018-09-23 19:43:42,694 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-23 19:43:42,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-23 19:43:42,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 47. [2018-09-23 19:43:42,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-23 19:43:42,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2018-09-23 19:43:42,727 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 12 [2018-09-23 19:43:42,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:43:42,727 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2018-09-23 19:43:42,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-23 19:43:42,728 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2018-09-23 19:43:42,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:43:42,728 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:43:42,729 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:43:42,729 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:43:42,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:43:42,732 INFO L82 PathProgramCache]: Analyzing trace with hash -436664881, now seen corresponding path program 1 times [2018-09-23 19:43:42,733 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:43:42,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:43:42,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:43:42,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:43:42,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:43:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:43:42,828 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-23 19:43:42,829 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:43:42,829 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 19:43:42,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:43:42,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:43:42,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:43:42,830 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand 3 states. [2018-09-23 19:43:42,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:43:42,890 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2018-09-23 19:43:42,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:43:42,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-09-23 19:43:42,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:43:42,895 INFO L225 Difference]: With dead ends: 101 [2018-09-23 19:43:42,895 INFO L226 Difference]: Without dead ends: 75 [2018-09-23 19:43:42,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:43:42,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-23 19:43:42,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-09-23 19:43:42,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-23 19:43:42,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 93 transitions. [2018-09-23 19:43:42,935 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 93 transitions. Word has length 12 [2018-09-23 19:43:42,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:43:42,938 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 93 transitions. [2018-09-23 19:43:42,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:43:42,938 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2018-09-23 19:43:42,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-23 19:43:42,939 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:43:42,940 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:43:42,940 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:43:42,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:43:42,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1645106231, now seen corresponding path program 1 times [2018-09-23 19:43:42,941 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:43:42,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:43:42,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:43:42,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:43:42,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:43:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:43:43,123 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-23 19:43:43,124 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:43:43,124 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:43:43,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:43:43,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:43:43,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:43:43,126 INFO L87 Difference]: Start difference. First operand 73 states and 93 transitions. Second operand 3 states. [2018-09-23 19:43:43,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:43:43,175 INFO L93 Difference]: Finished difference Result 213 states and 273 transitions. [2018-09-23 19:43:43,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:43:43,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-09-23 19:43:43,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:43:43,179 INFO L225 Difference]: With dead ends: 213 [2018-09-23 19:43:43,180 INFO L226 Difference]: Without dead ends: 143 [2018-09-23 19:43:43,181 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:43:43,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-23 19:43:43,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-09-23 19:43:43,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-23 19:43:43,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 176 transitions. [2018-09-23 19:43:43,212 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 176 transitions. Word has length 22 [2018-09-23 19:43:43,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:43:43,212 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 176 transitions. [2018-09-23 19:43:43,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:43:43,212 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 176 transitions. [2018-09-23 19:43:43,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-23 19:43:43,214 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:43:43,214 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:43:43,214 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:43:43,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:43:43,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1840514439, now seen corresponding path program 1 times [2018-09-23 19:43:43,215 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:43:43,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:43:43,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:43:43,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:43:43,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:43:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:43:43,357 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-23 19:43:43,357 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:43:43,357 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-23 19:43:43,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:43:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:43:43,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:43:43,878 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-23 19:43:43,909 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:43:43,909 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-09-23 19:43:43,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 19:43:43,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 19:43:43,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-23 19:43:43,910 INFO L87 Difference]: Start difference. First operand 141 states and 176 transitions. Second operand 7 states. [2018-09-23 19:43:44,185 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-09-23 19:43:44,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:43:44,548 INFO L93 Difference]: Finished difference Result 296 states and 368 transitions. [2018-09-23 19:43:44,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-23 19:43:44,550 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-09-23 19:43:44,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:43:44,551 INFO L225 Difference]: With dead ends: 296 [2018-09-23 19:43:44,552 INFO L226 Difference]: Without dead ends: 158 [2018-09-23 19:43:44,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:43:44,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-23 19:43:44,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 113. [2018-09-23 19:43:44,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-23 19:43:44,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 142 transitions. [2018-09-23 19:43:44,591 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 142 transitions. Word has length 22 [2018-09-23 19:43:44,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:43:44,592 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 142 transitions. [2018-09-23 19:43:44,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 19:43:44,592 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 142 transitions. [2018-09-23 19:43:44,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-23 19:43:44,593 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:43:44,593 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:43:44,594 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:43:44,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:43:44,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1783256137, now seen corresponding path program 1 times [2018-09-23 19:43:44,594 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:43:44,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:43:44,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:43:44,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:43:44,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:43:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:43:44,674 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-23 19:43:44,675 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:43:44,675 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:43:44,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:43:44,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:43:44,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:43:44,676 INFO L87 Difference]: Start difference. First operand 113 states and 142 transitions. Second operand 3 states. [2018-09-23 19:43:44,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:43:44,758 INFO L93 Difference]: Finished difference Result 259 states and 322 transitions. [2018-09-23 19:43:44,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:43:44,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-09-23 19:43:44,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:43:44,762 INFO L225 Difference]: With dead ends: 259 [2018-09-23 19:43:44,762 INFO L226 Difference]: Without dead ends: 121 [2018-09-23 19:43:44,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:43:44,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-09-23 19:43:44,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2018-09-23 19:43:44,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-23 19:43:44,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 133 transitions. [2018-09-23 19:43:44,797 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 133 transitions. Word has length 22 [2018-09-23 19:43:44,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:43:44,797 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 133 transitions. [2018-09-23 19:43:44,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:43:44,797 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 133 transitions. [2018-09-23 19:43:44,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-23 19:43:44,798 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:43:44,798 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:43:44,799 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:43:44,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:43:44,799 INFO L82 PathProgramCache]: Analyzing trace with hash -655716359, now seen corresponding path program 2 times [2018-09-23 19:43:44,799 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:43:44,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:43:44,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:43:44,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:43:44,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:43:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:43:44,844 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-23 19:43:44,844 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:43:44,845 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 19:43:44,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:43:44,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:43:44,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:43:44,846 INFO L87 Difference]: Start difference. First operand 111 states and 133 transitions. Second operand 3 states. [2018-09-23 19:43:44,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:43:44,853 INFO L93 Difference]: Finished difference Result 113 states and 135 transitions. [2018-09-23 19:43:44,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:43:44,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-09-23 19:43:44,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:43:44,853 INFO L225 Difference]: With dead ends: 113 [2018-09-23 19:43:44,854 INFO L226 Difference]: Without dead ends: 0 [2018-09-23 19:43:44,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:43:44,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-23 19:43:44,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-23 19:43:44,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-23 19:43:44,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-23 19:43:44,857 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-09-23 19:43:44,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:43:44,857 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-23 19:43:44,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:43:44,858 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-23 19:43:44,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-23 19:43:44,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-23 19:43:44,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:43:44,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:43:44,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:43:44,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:43:44,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:43:44,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:43:45,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:43:45,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:43:45,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:43:45,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:43:45,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:43:45,241 WARN L178 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-09-23 19:43:45,640 WARN L178 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-09-23 19:43:45,865 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-09-23 19:43:46,102 WARN L178 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-09-23 19:43:46,736 WARN L178 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2018-09-23 19:43:46,905 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2018-09-23 19:43:46,930 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 57 313) no Hoare annotation was computed. [2018-09-23 19:43:46,931 INFO L422 ceAbstractionStarter]: At program point L250(lines 250 260) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (<= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse2 (mod v_prenex_1 256))) (and (<= .cse2 127) (<= v_prenex_1 127) (= ~p2_new .cse2) (<= 0 v_prenex_1)))) .cse3) (and (and .cse0 .cse1 .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))))) (<= ~mode3 1) (<= 1 ~mode3)))) [2018-09-23 19:43:46,931 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 (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .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))))) (and (<= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2))) [2018-09-23 19:43:46,931 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-23 19:43:46,931 INFO L422 ceAbstractionStarter]: At program point L304(lines 304 311) the Hoare annotation is: false [2018-09-23 19:43:46,932 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 (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .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))))) (and (<= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2))) [2018-09-23 19:43:46,932 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-23 19:43:46,932 INFO L422 ceAbstractionStarter]: At program point L265(lines 259 266) the Hoare annotation is: (and (<= ~r1 0) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (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)))) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-09-23 19:43:46,932 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-23 19:43:46,932 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 (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .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))))) (and (and (<= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2) (= ~mode2 (* 256 (div ~mode2 256)))))) [2018-09-23 19:43:46,932 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 57 313) no Hoare annotation was computed. [2018-09-23 19:43:46,933 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 312) no Hoare annotation was computed. [2018-09-23 19:43:46,933 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 57 313) no Hoare annotation was computed. [2018-09-23 19:43:46,933 INFO L422 ceAbstractionStarter]: At program point L245(lines 236 246) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (<= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse2 (mod v_prenex_1 256))) (and (<= .cse2 127) (<= v_prenex_1 127) (= ~p2_new .cse2) (<= 0 v_prenex_1)))) .cse3) (and (and .cse0 .cse1 .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))))) (<= ~mode3 1) (<= 1 ~mode3)))) [2018-09-23 19:43:46,933 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 (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .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))))) (and (and (<= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2) (= ~mode2 (* 256 (div ~mode2 256)))))) [2018-09-23 19:43:46,940 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,942 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,942 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,942 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,948 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,948 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,949 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,949 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,951 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,952 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,952 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,952 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,953 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,953 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,953 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,953 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,956 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,956 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,956 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,956 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,957 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,957 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,957 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,957 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,959 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,959 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,960 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,960 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,961 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,962 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,962 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,962 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,967 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,967 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,967 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,967 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,968 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,968 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,968 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,968 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,971 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,971 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,971 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,971 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,974 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,974 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,974 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,974 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,976 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,976 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,976 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,980 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,981 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,981 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,984 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,984 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,985 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,985 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,985 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,986 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,990 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,990 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,990 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,991 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,995 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,995 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,996 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,996 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,997 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,998 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,998 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,998 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:46,999 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,000 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,000 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,000 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,001 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,002 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,002 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,002 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,004 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,004 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,004 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,004 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,005 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,005 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,006 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,006 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,006 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,007 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,007 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,007 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,008 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,008 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,009 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,009 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,011 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 23.09 07:43:47 BoogieIcfgContainer [2018-09-23 19:43:47,011 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-23 19:43:47,012 INFO L168 Benchmark]: Toolchain (without parser) took 5999.13 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: 309.2 MB). Peak memory consumption was 309.2 MB. Max. memory is 7.1 GB. [2018-09-23 19:43:47,013 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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-23 19:43:47,014 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.15 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-23 19:43:47,015 INFO L168 Benchmark]: Boogie Preprocessor took 50.50 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-23 19:43:47,015 INFO L168 Benchmark]: RCFGBuilder took 528.87 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-23 19:43:47,016 INFO L168 Benchmark]: TraceAbstraction took 5358.55 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: 277.5 MB). Peak memory consumption was 277.5 MB. Max. memory is 7.1 GB. [2018-09-23 19:43:47,020 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.20 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 50.15 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 50.50 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 528.87 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5358.55 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: 277.5 MB). Peak memory consumption was 277.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-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-23 19:43:47,038 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,039 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,039 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,039 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,040 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,040 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,042 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,042 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((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)) || ((((((~r1 <= 0 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) - InvariantResult [Line: 250]: Loop Invariant [2018-09-23 19:43:47,043 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,043 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,043 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,043 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,044 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,044 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,044 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,044 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,045 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,045 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,046 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,046 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,046 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,046 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,046 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,047 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) && ~send2 <= 127) && 0 <= ~send2) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && 0 == ~nomsg + 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)) && ~mode3 <= 1) && 1 <= ~mode3) - InvariantResult [Line: 298]: Loop Invariant [2018-09-23 19:43:47,048 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,048 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,048 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,048 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,049 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,050 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,050 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,050 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-23 19:43:47,051 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,051 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,059 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,059 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,059 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,059 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,060 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,060 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,061 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,061 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,061 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,062 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,062 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,062 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,062 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,062 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) && ~send2 <= 127) && 0 <= ~send2) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && 0 == ~nomsg + 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)) && ~mode3 <= 1) && 1 <= ~mode3) - InvariantResult [Line: 277]: Loop Invariant [2018-09-23 19:43:47,063 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,063 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,064 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,064 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,065 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,065 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,065 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,065 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-23 19:43:47,066 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,066 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,066 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,066 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,067 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,067 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,067 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,068 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-23 19:43:47,068 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,069 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,069 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,069 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,070 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,070 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,070 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,070 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((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)) || ((((((~r1 <= 0 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) - InvariantResult [Line: 227]: Loop Invariant [2018-09-23 19:43:47,071 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,071 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,072 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,072 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,072 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,073 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,073 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,073 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((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)) || (((((~r1 <= 0 && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~mode2 == 256 * (~mode2 / 256)) - InvariantResult [Line: 304]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 214]: Loop Invariant [2018-09-23 19:43:47,074 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,074 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,074 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,075 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,077 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,078 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,078 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,078 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((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)) || (((((~r1 <= 0 && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~mode2 == 256 * (~mode2 / 256)) - InvariantResult [Line: 259]: Loop Invariant [2018-09-23 19:43:47,080 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,081 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,081 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,081 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,082 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,082 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,082 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 19:43:47,083 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) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p2_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 1 error locations. SAFE Result, 5.2s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 2.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 157 SDtfs, 90 SDslu, 125 SDs, 0 SdLazy, 75 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s 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, 656 HoareAnnotationTreeSize, 11 FomulaSimplifications, 2742 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 11 FomulaSimplificationsInter, 224 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 158 NumberOfCodeBlocks, 158 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 149 ConstructedInterpolants, 12 QuantifiedInterpolants, 14861 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.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-23_19-43-47-094.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.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-23_19-43-47-094.csv Received shutdown request...