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-00a8621 [2018-09-30 10:27:16,843 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:27:16,845 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:27:16,862 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:27:16,863 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:27:16,864 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:27:16,866 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:27:16,869 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:27:16,872 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:27:16,873 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:27:16,875 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:27:16,875 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:27:16,876 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:27:16,877 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:27:16,878 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:27:16,886 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:27:16,887 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:27:16,892 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:27:16,894 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:27:16,897 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:27:16,898 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:27:16,899 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:27:16,901 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:27:16,901 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:27:16,901 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:27:16,902 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:27:16,903 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:27:16,904 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:27:16,904 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:27:16,905 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:27:16,906 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:27:16,906 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:27:16,906 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:27:16,907 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:27:16,908 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:27:16,908 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:27:16,908 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-30 10:27:16,922 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:27:16,923 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:27:16,923 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:27:16,924 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:27:16,924 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:27:16,924 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:27:16,925 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:27:16,925 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:27:16,925 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:27:16,925 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:27:16,925 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:27:16,926 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:27:16,926 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:27:16,926 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:27:16,926 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:27:16,926 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:27:16,927 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:27:16,927 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:27:16,927 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:27:16,927 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:27:16,927 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:27:16,928 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:27:16,928 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:27:16,928 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:27:16,928 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:27:16,928 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:27:16,928 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:27:16,929 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:27:16,929 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:27:16,929 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:27:16,973 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:27:16,988 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:27:16,994 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:27:16,996 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:27:16,997 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:27:16,997 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl [2018-09-30 10:27:16,998 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl' [2018-09-30 10:27:17,093 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:27:17,099 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:27:17,100 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:27:17,100 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:27:17,100 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:27:17,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:17" (1/1) ... [2018-09-30 10:27:17,137 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:17" (1/1) ... [2018-09-30 10:27:17,155 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:27:17,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:27:17,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:27:17,156 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:27:17,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:17" (1/1) ... [2018-09-30 10:27:17,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:17" (1/1) ... [2018-09-30 10:27:17,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:17" (1/1) ... [2018-09-30 10:27:17,173 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:17" (1/1) ... [2018-09-30 10:27:17,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:17" (1/1) ... [2018-09-30 10:27:17,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:17" (1/1) ... [2018-09-30 10:27:17,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:17" (1/1) ... [2018-09-30 10:27:17,205 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:27:17,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:27:17,206 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:27:17,206 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:27:17,207 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:27:17,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 10:27:17,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 10:27:17,867 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 10:27:17,868 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:27:17 BoogieIcfgContainer [2018-09-30 10:27:17,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:27:17,869 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:27:17,869 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:27:17,872 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:27:17,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:17" (1/2) ... [2018-09-30 10:27:17,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c9eb5ca and model type pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:27:17, skipping insertion in model container [2018-09-30 10:27:17,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:27:17" (2/2) ... [2018-09-30 10:27:17,876 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl [2018-09-30 10:27:17,884 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:27:17,892 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 10:27:17,939 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:27:17,940 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:27:17,940 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:27:17,941 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:27:17,941 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:27:17,941 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:27:17,941 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:27:17,941 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:27:17,941 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:27:17,957 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2018-09-30 10:27:17,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:27:17,968 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:17,973 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:27:17,975 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:17,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:17,981 INFO L82 PathProgramCache]: Analyzing trace with hash -100896173, now seen corresponding path program 1 times [2018-09-30 10:27:17,983 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:17,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:18,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:18,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:18,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:18,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:18,219 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:18,219 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:27:18,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:18,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:18,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:18,238 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2018-09-30 10:27:18,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:18,286 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2018-09-30 10:27:18,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:18,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-09-30 10:27:18,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:18,299 INFO L225 Difference]: With dead ends: 39 [2018-09-30 10:27:18,300 INFO L226 Difference]: Without dead ends: 25 [2018-09-30 10:27:18,303 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-30 10:27:18,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-30 10:27:18,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-09-30 10:27:18,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-30 10:27:18,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2018-09-30 10:27:18,343 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 12 [2018-09-30 10:27:18,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:18,344 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2018-09-30 10:27:18,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:18,345 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2018-09-30 10:27:18,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:27:18,345 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:18,345 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:27:18,346 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:18,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:18,346 INFO L82 PathProgramCache]: Analyzing trace with hash -43637871, now seen corresponding path program 1 times [2018-09-30 10:27:18,347 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:18,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:18,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:18,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:18,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:18,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:18,439 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:18,439 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:27:18,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:18,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:18,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:18,442 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 3 states. [2018-09-30 10:27:18,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:18,506 INFO L93 Difference]: Finished difference Result 67 states and 91 transitions. [2018-09-30 10:27:18,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:18,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-09-30 10:27:18,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:18,508 INFO L225 Difference]: With dead ends: 67 [2018-09-30 10:27:18,508 INFO L226 Difference]: Without dead ends: 45 [2018-09-30 10:27:18,509 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-30 10:27:18,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-30 10:27:18,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-09-30 10:27:18,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-30 10:27:18,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2018-09-30 10:27:18,525 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 12 [2018-09-30 10:27:18,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:18,525 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2018-09-30 10:27:18,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:18,526 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2018-09-30 10:27:18,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:27:18,526 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:18,526 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:27:18,527 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:18,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:18,527 INFO L82 PathProgramCache]: Analyzing trace with hash -43697453, now seen corresponding path program 1 times [2018-09-30 10:27:18,527 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:18,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:18,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:18,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:18,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:18,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:18,663 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:18,663 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:27:18,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:27:18,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:27:18,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 10:27:18,665 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 4 states. [2018-09-30 10:27:18,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:18,823 INFO L93 Difference]: Finished difference Result 78 states and 103 transitions. [2018-09-30 10:27:18,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:27:18,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-09-30 10:27:18,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:18,825 INFO L225 Difference]: With dead ends: 78 [2018-09-30 10:27:18,825 INFO L226 Difference]: Without dead ends: 76 [2018-09-30 10:27:18,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-30 10:27:18,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-30 10:27:18,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 47. [2018-09-30 10:27:18,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-30 10:27:18,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2018-09-30 10:27:18,851 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 12 [2018-09-30 10:27:18,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:18,852 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2018-09-30 10:27:18,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:27:18,852 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2018-09-30 10:27:18,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:27:18,853 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:18,853 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:27:18,853 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:18,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:18,854 INFO L82 PathProgramCache]: Analyzing trace with hash -436664881, now seen corresponding path program 1 times [2018-09-30 10:27:18,854 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:18,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:18,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:18,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:18,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:18,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:18,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:18,937 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:18,939 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:27:18,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:18,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:18,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:18,941 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand 3 states. [2018-09-30 10:27:18,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:18,994 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2018-09-30 10:27:18,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:18,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-09-30 10:27:18,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:18,999 INFO L225 Difference]: With dead ends: 101 [2018-09-30 10:27:18,999 INFO L226 Difference]: Without dead ends: 75 [2018-09-30 10:27:19,000 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-30 10:27:19,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-30 10:27:19,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-09-30 10:27:19,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-30 10:27:19,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 93 transitions. [2018-09-30 10:27:19,020 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 93 transitions. Word has length 12 [2018-09-30 10:27:19,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:19,024 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 93 transitions. [2018-09-30 10:27:19,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:19,024 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2018-09-30 10:27:19,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-30 10:27:19,025 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:19,026 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:27:19,026 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:19,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:19,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1645106231, now seen corresponding path program 1 times [2018-09-30 10:27:19,027 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:19,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:19,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:19,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:19,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:19,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:19,233 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:19,234 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:19,234 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:27:19,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:19,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:19,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:19,236 INFO L87 Difference]: Start difference. First operand 73 states and 93 transitions. Second operand 3 states. [2018-09-30 10:27:19,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:19,305 INFO L93 Difference]: Finished difference Result 213 states and 273 transitions. [2018-09-30 10:27:19,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:19,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-09-30 10:27:19,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:19,310 INFO L225 Difference]: With dead ends: 213 [2018-09-30 10:27:19,310 INFO L226 Difference]: Without dead ends: 143 [2018-09-30 10:27:19,311 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-30 10:27:19,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-30 10:27:19,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-09-30 10:27:19,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-30 10:27:19,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 176 transitions. [2018-09-30 10:27:19,358 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 176 transitions. Word has length 22 [2018-09-30 10:27:19,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:19,361 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 176 transitions. [2018-09-30 10:27:19,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:19,361 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 176 transitions. [2018-09-30 10:27:19,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-30 10:27:19,362 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:19,363 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:27:19,363 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:19,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:19,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1840514439, now seen corresponding path program 1 times [2018-09-30 10:27:19,364 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:19,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:19,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:19,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:19,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:19,687 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:19,690 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:27:19,691 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:27:19,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:19,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:27:20,105 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:20,136 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:27:20,137 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-09-30 10:27:20,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:27:20,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:27:20,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:27:20,138 INFO L87 Difference]: Start difference. First operand 141 states and 176 transitions. Second operand 7 states. [2018-09-30 10:27:20,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:20,783 INFO L93 Difference]: Finished difference Result 296 states and 368 transitions. [2018-09-30 10:27:20,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:27:20,783 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-09-30 10:27:20,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:20,785 INFO L225 Difference]: With dead ends: 296 [2018-09-30 10:27:20,785 INFO L226 Difference]: Without dead ends: 158 [2018-09-30 10:27:20,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:27:20,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-30 10:27:20,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 113. [2018-09-30 10:27:20,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-30 10:27:20,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 142 transitions. [2018-09-30 10:27:20,826 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 142 transitions. Word has length 22 [2018-09-30 10:27:20,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:20,826 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 142 transitions. [2018-09-30 10:27:20,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:27:20,827 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 142 transitions. [2018-09-30 10:27:20,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-30 10:27:20,828 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:20,828 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:27:20,828 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:20,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:20,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1783256137, now seen corresponding path program 1 times [2018-09-30 10:27:20,829 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:20,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:20,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:20,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:20,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:20,976 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:20,977 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:20,977 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:27:20,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:20,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:20,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:20,979 INFO L87 Difference]: Start difference. First operand 113 states and 142 transitions. Second operand 3 states. [2018-09-30 10:27:21,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:21,070 INFO L93 Difference]: Finished difference Result 259 states and 322 transitions. [2018-09-30 10:27:21,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:21,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-09-30 10:27:21,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:21,072 INFO L225 Difference]: With dead ends: 259 [2018-09-30 10:27:21,073 INFO L226 Difference]: Without dead ends: 121 [2018-09-30 10:27:21,076 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-30 10:27:21,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-09-30 10:27:21,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2018-09-30 10:27:21,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-30 10:27:21,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 133 transitions. [2018-09-30 10:27:21,125 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 133 transitions. Word has length 22 [2018-09-30 10:27:21,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:21,129 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 133 transitions. [2018-09-30 10:27:21,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:21,130 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 133 transitions. [2018-09-30 10:27:21,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-30 10:27:21,131 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:21,133 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:27:21,134 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:21,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:21,134 INFO L82 PathProgramCache]: Analyzing trace with hash -655716359, now seen corresponding path program 2 times [2018-09-30 10:27:21,135 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:21,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:21,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:21,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:21,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:21,217 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-09-30 10:27:21,217 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:21,217 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:27:21,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:21,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:21,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:21,219 INFO L87 Difference]: Start difference. First operand 111 states and 133 transitions. Second operand 3 states. [2018-09-30 10:27:21,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:21,225 INFO L93 Difference]: Finished difference Result 113 states and 135 transitions. [2018-09-30 10:27:21,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:21,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-09-30 10:27:21,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:21,226 INFO L225 Difference]: With dead ends: 113 [2018-09-30 10:27:21,226 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 10:27:21,227 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-30 10:27:21,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 10:27:21,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 10:27:21,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 10:27:21,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 10:27:21,228 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-09-30 10:27:21,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:21,229 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 10:27:21,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:21,229 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 10:27:21,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 10:27:21,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 10:27:21,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:21,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:21,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:21,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:21,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:21,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:21,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:21,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:21,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:21,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:21,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:27:21,712 WARN L178 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-09-30 10:27:21,919 WARN L178 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-09-30 10:27:22,119 WARN L178 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-09-30 10:27:22,365 WARN L178 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-09-30 10:27:22,877 WARN L178 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2018-09-30 10:27:23,043 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2018-09-30 10:27:23,087 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 57 313) no Hoare annotation was computed. [2018-09-30 10:27:23,087 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-30 10:27:23,088 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-30 10:27:23,088 INFO L422 ceAbstractionStarter]: At program point L277(lines 277 284) the Hoare annotation is: (and (<= ~r1 0) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse0 ~p2_old))))) [2018-09-30 10:27:23,088 INFO L422 ceAbstractionStarter]: At program point L304(lines 304 311) the Hoare annotation is: false [2018-09-30 10:27:23,088 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-30 10:27:23,088 INFO L422 ceAbstractionStarter]: At program point L298(lines 298 305) the Hoare annotation is: (and (<= 1 ULTIMATE.start_check_~tmp~75) (= ULTIMATE.start_assert_~arg 1) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse0 ~p2_old))))) [2018-09-30 10:27:23,089 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-30 10:27:23,089 INFO L422 ceAbstractionStarter]: At program point L288(lines 283 289) the Hoare annotation is: (and (<= 1 ULTIMATE.start_check_~tmp~75) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1) (= .cse0 ~p2_old))))) [2018-09-30 10:27:23,089 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-30 10:27:23,089 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 57 313) no Hoare annotation was computed. [2018-09-30 10:27:23,089 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 57 313) no Hoare annotation was computed. [2018-09-30 10:27:23,090 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-30 10:27:23,090 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 312) no Hoare annotation was computed. [2018-09-30 10:27:23,090 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-30 10:27:23,097 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,098 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,098 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,098 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,105 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,105 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,105 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,106 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,108 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,108 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,108 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,109 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,109 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,109 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,109 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,110 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,112 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,112 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,112 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,112 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,113 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,113 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,113 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,114 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,115 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,115 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,115 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,116 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,117 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,117 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,117 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,118 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,119 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,120 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,120 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,120 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,120 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,121 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,121 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,121 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,123 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,124 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,124 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,124 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,124 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,125 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,125 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,125 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,126 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,127 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,127 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,127 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,128 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,129 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,129 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,129 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,130 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,130 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,131 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,131 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,132 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,132 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,132 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,133 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,134 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,135 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,135 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,135 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,137 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,137 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,137 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,137 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,139 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,139 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,139 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,140 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,141 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,141 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,142 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,142 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,146 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,146 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,147 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,147 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,148 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,148 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,149 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,149 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,150 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,150 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,152 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,152 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,153 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,153 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,153 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,154 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,156 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:27:23 BoogieIcfgContainer [2018-09-30 10:27:23,156 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:27:23,157 INFO L168 Benchmark]: Toolchain (without parser) took 6063.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 309.2 MB). Peak memory consumption was 309.2 MB. Max. memory is 7.1 GB. [2018-09-30 10:27:23,158 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:27:23,159 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:27:23,161 INFO L168 Benchmark]: Boogie Preprocessor took 49.56 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:27:23,162 INFO L168 Benchmark]: RCFGBuilder took 662.81 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-30 10:27:23,164 INFO L168 Benchmark]: TraceAbstraction took 5287.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 277.5 MB). Peak memory consumption was 277.5 MB. Max. memory is 7.1 GB. [2018-09-30 10:27:23,170 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 55.39 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 49.56 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 662.81 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 5287.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 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-30 10:27:23,198 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,198 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,198 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,198 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,199 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,200 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,200 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,200 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-30 10:27:23,201 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,207 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,207 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,207 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,207 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,208 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,208 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,208 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,209 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,215 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,215 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,215 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,215 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,216 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,216 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,216 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-30 10:27:23,217 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,217 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,217 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,217 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,218 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,218 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,219 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,219 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((1 <= check_~tmp~75 && assert_~arg == 1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old) - InvariantResult [Line: 236]: Loop Invariant [2018-09-30 10:27:23,220 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,220 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,220 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,220 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,221 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,221 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,221 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,221 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,222 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,222 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,223 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,223 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,223 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,223 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,223 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,224 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-30 10:27:23,224 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,225 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,225 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,225 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,228 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,228 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,229 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,229 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((~r1 <= 0 && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old) - InvariantResult [Line: 283]: Loop Invariant [2018-09-30 10:27:23,230 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,231 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,231 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,231 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,232 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,232 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,232 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,235 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((1 <= check_~tmp~75 && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && 0 <= v_prenex_1) && v_prenex_1 % 256 == ~p2_old) - InvariantResult [Line: 200]: Loop Invariant [2018-09-30 10:27:23,236 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,236 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,237 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,237 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,237 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,238 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,238 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,238 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-30 10:27:23,239 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,239 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,239 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,239 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,240 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,240 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,240 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,241 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-30 10:27:23,242 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,242 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,242 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,242 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,243 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,243 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,246 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,246 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-30 10:27:23,246 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,247 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,247 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,247 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,253 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,253 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,253 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-30 10:27:23,254 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.1s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 1.8s 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, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 92 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 11 PreInvPairs, 43 NumberOfFragments, 656 HoareAnnotationTreeSize, 11 FomulaSimplifications, 2742 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 11 FomulaSimplificationsInter, 224 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s 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-30_10-27-23-262.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-30_10-27-23-262.csv Received shutdown request...