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.5.1.ufo.UNBOUNDED.pals.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-bd42740 [2018-09-23 21:31:19,839 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-23 21:31:19,843 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-23 21:31:19,862 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-23 21:31:19,862 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-23 21:31:19,864 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-23 21:31:19,867 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-23 21:31:19,869 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-23 21:31:19,870 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-23 21:31:19,872 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-23 21:31:19,872 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-23 21:31:19,873 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-23 21:31:19,875 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-23 21:31:19,876 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-23 21:31:19,879 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-23 21:31:19,885 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-23 21:31:19,886 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-23 21:31:19,890 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-23 21:31:19,893 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-23 21:31:19,895 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-23 21:31:19,896 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-23 21:31:19,899 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-23 21:31:19,902 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-23 21:31:19,902 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-23 21:31:19,902 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-23 21:31:19,906 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-23 21:31:19,907 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-23 21:31:19,908 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-23 21:31:19,908 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-23 21:31:19,909 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-23 21:31:19,911 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-23 21:31:19,912 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-23 21:31:19,912 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-23 21:31:19,913 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-23 21:31:19,914 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-23 21:31:19,914 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-23 21:31:19,916 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-23 21:31:19,943 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-23 21:31:19,943 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-23 21:31:19,944 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-23 21:31:19,944 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-23 21:31:19,945 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-23 21:31:19,945 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-23 21:31:19,948 INFO L133 SettingsManager]: * Use SBE=true [2018-09-23 21:31:19,948 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-23 21:31:19,948 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-23 21:31:19,948 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-23 21:31:19,949 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-23 21:31:19,949 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-23 21:31:19,949 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-23 21:31:19,949 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-23 21:31:19,949 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-23 21:31:19,950 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-23 21:31:19,950 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-23 21:31:19,950 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-23 21:31:19,950 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-23 21:31:19,951 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-23 21:31:19,952 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-23 21:31:19,952 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-23 21:31:19,952 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 21:31:19,953 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-23 21:31:19,953 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-23 21:31:19,953 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-23 21:31:19,953 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-23 21:31:19,954 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-23 21:31:19,954 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-23 21:31:19,954 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-23 21:31:20,017 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-23 21:31:20,033 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-23 21:31:20,039 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-23 21:31:20,041 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-23 21:31:20,041 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-23 21:31:20,042 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl [2018-09-23 21:31:20,042 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl' [2018-09-23 21:31:20,153 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-23 21:31:20,157 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-23 21:31:20,157 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-23 21:31:20,158 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-23 21:31:20,158 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-23 21:31:20,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:31:20" (1/1) ... [2018-09-23 21:31:20,194 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:31:20" (1/1) ... [2018-09-23 21:31:20,210 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-23 21:31:20,210 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-23 21:31:20,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-23 21:31:20,211 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-23 21:31:20,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:31:20" (1/1) ... [2018-09-23 21:31:20,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:31:20" (1/1) ... [2018-09-23 21:31:20,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:31:20" (1/1) ... [2018-09-23 21:31:20,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:31:20" (1/1) ... [2018-09-23 21:31:20,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:31:20" (1/1) ... [2018-09-23 21:31:20,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:31:20" (1/1) ... [2018-09-23 21:31:20,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:31:20" (1/1) ... [2018-09-23 21:31:20,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-23 21:31:20,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-23 21:31:20,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-23 21:31:20,244 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-23 21:31:20,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:31:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 21:31:20,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-23 21:31:20,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-23 21:31:20,948 INFO L354 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-23 21:31:20,949 INFO L202 PluginConnector]: Adding new model pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 09:31:20 BoogieIcfgContainer [2018-09-23 21:31:20,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-23 21:31:20,950 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-23 21:31:20,950 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-23 21:31:20,953 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-23 21:31:20,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:31:20" (1/2) ... [2018-09-23 21:31:20,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a30006c and model type pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.09 09:31:20, skipping insertion in model container [2018-09-23 21:31:20,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 09:31:20" (2/2) ... [2018-09-23 21:31:20,956 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl [2018-09-23 21:31:20,966 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-23 21:31:20,974 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-23 21:31:21,023 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-23 21:31:21,024 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-23 21:31:21,024 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-23 21:31:21,025 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-23 21:31:21,025 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-23 21:31:21,025 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-23 21:31:21,025 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-23 21:31:21,025 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-23 21:31:21,026 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-23 21:31:21,041 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-09-23 21:31:21,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-23 21:31:21,048 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:21,049 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:21,050 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:21,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:21,057 INFO L82 PathProgramCache]: Analyzing trace with hash -61215035, now seen corresponding path program 1 times [2018-09-23 21:31:21,059 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:21,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:21,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:21,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:21,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:21,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:31:21,322 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:21,323 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 21:31:21,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:21,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:21,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:21,340 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2018-09-23 21:31:21,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:21,404 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2018-09-23 21:31:21,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:21,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-09-23 21:31:21,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:21,420 INFO L225 Difference]: With dead ends: 54 [2018-09-23 21:31:21,420 INFO L226 Difference]: Without dead ends: 35 [2018-09-23 21:31:21,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:21,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-23 21:31:21,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-09-23 21:31:21,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-23 21:31:21,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2018-09-23 21:31:21,476 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 17 [2018-09-23 21:31:21,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:21,476 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2018-09-23 21:31:21,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:21,477 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2018-09-23 21:31:21,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-23 21:31:21,478 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:21,478 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:21,478 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:21,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:21,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1341078713, now seen corresponding path program 1 times [2018-09-23 21:31:21,479 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:21,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:21,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:21,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:21,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:21,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:31:21,592 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:21,592 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 21:31:21,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:21,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:21,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:21,597 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand 3 states. [2018-09-23 21:31:21,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:21,649 INFO L93 Difference]: Finished difference Result 97 states and 139 transitions. [2018-09-23 21:31:21,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:21,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-09-23 21:31:21,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:21,651 INFO L225 Difference]: With dead ends: 97 [2018-09-23 21:31:21,651 INFO L226 Difference]: Without dead ends: 65 [2018-09-23 21:31:21,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:21,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-23 21:31:21,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-09-23 21:31:21,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-23 21:31:21,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2018-09-23 21:31:21,673 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 17 [2018-09-23 21:31:21,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:21,674 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2018-09-23 21:31:21,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:21,674 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2018-09-23 21:31:21,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-23 21:31:21,675 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:21,675 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:21,676 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:21,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:21,676 INFO L82 PathProgramCache]: Analyzing trace with hash -754272699, now seen corresponding path program 1 times [2018-09-23 21:31:21,676 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:21,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:21,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:21,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:21,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:21,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:21,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:31:21,859 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:21,860 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 21:31:21,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:21,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:21,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:21,861 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand 3 states. [2018-09-23 21:31:21,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:21,928 INFO L93 Difference]: Finished difference Result 187 states and 268 transitions. [2018-09-23 21:31:21,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:21,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-09-23 21:31:21,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:21,935 INFO L225 Difference]: With dead ends: 187 [2018-09-23 21:31:21,936 INFO L226 Difference]: Without dead ends: 125 [2018-09-23 21:31:21,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:21,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-09-23 21:31:21,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-09-23 21:31:21,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-09-23 21:31:21,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 174 transitions. [2018-09-23 21:31:21,981 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 174 transitions. Word has length 17 [2018-09-23 21:31:21,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:21,981 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 174 transitions. [2018-09-23 21:31:21,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:21,982 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 174 transitions. [2018-09-23 21:31:21,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-23 21:31:21,983 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:21,983 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:21,984 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:21,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:21,984 INFO L82 PathProgramCache]: Analyzing trace with hash -53208121, now seen corresponding path program 1 times [2018-09-23 21:31:21,985 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:21,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:21,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:21,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:21,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:22,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:31:22,129 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:22,129 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 21:31:22,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:22,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:22,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:22,131 INFO L87 Difference]: Start difference. First operand 123 states and 174 transitions. Second operand 3 states. [2018-09-23 21:31:22,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:22,194 INFO L93 Difference]: Finished difference Result 367 states and 520 transitions. [2018-09-23 21:31:22,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:22,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-09-23 21:31:22,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:22,202 INFO L225 Difference]: With dead ends: 367 [2018-09-23 21:31:22,203 INFO L226 Difference]: Without dead ends: 245 [2018-09-23 21:31:22,208 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:22,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-09-23 21:31:22,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-09-23 21:31:22,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-09-23 21:31:22,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 338 transitions. [2018-09-23 21:31:22,269 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 338 transitions. Word has length 17 [2018-09-23 21:31:22,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:22,272 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 338 transitions. [2018-09-23 21:31:22,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:22,272 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 338 transitions. [2018-09-23 21:31:22,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-23 21:31:22,273 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:22,273 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:22,273 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:22,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:22,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1721799241, now seen corresponding path program 1 times [2018-09-23 21:31:22,274 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:22,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:22,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:22,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:22,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:22,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:31:22,409 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:22,409 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-23 21:31:22,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-23 21:31:22,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-23 21:31:22,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-23 21:31:22,410 INFO L87 Difference]: Start difference. First operand 243 states and 338 transitions. Second operand 4 states. [2018-09-23 21:31:22,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:22,737 INFO L93 Difference]: Finished difference Result 517 states and 707 transitions. [2018-09-23 21:31:22,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-23 21:31:22,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-09-23 21:31:22,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:22,742 INFO L225 Difference]: With dead ends: 517 [2018-09-23 21:31:22,742 INFO L226 Difference]: Without dead ends: 515 [2018-09-23 21:31:22,743 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-23 21:31:22,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-09-23 21:31:22,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 275. [2018-09-23 21:31:22,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-09-23 21:31:22,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 370 transitions. [2018-09-23 21:31:22,816 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 370 transitions. Word has length 17 [2018-09-23 21:31:22,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:22,816 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 370 transitions. [2018-09-23 21:31:22,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-23 21:31:22,817 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 370 transitions. [2018-09-23 21:31:22,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-23 21:31:22,817 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:22,817 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:22,818 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:22,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:22,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1721858823, now seen corresponding path program 1 times [2018-09-23 21:31:22,818 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:22,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:22,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:22,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:22,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:22,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:22,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:31:22,981 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:22,981 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:31:22,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-23 21:31:22,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-23 21:31:22,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-23 21:31:22,983 INFO L87 Difference]: Start difference. First operand 275 states and 370 transitions. Second operand 4 states. [2018-09-23 21:31:23,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:23,287 INFO L93 Difference]: Finished difference Result 879 states and 1193 transitions. [2018-09-23 21:31:23,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-23 21:31:23,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-09-23 21:31:23,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:23,291 INFO L225 Difference]: With dead ends: 879 [2018-09-23 21:31:23,291 INFO L226 Difference]: Without dead ends: 605 [2018-09-23 21:31:23,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-23 21:31:23,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-09-23 21:31:23,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2018-09-23 21:31:23,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2018-09-23 21:31:23,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 776 transitions. [2018-09-23 21:31:23,391 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 776 transitions. Word has length 17 [2018-09-23 21:31:23,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:23,391 INFO L480 AbstractCegarLoop]: Abstraction has 605 states and 776 transitions. [2018-09-23 21:31:23,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-23 21:31:23,392 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 776 transitions. [2018-09-23 21:31:23,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-23 21:31:23,397 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:23,397 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-23 21:31:23,397 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:23,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:23,398 INFO L82 PathProgramCache]: Analyzing trace with hash 868944887, now seen corresponding path program 1 times [2018-09-23 21:31:23,398 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:23,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:23,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:23,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:23,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:23,569 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-09-23 21:31:23,570 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:23,570 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:31:23,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:23,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:23,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:23,571 INFO L87 Difference]: Start difference. First operand 605 states and 776 transitions. Second operand 3 states. [2018-09-23 21:31:23,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:23,822 INFO L93 Difference]: Finished difference Result 1809 states and 2322 transitions. [2018-09-23 21:31:23,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:23,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-09-23 21:31:23,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:23,830 INFO L225 Difference]: With dead ends: 1809 [2018-09-23 21:31:23,831 INFO L226 Difference]: Without dead ends: 1207 [2018-09-23 21:31:23,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:23,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2018-09-23 21:31:24,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1205. [2018-09-23 21:31:24,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-09-23 21:31:24,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1508 transitions. [2018-09-23 21:31:24,027 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1508 transitions. Word has length 62 [2018-09-23 21:31:24,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:24,027 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1508 transitions. [2018-09-23 21:31:24,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:24,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1508 transitions. [2018-09-23 21:31:24,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-23 21:31:24,034 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:24,034 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-23 21:31:24,037 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:24,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:24,038 INFO L82 PathProgramCache]: Analyzing trace with hash 2034253683, now seen corresponding path program 1 times [2018-09-23 21:31:24,038 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:24,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:24,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:24,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:24,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:24,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:24,290 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-09-23 21:31:24,769 WARN L178 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-09-23 21:31:24,791 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 55 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-09-23 21:31:24,792 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:31:24,792 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 21:31:24,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:24,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:31:25,162 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-09-23 21:31:25,552 WARN L178 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-09-23 21:31:25,803 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-09-23 21:31:25,838 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:31:25,839 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-09-23 21:31:25,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:31:25,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:31:25,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:31:25,840 INFO L87 Difference]: Start difference. First operand 1205 states and 1508 transitions. Second operand 8 states. [2018-09-23 21:31:26,229 WARN L178 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-09-23 21:31:26,674 WARN L178 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2018-09-23 21:31:27,578 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2018-09-23 21:31:27,814 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2018-09-23 21:31:28,607 WARN L178 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2018-09-23 21:31:28,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:28,780 INFO L93 Difference]: Finished difference Result 2293 states and 2844 transitions. [2018-09-23 21:31:28,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-23 21:31:28,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2018-09-23 21:31:28,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:28,789 INFO L225 Difference]: With dead ends: 2293 [2018-09-23 21:31:28,789 INFO L226 Difference]: Without dead ends: 1091 [2018-09-23 21:31:28,792 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2018-09-23 21:31:28,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2018-09-23 21:31:28,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 653. [2018-09-23 21:31:28,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2018-09-23 21:31:28,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 808 transitions. [2018-09-23 21:31:28,972 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 808 transitions. Word has length 62 [2018-09-23 21:31:28,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:28,972 INFO L480 AbstractCegarLoop]: Abstraction has 653 states and 808 transitions. [2018-09-23 21:31:28,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:31:28,972 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 808 transitions. [2018-09-23 21:31:28,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-23 21:31:28,974 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:28,974 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-23 21:31:28,975 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:28,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:28,976 INFO L82 PathProgramCache]: Analyzing trace with hash -552343681, now seen corresponding path program 2 times [2018-09-23 21:31:28,976 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:28,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:28,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:28,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:28,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:29,079 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-09-23 21:31:29,080 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:29,080 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 21:31:29,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:29,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:29,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:29,082 INFO L87 Difference]: Start difference. First operand 653 states and 808 transitions. Second operand 3 states. [2018-09-23 21:31:29,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:29,230 INFO L93 Difference]: Finished difference Result 1109 states and 1359 transitions. [2018-09-23 21:31:29,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:29,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-09-23 21:31:29,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:29,233 INFO L225 Difference]: With dead ends: 1109 [2018-09-23 21:31:29,235 INFO L226 Difference]: Without dead ends: 459 [2018-09-23 21:31:29,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:29,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-09-23 21:31:29,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 457. [2018-09-23 21:31:29,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-09-23 21:31:29,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 540 transitions. [2018-09-23 21:31:29,354 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 540 transitions. Word has length 77 [2018-09-23 21:31:29,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:29,355 INFO L480 AbstractCegarLoop]: Abstraction has 457 states and 540 transitions. [2018-09-23 21:31:29,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:29,355 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 540 transitions. [2018-09-23 21:31:29,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-23 21:31:29,356 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:29,356 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-09-23 21:31:29,357 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:29,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:29,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1096614215, now seen corresponding path program 3 times [2018-09-23 21:31:29,357 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:29,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:29,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:29,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:31:29,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:29,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:29,453 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-09-23 21:31:29,453 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:29,454 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:31:29,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:29,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:29,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:29,454 INFO L87 Difference]: Start difference. First operand 457 states and 540 transitions. Second operand 3 states. [2018-09-23 21:31:29,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:29,481 INFO L93 Difference]: Finished difference Result 464 states and 547 transitions. [2018-09-23 21:31:29,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:29,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2018-09-23 21:31:29,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:29,482 INFO L225 Difference]: With dead ends: 464 [2018-09-23 21:31:29,482 INFO L226 Difference]: Without dead ends: 0 [2018-09-23 21:31:29,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:29,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-23 21:31:29,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-23 21:31:29,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-23 21:31:29,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-23 21:31:29,484 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2018-09-23 21:31:29,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:29,484 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-23 21:31:29,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:29,485 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-23 21:31:29,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-23 21:31:29,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-23 21:31:29,648 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-09-23 21:31:30,184 INFO L422 ceAbstractionStarter]: At program point L320(lines 313 321) the Hoare annotation is: (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (<= 0 ~send5) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) (<= ~send5 127)) [2018-09-23 21:31:30,184 INFO L422 ceAbstractionStarter]: At program point L411(lines 407 418) the Hoare annotation is: (and (<= 1 ~mode4) (<= 0 ~send5) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (<= ~send4 127) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (= .cse0 ~p5_old) (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (<= ~mode4 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (not (= ~p4_old ~nomsg)) (<= ~send5 127)) [2018-09-23 21:31:30,184 INFO L422 ceAbstractionStarter]: At program point L279(lines 279 291) the Hoare annotation is: (let ((.cse0 (<= 0 ~send5)) (.cse1 (<= 0 ~send4)) (.cse2 (<= ~send4 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= ~r1 (* 256 (div ~r1 256)))) (.cse5 (<= ~send5 127))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse1 (= ~mode2 (* 256 (div ~mode2 256))) .cse2 .cse3 .cse4 (= ~mode4 (* 256 (div ~mode4 256))) .cse5) (and (<= 1 ~mode4) .cse0 (<= 1 ~mode1) .cse1 (<= ~mode1 1) .cse2 (exists ((v_prenex_1 Int)) (let ((.cse6 (mod v_prenex_1 256))) (and (= .cse6 ~p5_old) (<= .cse6 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (<= ~mode4 1) .cse3 .cse4 (not (= ~p4_old ~nomsg)) .cse5))) [2018-09-23 21:31:30,185 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 443) no Hoare annotation was computed. [2018-09-23 21:31:30,185 INFO L422 ceAbstractionStarter]: At program point L432(lines 432 439) the Hoare annotation is: (and (<= 1 ~mode4) (= ULTIMATE.start_assert_~arg 1) (<= 0 ~send4) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (not (= ~p4_old ~nomsg)) (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (<= 1 ULTIMATE.start_check_~tmp~108) (<= ~send4 127) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (= .cse0 ~p5_old) (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (<= ~mode4 1) (<= ~send5 127)) [2018-09-23 21:31:30,185 INFO L422 ceAbstractionStarter]: At program point L325(lines 325 335) the Hoare annotation is: (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (<= 0 ~send5) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) (<= ~send5 127)) [2018-09-23 21:31:30,186 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 81 444) no Hoare annotation was computed. [2018-09-23 21:31:30,186 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 81 444) no Hoare annotation was computed. [2018-09-23 21:31:30,186 INFO L422 ceAbstractionStarter]: At program point L441(lines 272 441) the Hoare annotation is: (let ((.cse0 (<= 0 ~send5)) (.cse1 (<= 0 ~send4)) (.cse2 (<= ~send4 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= ~r1 (* 256 (div ~r1 256)))) (.cse5 (<= ~send5 127))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse1 (= ~mode2 (* 256 (div ~mode2 256))) .cse2 .cse3 .cse4 (= ~mode4 (* 256 (div ~mode4 256))) .cse5) (and (<= 1 ~mode4) .cse0 (<= 1 ~mode1) .cse1 (<= ~mode1 1) .cse2 (exists ((v_prenex_1 Int)) (let ((.cse6 (mod v_prenex_1 256))) (and (= .cse6 ~p5_old) (<= .cse6 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (<= ~mode4 1) .cse3 .cse4 (not (= ~p4_old ~nomsg)) .cse5))) [2018-09-23 21:31:30,186 INFO L422 ceAbstractionStarter]: At program point L342(lines 334 343) the Hoare annotation is: (and (= ~mode5 (* 256 (div ~mode5 256))) (<= 0 ~send5) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) (<= ~send5 127)) [2018-09-23 21:31:30,186 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 81 444) no Hoare annotation was computed. [2018-09-23 21:31:30,186 INFO L422 ceAbstractionStarter]: At program point L347(lines 347 357) the Hoare annotation is: (and (= ~mode5 (* 256 (div ~mode5 256))) (<= 0 ~send5) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) (<= ~send5 127)) [2018-09-23 21:31:30,187 INFO L422 ceAbstractionStarter]: At program point L438(lines 438 442) the Hoare annotation is: false [2018-09-23 21:31:30,187 INFO L422 ceAbstractionStarter]: At program point L364(lines 356 365) the Hoare annotation is: (and (= ~mode5 (* 256 (div ~mode5 256))) (<= 1 ~mode4) (<= 0 ~send5) (not (= ~p4_new ~nomsg)) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (<= ~send4 127) (<= ~mode4 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127)) [2018-09-23 21:31:30,191 INFO L422 ceAbstractionStarter]: At program point L298(lines 290 299) the Hoare annotation is: (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (<= 0 ~send5) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (= ~mode2 (* 256 (div ~mode2 256))) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) (<= ~send5 127)) [2018-09-23 21:31:30,191 INFO L422 ceAbstractionStarter]: At program point L422(lines 417 423) the Hoare annotation is: (and (<= 1 ~mode4) (<= 0 ~send4) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (not (= ~p4_old ~nomsg)) (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (<= 1 ULTIMATE.start_check_~tmp~108) (<= ~send4 127) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (= .cse0 ~p5_old) (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (<= ~mode4 1) (<= ~send5 127)) [2018-09-23 21:31:30,191 INFO L422 ceAbstractionStarter]: At program point L402(lines 402 408) the Hoare annotation is: (and (<= 1 ~mode4) (<= 0 ~send5) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (<= ~send4 127) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (= .cse0 ~p5_old) (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (<= ~mode4 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (not (= ~p4_old ~nomsg)) (<= ~send5 127)) [2018-09-23 21:31:30,191 INFO L422 ceAbstractionStarter]: At program point L369(lines 369 379) the Hoare annotation is: (and (= ~mode5 (* 256 (div ~mode5 256))) (<= 1 ~mode4) (<= 0 ~send5) (not (= ~p4_new ~nomsg)) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (<= ~send4 127) (<= ~mode4 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127)) [2018-09-23 21:31:30,192 INFO L422 ceAbstractionStarter]: At program point L303(lines 303 314) the Hoare annotation is: (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (<= 0 ~send5) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (= ~mode2 (* 256 (div ~mode2 256))) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) (<= ~send5 127)) [2018-09-23 21:31:30,192 INFO L422 ceAbstractionStarter]: At program point L386(lines 378 387) the Hoare annotation is: (and (<= 1 ~mode4) (<= 1 ~mode1) (<= 0 ~send5) (not (= ~p4_new ~nomsg)) (<= ~mode1 1) (<= 0 ~send4) (<= ~send4 127) (<= ~mode4 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (= ~p5_new .cse0) (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (<= ~send5 127)) [2018-09-23 21:31:30,206 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,207 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,207 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,207 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,210 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,211 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,211 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,211 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,213 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,213 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,213 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,213 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,215 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,215 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,215 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,216 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,220 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,221 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,221 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,221 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,223 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,223 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,223 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,223 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,226 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,226 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,226 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,226 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,228 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,229 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,229 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,229 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,231 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,231 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,232 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,232 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,233 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,234 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,234 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,234 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,236 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,236 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,237 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,237 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,238 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,239 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,239 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,239 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,240 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,241 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,241 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,241 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,243 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,243 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,243 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,244 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,247 INFO L202 PluginConnector]: Adding new model pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.09 09:31:30 BoogieIcfgContainer [2018-09-23 21:31:30,247 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-23 21:31:30,248 INFO L168 Benchmark]: Toolchain (without parser) took 10094.22 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 48.2 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 339.7 MB). Peak memory consumption was 387.9 MB. Max. memory is 7.1 GB. [2018-09-23 21:31:30,249 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 21:31:30,250 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 21:31:30,250 INFO L168 Benchmark]: Boogie Preprocessor took 33.12 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 21:31:30,251 INFO L168 Benchmark]: RCFGBuilder took 705.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-23 21:31:30,252 INFO L168 Benchmark]: TraceAbstraction took 9296.94 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 48.2 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 297.4 MB). Peak memory consumption was 345.6 MB. Max. memory is 7.1 GB. [2018-09-23 21:31:30,256 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 52.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.12 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 705.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9296.94 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 48.2 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 297.4 MB). Peak memory consumption was 345.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 443]: 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: 303]: Loop Invariant Derived loop invariant: ((((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~send5 <= 127 - InvariantResult [Line: 272]: Loop Invariant [2018-09-23 21:31:30,269 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,269 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,269 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,269 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,271 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,271 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,272 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,272 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send4) && ~mode2 == 256 * (~mode2 / 256)) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~send5 <= 127) || (((((((((((1 <= ~mode4 && 0 <= ~send5) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p4_old == ~nomsg)) && ~send5 <= 127) - InvariantResult [Line: 378]: Loop Invariant [2018-09-23 21:31:30,273 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,273 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,273 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,274 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,274 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,275 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,275 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,275 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((((1 <= ~mode4 && 1 <= ~mode1) && 0 <= ~send5) && !(~p4_new == ~nomsg)) && ~mode1 <= 1) && 0 <= ~send4) && ~send4 <= 127) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && (exists v_prenex_1 : int :: ((~p5_new == v_prenex_1 % 256 && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && ~send5 <= 127 - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: ((((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode4) && 0 <= ~send5) && !(~p4_new == ~nomsg)) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127 - InvariantResult [Line: 334]: Loop Invariant Derived loop invariant: ((((((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send5) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~send5 <= 127 - InvariantResult [Line: 438]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: (((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~send5 <= 127 - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~send5 <= 127 - InvariantResult [Line: 402]: Loop Invariant [2018-09-23 21:31:30,278 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,278 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,278 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,278 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,279 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,279 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,280 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,280 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((((1 <= ~mode4 && 0 <= ~send5) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p4_old == ~nomsg)) && ~send5 <= 127 - InvariantResult [Line: 279]: Loop Invariant [2018-09-23 21:31:30,281 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,281 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,282 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,282 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,283 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,284 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,284 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,284 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send4) && ~mode2 == 256 * (~mode2 / 256)) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~send5 <= 127) || (((((((((((1 <= ~mode4 && 0 <= ~send5) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p4_old == ~nomsg)) && ~send5 <= 127) - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: ((((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode4) && 0 <= ~send5) && !(~p4_new == ~nomsg)) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127 - InvariantResult [Line: 417]: Loop Invariant [2018-09-23 21:31:30,286 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,286 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,286 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,286 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,287 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,287 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,287 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,288 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((1 <= ~mode4 && 0 <= ~send4) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p4_old == ~nomsg)) && 0 <= ~send5) && 1 <= ~mode1) && ~mode1 <= 1) && 1 <= check_~tmp~108) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && ~mode4 <= 1) && ~send5 <= 127 - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: ((((((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send5) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~send5 <= 127 - InvariantResult [Line: 407]: Loop Invariant [2018-09-23 21:31:30,289 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,289 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,290 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,290 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,291 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,291 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,291 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,291 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((((1 <= ~mode4 && 0 <= ~send5) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p4_old == ~nomsg)) && ~send5 <= 127 - InvariantResult [Line: 432]: Loop Invariant [2018-09-23 21:31:30,292 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,292 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,293 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,293 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,293 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,294 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,294 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-09-23 21:31:30,294 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((((((1 <= ~mode4 && assert_~arg == 1) && 0 <= ~send4) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p4_old == ~nomsg)) && 0 <= ~send5) && 1 <= ~mode1) && ~mode1 <= 1) && 1 <= check_~tmp~108) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && ~mode4 <= 1) && ~send5 <= 127 - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: (((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~send5 <= 127 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. SAFE Result, 9.1s OverallTime, 10 OverallIterations, 6 TraceHistogramMax, 4.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 329 SDtfs, 304 SDslu, 256 SDs, 0 SdLazy, 185 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1205occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 690 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 33 NumberOfFragments, 953 HoareAnnotationTreeSize, 16 FomulaSimplifications, 314 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 457 NumberOfCodeBlocks, 457 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 446 ConstructedInterpolants, 7 QuantifiedInterpolants, 72550 SizeOfPredicates, 4 NumberOfNonLiveVariables, 491 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 633/645 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.5.1.ufo.UNBOUNDED.pals.c_19.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-23_21-31-30-302.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-23_21-31-30-302.csv Received shutdown request...