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-c372c2b [2018-10-02 11:48:44,961 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 11:48:44,963 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 11:48:44,978 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 11:48:44,979 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 11:48:44,980 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 11:48:44,982 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 11:48:44,983 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 11:48:44,985 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 11:48:44,986 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 11:48:44,987 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 11:48:44,987 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 11:48:44,988 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 11:48:44,989 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 11:48:44,991 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 11:48:44,991 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 11:48:44,992 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 11:48:44,994 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 11:48:44,996 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 11:48:44,998 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 11:48:44,999 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 11:48:45,000 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 11:48:45,003 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 11:48:45,003 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 11:48:45,003 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 11:48:45,004 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 11:48:45,005 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 11:48:45,006 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 11:48:45,007 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 11:48:45,008 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 11:48:45,008 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 11:48:45,009 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 11:48:45,009 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 11:48:45,009 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 11:48:45,010 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 11:48:45,011 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 11:48:45,011 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-10-02 11:48:45,031 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 11:48:45,031 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 11:48:45,032 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 11:48:45,032 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 11:48:45,033 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 11:48:45,033 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 11:48:45,033 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 11:48:45,034 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 11:48:45,034 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 11:48:45,034 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 11:48:45,034 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 11:48:45,034 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 11:48:45,035 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 11:48:45,035 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 11:48:45,035 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 11:48:45,035 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 11:48:45,035 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 11:48:45,035 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 11:48:45,036 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 11:48:45,036 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 11:48:45,036 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 11:48:45,036 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 11:48:45,037 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:48:45,037 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 11:48:45,037 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 11:48:45,037 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 11:48:45,037 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 11:48:45,038 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 11:48:45,038 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 11:48:45,038 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 11:48:45,088 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 11:48:45,101 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 11:48:45,105 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 11:48:45,107 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 11:48:45,108 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 11:48:45,109 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-10-02 11:48:45,109 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-10-02 11:48:45,190 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 11:48:45,193 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 11:48:45,194 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 11:48:45,194 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 11:48:45,195 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 11:48:45,214 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 02.10 11:48:45" (1/1) ... [2018-10-02 11:48:45,231 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 02.10 11:48:45" (1/1) ... [2018-10-02 11:48:45,240 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 11:48:45,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 11:48:45,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 11:48:45,241 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 11:48:45,253 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 02.10 11:48:45" (1/1) ... [2018-10-02 11:48:45,253 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 02.10 11:48:45" (1/1) ... [2018-10-02 11:48:45,256 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 02.10 11:48:45" (1/1) ... [2018-10-02 11:48:45,257 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 02.10 11:48:45" (1/1) ... [2018-10-02 11:48:45,275 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 02.10 11:48:45" (1/1) ... [2018-10-02 11:48:45,282 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 02.10 11:48:45" (1/1) ... [2018-10-02 11:48:45,284 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 02.10 11:48:45" (1/1) ... [2018-10-02 11:48:45,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 11:48:45,289 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 11:48:45,289 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 11:48:45,289 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 11:48:45,290 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 02.10 11:48:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:48:45,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 11:48:45,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 11:48:46,043 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 11:48:46,044 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 02.10 11:48:46 BoogieIcfgContainer [2018-10-02 11:48:46,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 11:48:46,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 11:48:46,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 11:48:46,049 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 11:48:46,049 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 02.10 11:48:45" (1/2) ... [2018-10-02 11:48:46,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f594b54 and model type pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:48:46, skipping insertion in model container [2018-10-02 11:48:46,051 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 02.10 11:48:46" (2/2) ... [2018-10-02 11:48:46,053 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals.c_19.bpl [2018-10-02 11:48:46,063 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 11:48:46,078 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 11:48:46,141 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 11:48:46,142 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 11:48:46,143 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 11:48:46,143 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 11:48:46,143 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 11:48:46,143 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 11:48:46,143 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 11:48:46,144 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 11:48:46,144 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 11:48:46,167 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-10-02 11:48:46,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-02 11:48:46,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:46,186 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:46,187 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:46,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:46,200 INFO L82 PathProgramCache]: Analyzing trace with hash -61215035, now seen corresponding path program 1 times [2018-10-02 11:48:46,202 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:46,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:46,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:46,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:46,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:46,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:48:46,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:46,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:48:46,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:46,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:46,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:46,478 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2018-10-02 11:48:46,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:46,534 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2018-10-02 11:48:46,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:46,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-02 11:48:46,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:46,548 INFO L225 Difference]: With dead ends: 54 [2018-10-02 11:48:46,549 INFO L226 Difference]: Without dead ends: 35 [2018-10-02 11:48:46,553 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-10-02 11:48:46,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-02 11:48:46,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-10-02 11:48:46,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-02 11:48:46,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2018-10-02 11:48:46,617 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 17 [2018-10-02 11:48:46,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:46,617 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2018-10-02 11:48:46,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:46,618 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2018-10-02 11:48:46,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-02 11:48:46,619 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:46,619 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:46,619 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:46,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:46,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1341078713, now seen corresponding path program 1 times [2018-10-02 11:48:46,620 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:46,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:46,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:46,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:46,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:46,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:48:46,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:46,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:48:46,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:46,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:46,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:46,786 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand 3 states. [2018-10-02 11:48:46,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:46,845 INFO L93 Difference]: Finished difference Result 97 states and 139 transitions. [2018-10-02 11:48:46,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:46,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-02 11:48:46,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:46,848 INFO L225 Difference]: With dead ends: 97 [2018-10-02 11:48:46,848 INFO L226 Difference]: Without dead ends: 65 [2018-10-02 11:48:46,849 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-10-02 11:48:46,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-02 11:48:46,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-10-02 11:48:46,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-02 11:48:46,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2018-10-02 11:48:46,867 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 17 [2018-10-02 11:48:46,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:46,867 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2018-10-02 11:48:46,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:46,867 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2018-10-02 11:48:46,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-02 11:48:46,868 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:46,868 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:46,869 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:46,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:46,869 INFO L82 PathProgramCache]: Analyzing trace with hash -754272699, now seen corresponding path program 1 times [2018-10-02 11:48:46,870 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:46,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:46,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:46,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:46,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:46,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:48:46,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:46,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:48:46,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:46,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:46,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:46,974 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand 3 states. [2018-10-02 11:48:47,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:47,032 INFO L93 Difference]: Finished difference Result 187 states and 268 transitions. [2018-10-02 11:48:47,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:47,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-02 11:48:47,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:47,037 INFO L225 Difference]: With dead ends: 187 [2018-10-02 11:48:47,037 INFO L226 Difference]: Without dead ends: 125 [2018-10-02 11:48:47,038 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-10-02 11:48:47,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-02 11:48:47,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-10-02 11:48:47,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-02 11:48:47,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 174 transitions. [2018-10-02 11:48:47,087 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 174 transitions. Word has length 17 [2018-10-02 11:48:47,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:47,087 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 174 transitions. [2018-10-02 11:48:47,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:47,088 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 174 transitions. [2018-10-02 11:48:47,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-02 11:48:47,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:47,089 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:47,089 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:47,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:47,090 INFO L82 PathProgramCache]: Analyzing trace with hash -53208121, now seen corresponding path program 1 times [2018-10-02 11:48:47,090 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:47,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:47,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:47,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:47,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:47,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:48:47,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:47,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:48:47,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:47,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:47,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:47,200 INFO L87 Difference]: Start difference. First operand 123 states and 174 transitions. Second operand 3 states. [2018-10-02 11:48:47,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:47,306 INFO L93 Difference]: Finished difference Result 367 states and 520 transitions. [2018-10-02 11:48:47,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:47,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-02 11:48:47,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:47,310 INFO L225 Difference]: With dead ends: 367 [2018-10-02 11:48:47,310 INFO L226 Difference]: Without dead ends: 245 [2018-10-02 11:48:47,311 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-10-02 11:48:47,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-02 11:48:47,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-10-02 11:48:47,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-02 11:48:47,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 338 transitions. [2018-10-02 11:48:47,380 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 338 transitions. Word has length 17 [2018-10-02 11:48:47,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:47,381 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 338 transitions. [2018-10-02 11:48:47,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:47,381 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 338 transitions. [2018-10-02 11:48:47,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-02 11:48:47,386 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:47,387 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:47,387 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:47,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:47,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1721799241, now seen corresponding path program 1 times [2018-10-02 11:48:47,388 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:47,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:47,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:47,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:47,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:47,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:48:47,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:47,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 11:48:47,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 11:48:47,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 11:48:47,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:48:47,560 INFO L87 Difference]: Start difference. First operand 243 states and 338 transitions. Second operand 4 states. [2018-10-02 11:48:47,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:47,778 INFO L93 Difference]: Finished difference Result 517 states and 707 transitions. [2018-10-02 11:48:47,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 11:48:47,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-10-02 11:48:47,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:47,783 INFO L225 Difference]: With dead ends: 517 [2018-10-02 11:48:47,783 INFO L226 Difference]: Without dead ends: 515 [2018-10-02 11:48:47,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:48:47,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-10-02 11:48:47,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 275. [2018-10-02 11:48:47,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-02 11:48:47,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 370 transitions. [2018-10-02 11:48:47,864 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 370 transitions. Word has length 17 [2018-10-02 11:48:47,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:47,869 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 370 transitions. [2018-10-02 11:48:47,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 11:48:47,869 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 370 transitions. [2018-10-02 11:48:47,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-02 11:48:47,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:47,870 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:47,871 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:47,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:47,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1721858823, now seen corresponding path program 1 times [2018-10-02 11:48:47,871 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:47,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:47,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:47,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:47,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:48,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:48:48,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:48,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:48:48,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 11:48:48,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 11:48:48,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:48:48,029 INFO L87 Difference]: Start difference. First operand 275 states and 370 transitions. Second operand 4 states. [2018-10-02 11:48:48,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:48,439 INFO L93 Difference]: Finished difference Result 879 states and 1193 transitions. [2018-10-02 11:48:48,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 11:48:48,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-10-02 11:48:48,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:48,444 INFO L225 Difference]: With dead ends: 879 [2018-10-02 11:48:48,444 INFO L226 Difference]: Without dead ends: 605 [2018-10-02 11:48:48,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:48:48,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-10-02 11:48:48,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2018-10-02 11:48:48,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2018-10-02 11:48:48,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 776 transitions. [2018-10-02 11:48:48,551 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 776 transitions. Word has length 17 [2018-10-02 11:48:48,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:48,551 INFO L480 AbstractCegarLoop]: Abstraction has 605 states and 776 transitions. [2018-10-02 11:48:48,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 11:48:48,552 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 776 transitions. [2018-10-02 11:48:48,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-02 11:48:48,559 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:48,560 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-10-02 11:48:48,560 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:48,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:48,564 INFO L82 PathProgramCache]: Analyzing trace with hash 868944887, now seen corresponding path program 1 times [2018-10-02 11:48:48,564 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:48,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:48,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:48,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:48,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:48,758 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-02 11:48:48,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:48,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:48:48,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:48,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:48,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:48,760 INFO L87 Difference]: Start difference. First operand 605 states and 776 transitions. Second operand 3 states. [2018-10-02 11:48:49,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:49,034 INFO L93 Difference]: Finished difference Result 1809 states and 2322 transitions. [2018-10-02 11:48:49,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:49,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-10-02 11:48:49,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:49,042 INFO L225 Difference]: With dead ends: 1809 [2018-10-02 11:48:49,042 INFO L226 Difference]: Without dead ends: 1207 [2018-10-02 11:48:49,044 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-10-02 11:48:49,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2018-10-02 11:48:49,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1205. [2018-10-02 11:48:49,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-10-02 11:48:49,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1508 transitions. [2018-10-02 11:48:49,246 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1508 transitions. Word has length 62 [2018-10-02 11:48:49,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:49,247 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1508 transitions. [2018-10-02 11:48:49,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:49,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1508 transitions. [2018-10-02 11:48:49,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-02 11:48:49,252 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:49,252 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-10-02 11:48:49,253 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:49,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:49,253 INFO L82 PathProgramCache]: Analyzing trace with hash 2034253683, now seen corresponding path program 1 times [2018-10-02 11:48:49,253 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:49,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:49,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:49,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:49,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:49,511 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-02 11:48:49,679 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-10-02 11:48:49,942 WARN L178 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-10-02 11:48:49,962 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 55 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-02 11:48:49,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:48:49,963 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:48:49,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:50,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:48:50,740 WARN L178 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-10-02 11:48:51,030 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-02 11:48:51,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:48:51,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-10-02 11:48:51,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:48:51,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:48:51,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:48:51,069 INFO L87 Difference]: Start difference. First operand 1205 states and 1508 transitions. Second operand 8 states. [2018-10-02 11:48:51,396 WARN L178 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-10-02 11:48:52,300 WARN L178 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2018-10-02 11:48:52,711 WARN L178 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2018-10-02 11:48:53,473 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2018-10-02 11:48:53,949 WARN L178 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2018-10-02 11:48:54,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:54,643 INFO L93 Difference]: Finished difference Result 2293 states and 2844 transitions. [2018-10-02 11:48:54,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-02 11:48:54,644 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2018-10-02 11:48:54,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:54,649 INFO L225 Difference]: With dead ends: 2293 [2018-10-02 11:48:54,650 INFO L226 Difference]: Without dead ends: 1091 [2018-10-02 11:48:54,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2018-10-02 11:48:54,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2018-10-02 11:48:54,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 653. [2018-10-02 11:48:54,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2018-10-02 11:48:54,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 808 transitions. [2018-10-02 11:48:54,817 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 808 transitions. Word has length 62 [2018-10-02 11:48:54,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:54,817 INFO L480 AbstractCegarLoop]: Abstraction has 653 states and 808 transitions. [2018-10-02 11:48:54,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:48:54,818 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 808 transitions. [2018-10-02 11:48:54,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-02 11:48:54,819 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:54,820 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-10-02 11:48:54,820 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:54,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:54,820 INFO L82 PathProgramCache]: Analyzing trace with hash -552343681, now seen corresponding path program 2 times [2018-10-02 11:48:54,820 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:54,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:54,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:54,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:54,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:54,912 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-10-02 11:48:54,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:54,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:48:54,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:54,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:54,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:54,914 INFO L87 Difference]: Start difference. First operand 653 states and 808 transitions. Second operand 3 states. [2018-10-02 11:48:55,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:55,095 INFO L93 Difference]: Finished difference Result 1109 states and 1359 transitions. [2018-10-02 11:48:55,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:55,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-10-02 11:48:55,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:55,099 INFO L225 Difference]: With dead ends: 1109 [2018-10-02 11:48:55,099 INFO L226 Difference]: Without dead ends: 459 [2018-10-02 11:48:55,100 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-10-02 11:48:55,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-10-02 11:48:55,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 457. [2018-10-02 11:48:55,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-10-02 11:48:55,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 540 transitions. [2018-10-02 11:48:55,237 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 540 transitions. Word has length 77 [2018-10-02 11:48:55,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:55,237 INFO L480 AbstractCegarLoop]: Abstraction has 457 states and 540 transitions. [2018-10-02 11:48:55,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:55,237 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 540 transitions. [2018-10-02 11:48:55,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-02 11:48:55,238 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:55,239 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-10-02 11:48:55,239 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:55,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:55,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1096614215, now seen corresponding path program 3 times [2018-10-02 11:48:55,239 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:55,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:55,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:55,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:48:55,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:55,411 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-02 11:48:55,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:55,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:48:55,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:55,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:55,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:55,413 INFO L87 Difference]: Start difference. First operand 457 states and 540 transitions. Second operand 3 states. [2018-10-02 11:48:55,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:55,445 INFO L93 Difference]: Finished difference Result 464 states and 547 transitions. [2018-10-02 11:48:55,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:55,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2018-10-02 11:48:55,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:55,446 INFO L225 Difference]: With dead ends: 464 [2018-10-02 11:48:55,447 INFO L226 Difference]: Without dead ends: 0 [2018-10-02 11:48:55,448 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-10-02 11:48:55,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-02 11:48:55,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-02 11:48:55,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-02 11:48:55,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-02 11:48:55,449 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2018-10-02 11:48:55,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:55,449 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-02 11:48:55,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:55,449 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-02 11:48:55,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-02 11:48:55,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-02 11:48:55,849 WARN L178 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-10-02 11:48:56,154 WARN L178 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-10-02 11:48:56,692 INFO L421 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-10-02 11:48:56,692 INFO L421 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-10-02 11:48:56,693 INFO L421 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-10-02 11:48:56,693 INFO L421 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-10-02 11:48:56,693 INFO L421 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-10-02 11:48:56,693 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 81 444) no Hoare annotation was computed. [2018-10-02 11:48:56,694 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 81 444) no Hoare annotation was computed. [2018-10-02 11:48:56,694 INFO L421 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-10-02 11:48:56,694 INFO L421 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-10-02 11:48:56,694 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 81 444) no Hoare annotation was computed. [2018-10-02 11:48:56,695 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 443) no Hoare annotation was computed. [2018-10-02 11:48:56,695 INFO L421 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-10-02 11:48:56,695 INFO L421 ceAbstractionStarter]: At program point L438(lines 438 442) the Hoare annotation is: false [2018-10-02 11:48:56,695 INFO L421 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-10-02 11:48:56,696 INFO L421 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-10-02 11:48:56,696 INFO L421 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-10-02 11:48:56,696 INFO L421 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-10-02 11:48:56,697 INFO L421 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-10-02 11:48:56,697 INFO L421 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-10-02 11:48:56,697 INFO L421 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-10-02 11:48:56,716 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,717 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,718 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,718 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,724 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,724 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,724 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,725 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,730 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,731 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,731 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,731 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,733 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,733 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,733 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,734 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,740 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,741 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,741 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,741 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,743 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,743 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,751 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,751 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,755 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,755 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,756 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,756 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,762 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,762 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,763 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,763 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,767 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,767 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,767 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,768 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,771 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,772 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,772 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,772 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,777 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,777 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,778 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,778 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,779 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,779 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,780 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,780 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,781 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,782 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,782 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,782 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,783 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,783 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,784 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,784 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,786 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 02.10 11:48:56 BoogieIcfgContainer [2018-10-02 11:48:56,787 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 11:48:56,788 INFO L168 Benchmark]: Toolchain (without parser) took 11597.73 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 34.6 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 367.9 MB). Peak memory consumption was 402.6 MB. Max. memory is 7.1 GB. [2018-10-02 11:48:56,790 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:48:56,790 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:48:56,794 INFO L168 Benchmark]: Boogie Preprocessor took 47.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:48:56,795 INFO L168 Benchmark]: RCFGBuilder took 755.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-02 11:48:56,796 INFO L168 Benchmark]: TraceAbstraction took 10741.31 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 34.6 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 336.2 MB). Peak memory consumption was 370.8 MB. Max. memory is 7.1 GB. [2018-10-02 11:48:56,801 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 46.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 755.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10741.31 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 34.6 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 336.2 MB). Peak memory consumption was 370.8 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-10-02 11:48:56,821 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,821 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,821 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,821 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,822 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,823 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,823 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,823 WARN L390 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-10-02 11:48:56,824 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,824 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,824 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,833 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,834 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,834 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,834 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,834 WARN L390 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-10-02 11:48:56,839 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,839 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,839 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,839 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,840 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,840 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,841 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,841 WARN L390 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-10-02 11:48:56,842 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,842 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,842 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,843 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,843 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,844 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,844 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,844 WARN L390 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-10-02 11:48:56,845 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,845 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,846 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,846 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,846 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,847 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,847 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,847 WARN L390 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-10-02 11:48:56,848 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,848 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,849 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,849 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,849 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,850 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,850 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,850 WARN L390 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-10-02 11:48:56,851 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,851 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,851 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,851 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,852 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,852 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,852 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-02 11:48:56,852 WARN L390 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, 10.5s OverallTime, 10 OverallIterations, 6 TraceHistogramMax, 5.0s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 329 SDtfs, 304 SDslu, 256 SDs, 0 SdLazy, 185 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 3.9s 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, 1.1s 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-10-02_11-48-56-860.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-10-02_11-48-56-860.csv Received shutdown request...