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/s3_srvr_3.cil.c_20.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-00a8621 [2018-09-30 10:28:48,368 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:28:48,370 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:28:48,382 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:28:48,382 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:28:48,384 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:28:48,386 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:28:48,388 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:28:48,390 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:28:48,391 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:28:48,392 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:28:48,392 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:28:48,393 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:28:48,394 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:28:48,395 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:28:48,396 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:28:48,399 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:28:48,403 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:28:48,405 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:28:48,407 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:28:48,413 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:28:48,415 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:28:48,420 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:28:48,420 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:28:48,421 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:28:48,422 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:28:48,423 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:28:48,423 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:28:48,428 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:28:48,431 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:28:48,431 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:28:48,432 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:28:48,433 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:28:48,433 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:28:48,436 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:28:48,437 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:28:48,437 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-30 10:28:48,466 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:28:48,466 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:28:48,468 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:28:48,468 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:28:48,469 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:28:48,469 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:28:48,469 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:28:48,470 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:28:48,470 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:28:48,470 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:28:48,470 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:28:48,470 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:28:48,471 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:28:48,471 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:28:48,471 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:28:48,471 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:28:48,472 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:28:48,473 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:28:48,473 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:28:48,473 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:28:48,473 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:28:48,473 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:28:48,473 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:28:48,474 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:28:48,474 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:28:48,474 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:28:48,474 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:28:48,474 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:28:48,475 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:28:48,475 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:28:48,528 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:28:48,541 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:28:48,544 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:28:48,546 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:28:48,547 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:28:48,547 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3.cil.c_20.bpl [2018-09-30 10:28:48,548 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3.cil.c_20.bpl' [2018-09-30 10:28:48,639 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:28:48,643 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:28:48,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:28:48,644 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:28:48,644 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:28:48,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:48" (1/1) ... [2018-09-30 10:28:48,685 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:48" (1/1) ... [2018-09-30 10:28:48,692 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:28:48,693 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:28:48,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:28:48,693 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:28:48,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:48" (1/1) ... [2018-09-30 10:28:48,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:48" (1/1) ... [2018-09-30 10:28:48,709 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:48" (1/1) ... [2018-09-30 10:28:48,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:48" (1/1) ... [2018-09-30 10:28:48,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:48" (1/1) ... [2018-09-30 10:28:48,723 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:48" (1/1) ... [2018-09-30 10:28:48,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:48" (1/1) ... [2018-09-30 10:28:48,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:28:48,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:28:48,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:28:48,742 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:28:48,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:28:48,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 10:28:48,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 10:28:49,486 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 10:28:49,486 INFO L202 PluginConnector]: Adding new model s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:28:49 BoogieIcfgContainer [2018-09-30 10:28:49,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:28:49,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:28:49,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:28:49,491 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:28:49,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:48" (1/2) ... [2018-09-30 10:28:49,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48db8102 and model type s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:28:49, skipping insertion in model container [2018-09-30 10:28:49,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:28:49" (2/2) ... [2018-09-30 10:28:49,494 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.cil.c_20.bpl [2018-09-30 10:28:49,503 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:28:49,511 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 10:28:49,563 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:28:49,564 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:28:49,564 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:28:49,564 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:28:49,565 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:28:49,565 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:28:49,565 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:28:49,565 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:28:49,565 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:28:49,581 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-09-30 10:28:49,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 10:28:49,588 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:49,589 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:49,590 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:49,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:49,597 INFO L82 PathProgramCache]: Analyzing trace with hash -505433777, now seen corresponding path program 1 times [2018-09-30 10:28:49,599 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:49,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:49,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:49,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:49,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:49,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:28:49,871 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:49,872 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:28:49,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:49,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:49,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:49,891 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-09-30 10:28:50,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:50,347 INFO L93 Difference]: Finished difference Result 56 states and 94 transitions. [2018-09-30 10:28:50,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:50,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-30 10:28:50,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:50,362 INFO L225 Difference]: With dead ends: 56 [2018-09-30 10:28:50,362 INFO L226 Difference]: Without dead ends: 34 [2018-09-30 10:28:50,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:50,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-30 10:28:50,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-09-30 10:28:50,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-30 10:28:50,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2018-09-30 10:28:50,416 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 15 [2018-09-30 10:28:50,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:50,416 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2018-09-30 10:28:50,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:50,416 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2018-09-30 10:28:50,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-30 10:28:50,418 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:50,418 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:50,418 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:50,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:50,419 INFO L82 PathProgramCache]: Analyzing trace with hash -912155323, now seen corresponding path program 1 times [2018-09-30 10:28:50,419 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:50,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:50,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:50,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:50,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:50,524 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:28:50,526 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:50,526 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:28:50,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:50,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:50,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:50,529 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2018-09-30 10:28:50,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:50,693 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-09-30 10:28:50,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:50,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-09-30 10:28:50,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:50,695 INFO L225 Difference]: With dead ends: 83 [2018-09-30 10:28:50,696 INFO L226 Difference]: Without dead ends: 50 [2018-09-30 10:28:50,697 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:50,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-30 10:28:50,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-09-30 10:28:50,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-30 10:28:50,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 83 transitions. [2018-09-30 10:28:50,722 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 83 transitions. Word has length 23 [2018-09-30 10:28:50,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:50,724 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 83 transitions. [2018-09-30 10:28:50,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:50,724 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 83 transitions. [2018-09-30 10:28:50,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-30 10:28:50,726 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:50,726 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:50,726 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:50,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:50,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1423527905, now seen corresponding path program 1 times [2018-09-30 10:28:50,729 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:50,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:50,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:50,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:50,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:50,819 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-30 10:28:50,819 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:50,820 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:28:50,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:50,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:50,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:50,821 INFO L87 Difference]: Start difference. First operand 50 states and 83 transitions. Second operand 3 states. [2018-09-30 10:28:51,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:51,154 INFO L93 Difference]: Finished difference Result 106 states and 177 transitions. [2018-09-30 10:28:51,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:51,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-09-30 10:28:51,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:51,157 INFO L225 Difference]: With dead ends: 106 [2018-09-30 10:28:51,157 INFO L226 Difference]: Without dead ends: 57 [2018-09-30 10:28:51,158 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:51,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-30 10:28:51,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-09-30 10:28:51,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-30 10:28:51,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 92 transitions. [2018-09-30 10:28:51,170 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 92 transitions. Word has length 30 [2018-09-30 10:28:51,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:51,170 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 92 transitions. [2018-09-30 10:28:51,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:51,171 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 92 transitions. [2018-09-30 10:28:51,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-30 10:28:51,172 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:51,172 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:51,173 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:51,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:51,173 INFO L82 PathProgramCache]: Analyzing trace with hash 222883017, now seen corresponding path program 1 times [2018-09-30 10:28:51,173 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:51,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:51,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:51,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:51,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:51,277 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:28:51,277 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:51,278 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:28:51,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:51,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:51,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:51,279 INFO L87 Difference]: Start difference. First operand 57 states and 92 transitions. Second operand 3 states. [2018-09-30 10:28:51,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:51,488 INFO L93 Difference]: Finished difference Result 131 states and 214 transitions. [2018-09-30 10:28:51,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:51,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-09-30 10:28:51,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:51,491 INFO L225 Difference]: With dead ends: 131 [2018-09-30 10:28:51,492 INFO L226 Difference]: Without dead ends: 74 [2018-09-30 10:28:51,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:51,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-30 10:28:51,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-09-30 10:28:51,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-30 10:28:51,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 120 transitions. [2018-09-30 10:28:51,506 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 120 transitions. Word has length 30 [2018-09-30 10:28:51,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:51,507 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 120 transitions. [2018-09-30 10:28:51,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:51,507 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 120 transitions. [2018-09-30 10:28:51,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-30 10:28:51,509 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:51,509 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:51,509 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:51,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:51,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1035189339, now seen corresponding path program 1 times [2018-09-30 10:28:51,510 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:51,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:51,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:51,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:51,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:51,584 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-09-30 10:28:51,584 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:51,585 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:28:51,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:51,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:51,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:51,586 INFO L87 Difference]: Start difference. First operand 74 states and 120 transitions. Second operand 3 states. [2018-09-30 10:28:51,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:51,960 INFO L93 Difference]: Finished difference Result 153 states and 249 transitions. [2018-09-30 10:28:51,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:51,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-09-30 10:28:51,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:51,962 INFO L225 Difference]: With dead ends: 153 [2018-09-30 10:28:51,962 INFO L226 Difference]: Without dead ends: 80 [2018-09-30 10:28:51,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:51,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-09-30 10:28:51,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-09-30 10:28:51,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-09-30 10:28:51,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 125 transitions. [2018-09-30 10:28:51,977 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 125 transitions. Word has length 36 [2018-09-30 10:28:51,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:51,978 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 125 transitions. [2018-09-30 10:28:51,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:51,978 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 125 transitions. [2018-09-30 10:28:51,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-30 10:28:51,980 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:51,980 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:51,980 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:51,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:51,981 INFO L82 PathProgramCache]: Analyzing trace with hash -720649021, now seen corresponding path program 1 times [2018-09-30 10:28:51,981 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:51,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:51,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:51,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:51,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:52,045 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-09-30 10:28:52,046 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:52,046 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:28:52,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:52,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:52,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:52,047 INFO L87 Difference]: Start difference. First operand 80 states and 125 transitions. Second operand 3 states. [2018-09-30 10:28:52,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:52,230 INFO L93 Difference]: Finished difference Result 164 states and 257 transitions. [2018-09-30 10:28:52,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:52,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-09-30 10:28:52,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:52,232 INFO L225 Difference]: With dead ends: 164 [2018-09-30 10:28:52,232 INFO L226 Difference]: Without dead ends: 85 [2018-09-30 10:28:52,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:52,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-30 10:28:52,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-30 10:28:52,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-30 10:28:52,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2018-09-30 10:28:52,254 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 41 [2018-09-30 10:28:52,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:52,255 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2018-09-30 10:28:52,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:52,255 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2018-09-30 10:28:52,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-30 10:28:52,257 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:52,257 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:52,257 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:52,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:52,258 INFO L82 PathProgramCache]: Analyzing trace with hash -2015268887, now seen corresponding path program 1 times [2018-09-30 10:28:52,258 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:52,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:52,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:52,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:52,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:52,330 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-09-30 10:28:52,330 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:52,331 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:28:52,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:52,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:52,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:52,332 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand 3 states. [2018-09-30 10:28:52,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:52,559 INFO L93 Difference]: Finished difference Result 181 states and 270 transitions. [2018-09-30 10:28:52,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:52,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-09-30 10:28:52,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:52,561 INFO L225 Difference]: With dead ends: 181 [2018-09-30 10:28:52,561 INFO L226 Difference]: Without dead ends: 96 [2018-09-30 10:28:52,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:52,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-09-30 10:28:52,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-09-30 10:28:52,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-30 10:28:52,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 140 transitions. [2018-09-30 10:28:52,579 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 140 transitions. Word has length 44 [2018-09-30 10:28:52,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:52,579 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 140 transitions. [2018-09-30 10:28:52,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:52,580 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 140 transitions. [2018-09-30 10:28:52,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-30 10:28:52,581 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:52,582 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:52,582 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:52,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:52,583 INFO L82 PathProgramCache]: Analyzing trace with hash 483195845, now seen corresponding path program 1 times [2018-09-30 10:28:52,583 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:52,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:52,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:52,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:52,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-09-30 10:28:52,676 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:52,676 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:28:52,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:52,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:52,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:52,677 INFO L87 Difference]: Start difference. First operand 96 states and 140 transitions. Second operand 3 states. [2018-09-30 10:28:53,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:53,113 INFO L93 Difference]: Finished difference Result 195 states and 285 transitions. [2018-09-30 10:28:53,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:53,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-09-30 10:28:53,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:53,115 INFO L225 Difference]: With dead ends: 195 [2018-09-30 10:28:53,115 INFO L226 Difference]: Without dead ends: 100 [2018-09-30 10:28:53,116 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:53,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-09-30 10:28:53,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-09-30 10:28:53,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-30 10:28:53,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 138 transitions. [2018-09-30 10:28:53,143 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 138 transitions. Word has length 45 [2018-09-30 10:28:53,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:53,143 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 138 transitions. [2018-09-30 10:28:53,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:53,144 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 138 transitions. [2018-09-30 10:28:53,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-30 10:28:53,149 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:53,149 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:53,149 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:53,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:53,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1326956691, now seen corresponding path program 1 times [2018-09-30 10:28:53,150 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:53,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:53,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:53,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:53,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:53,334 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-30 10:28:53,334 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:28:53,334 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:28:53,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:53,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:28:53,453 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-09-30 10:28:53,486 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 10:28:53,486 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-09-30 10:28:53,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:28:53,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:28:53,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-30 10:28:53,488 INFO L87 Difference]: Start difference. First operand 100 states and 138 transitions. Second operand 5 states. [2018-09-30 10:28:54,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:54,840 INFO L93 Difference]: Finished difference Result 441 states and 602 transitions. [2018-09-30 10:28:54,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 10:28:54,840 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-09-30 10:28:54,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:54,842 INFO L225 Difference]: With dead ends: 441 [2018-09-30 10:28:54,843 INFO L226 Difference]: Without dead ends: 328 [2018-09-30 10:28:54,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:28:54,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-09-30 10:28:54,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 187. [2018-09-30 10:28:54,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-09-30 10:28:54,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 247 transitions. [2018-09-30 10:28:54,881 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 247 transitions. Word has length 48 [2018-09-30 10:28:54,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:54,881 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 247 transitions. [2018-09-30 10:28:54,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:28:54,882 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 247 transitions. [2018-09-30 10:28:54,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-30 10:28:54,883 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:54,883 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:54,884 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:54,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:54,884 INFO L82 PathProgramCache]: Analyzing trace with hash 636359981, now seen corresponding path program 1 times [2018-09-30 10:28:54,884 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:54,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:54,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:54,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:54,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:54,972 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-09-30 10:28:54,973 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:54,973 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:28:54,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:54,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:54,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:54,974 INFO L87 Difference]: Start difference. First operand 187 states and 247 transitions. Second operand 3 states. [2018-09-30 10:28:55,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:55,342 INFO L93 Difference]: Finished difference Result 374 states and 495 transitions. [2018-09-30 10:28:55,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:55,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-09-30 10:28:55,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:55,344 INFO L225 Difference]: With dead ends: 374 [2018-09-30 10:28:55,344 INFO L226 Difference]: Without dead ends: 182 [2018-09-30 10:28:55,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:55,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-09-30 10:28:55,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-09-30 10:28:55,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-09-30 10:28:55,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 227 transitions. [2018-09-30 10:28:55,383 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 227 transitions. Word has length 64 [2018-09-30 10:28:55,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:55,383 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 227 transitions. [2018-09-30 10:28:55,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:55,383 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 227 transitions. [2018-09-30 10:28:55,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-09-30 10:28:55,385 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:55,385 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:55,387 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:55,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:55,387 INFO L82 PathProgramCache]: Analyzing trace with hash -739459377, now seen corresponding path program 1 times [2018-09-30 10:28:55,388 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:55,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:55,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:55,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:55,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:55,531 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-09-30 10:28:55,531 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:55,531 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:28:55,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:55,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:55,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:55,533 INFO L87 Difference]: Start difference. First operand 182 states and 227 transitions. Second operand 3 states. [2018-09-30 10:28:55,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:55,726 INFO L93 Difference]: Finished difference Result 381 states and 475 transitions. [2018-09-30 10:28:55,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:55,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-09-30 10:28:55,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:55,731 INFO L225 Difference]: With dead ends: 381 [2018-09-30 10:28:55,732 INFO L226 Difference]: Without dead ends: 202 [2018-09-30 10:28:55,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:55,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-09-30 10:28:55,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-09-30 10:28:55,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-09-30 10:28:55,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 247 transitions. [2018-09-30 10:28:55,769 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 247 transitions. Word has length 97 [2018-09-30 10:28:55,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:55,769 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 247 transitions. [2018-09-30 10:28:55,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:55,770 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 247 transitions. [2018-09-30 10:28:55,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-09-30 10:28:55,771 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:55,771 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:55,771 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:55,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:55,772 INFO L82 PathProgramCache]: Analyzing trace with hash -93746177, now seen corresponding path program 1 times [2018-09-30 10:28:55,772 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:55,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:55,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:55,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:55,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:55,898 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-09-30 10:28:55,899 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:55,899 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:28:55,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:55,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:55,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:55,900 INFO L87 Difference]: Start difference. First operand 202 states and 247 transitions. Second operand 3 states. [2018-09-30 10:28:56,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:56,088 INFO L93 Difference]: Finished difference Result 298 states and 365 transitions. [2018-09-30 10:28:56,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:56,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-09-30 10:28:56,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:56,091 INFO L225 Difference]: With dead ends: 298 [2018-09-30 10:28:56,091 INFO L226 Difference]: Without dead ends: 296 [2018-09-30 10:28:56,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:56,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-09-30 10:28:56,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2018-09-30 10:28:56,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-09-30 10:28:56,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 363 transitions. [2018-09-30 10:28:56,141 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 363 transitions. Word has length 107 [2018-09-30 10:28:56,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:56,142 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 363 transitions. [2018-09-30 10:28:56,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:56,142 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 363 transitions. [2018-09-30 10:28:56,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-09-30 10:28:56,144 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:56,144 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 12, 11, 10, 9, 8, 7, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:56,145 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:56,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:56,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1497686773, now seen corresponding path program 1 times [2018-09-30 10:28:56,145 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:56,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:56,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:56,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:56,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:56,333 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2018-09-30 10:28:56,334 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:56,334 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:28:56,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:56,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:56,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:56,335 INFO L87 Difference]: Start difference. First operand 296 states and 363 transitions. Second operand 3 states. [2018-09-30 10:28:56,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:56,572 INFO L93 Difference]: Finished difference Result 589 states and 723 transitions. [2018-09-30 10:28:56,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:56,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2018-09-30 10:28:56,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:56,575 INFO L225 Difference]: With dead ends: 589 [2018-09-30 10:28:56,575 INFO L226 Difference]: Without dead ends: 296 [2018-09-30 10:28:56,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:56,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-09-30 10:28:56,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2018-09-30 10:28:56,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-09-30 10:28:56,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 354 transitions. [2018-09-30 10:28:56,613 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 354 transitions. Word has length 147 [2018-09-30 10:28:56,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:56,614 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 354 transitions. [2018-09-30 10:28:56,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:56,614 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 354 transitions. [2018-09-30 10:28:56,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-30 10:28:56,616 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:56,616 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 16, 15, 14, 12, 10, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:56,616 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:56,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:56,617 INFO L82 PathProgramCache]: Analyzing trace with hash -663980831, now seen corresponding path program 1 times [2018-09-30 10:28:56,617 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:56,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:56,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:56,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:56,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:56,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 740 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-09-30 10:28:56,828 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:28:56,828 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:28:56,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:56,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:28:57,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 740 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-09-30 10:28:57,039 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:28:57,040 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-09-30 10:28:57,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:28:57,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:28:57,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 10:28:57,043 INFO L87 Difference]: Start difference. First operand 296 states and 354 transitions. Second operand 4 states. [2018-09-30 10:28:57,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:57,660 INFO L93 Difference]: Finished difference Result 470 states and 566 transitions. [2018-09-30 10:28:57,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 10:28:57,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2018-09-30 10:28:57,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:57,661 INFO L225 Difference]: With dead ends: 470 [2018-09-30 10:28:57,661 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 10:28:57,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-30 10:28:57,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 10:28:57,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 10:28:57,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 10:28:57,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 10:28:57,663 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 188 [2018-09-30 10:28:57,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:57,664 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 10:28:57,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:28:57,664 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 10:28:57,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 10:28:57,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 10:28:57,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:57,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:57,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:57,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:57,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:57,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:57,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:57,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:57,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:57,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:57,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:57,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:57,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:57,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:57,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:57,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:57,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:57,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:57,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:57,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:57,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:57,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:57,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:57,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:58,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:58,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:58,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:58,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:58,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:58,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:58,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:58,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:58,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:58,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:58,356 WARN L178 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-30 10:28:59,287 WARN L178 SmtUtils]: Spent 928.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2018-09-30 10:28:59,712 WARN L178 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2018-09-30 10:28:59,826 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2018-09-30 10:29:00,040 WARN L178 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2018-09-30 10:29:00,258 WARN L178 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2018-09-30 10:29:00,483 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2018-09-30 10:29:00,686 WARN L178 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-09-30 10:29:00,845 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2018-09-30 10:29:01,058 WARN L178 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2018-09-30 10:29:01,276 WARN L178 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2018-09-30 10:29:01,507 WARN L178 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2018-09-30 10:29:01,625 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2018-09-30 10:29:01,765 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 23 [2018-09-30 10:29:01,768 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 506) no Hoare annotation was computed. [2018-09-30 10:29:01,769 INFO L422 ceAbstractionStarter]: At program point L415(lines 415 427) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse1 .cse2 .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576) .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) .cse3 .cse4))) [2018-09-30 10:29:01,769 INFO L422 ceAbstractionStarter]: At program point L469(lines 469 491) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) [2018-09-30 10:29:01,770 INFO L422 ceAbstractionStarter]: At program point L370(lines 370 378) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3)) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576)) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse5 .cse6) (and .cse0 .cse2 .cse7 .cse3 .cse4 .cse8 .cse5 .cse6) (and .cse9 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) .cse2 .cse3 .cse8 .cse5 .cse6))) [2018-09-30 10:29:01,770 INFO L422 ceAbstractionStarter]: At program point L271(lines 271 287) the Hoare annotation is: (let ((.cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 .cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-09-30 10:29:01,770 INFO L422 ceAbstractionStarter]: At program point L461(lines 461 482) the Hoare annotation is: (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) [2018-09-30 10:29:01,771 INFO L422 ceAbstractionStarter]: At program point L490(lines 490 505) the Hoare annotation is: false [2018-09-30 10:29:01,771 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 507) no Hoare annotation was computed. [2018-09-30 10:29:01,771 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 507) no Hoare annotation was computed. [2018-09-30 10:29:01,771 INFO L422 ceAbstractionStarter]: At program point L313(lines 313 324) the Hoare annotation is: (let ((.cse2 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse3 .cse1 .cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse3 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)))) [2018-09-30 10:29:01,771 INFO L422 ceAbstractionStarter]: At program point L400(lines 400 412) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse1 .cse2 .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576) .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) .cse3 .cse4))) [2018-09-30 10:29:01,771 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 507) no Hoare annotation was computed. [2018-09-30 10:29:01,771 INFO L422 ceAbstractionStarter]: At program point L380(lines 380 397) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse1 .cse2 .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576) .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) .cse3 .cse4))) [2018-09-30 10:29:01,772 INFO L422 ceAbstractionStarter]: At program point L347(lines 347 365) the Hoare annotation is: (let ((.cse3 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576)) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3)) (.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse2 .cse3 .cse8 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse7 .cse2 .cse9 .cse5))) [2018-09-30 10:29:01,772 INFO L422 ceAbstractionStarter]: At program point L442(lines 442 462) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse0 .cse1) (and (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse0 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-09-30 10:29:01,772 INFO L422 ceAbstractionStarter]: At program point L504(lines 286 504) the Hoare annotation is: (let ((.cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 .cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-09-30 10:29:01,772 INFO L422 ceAbstractionStarter]: At program point L438(lines 438 449) the Hoare annotation is: (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) [2018-09-30 10:29:01,772 INFO L422 ceAbstractionStarter]: At program point L430(lines 430 439) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse1 .cse2 .cse3) (and .cse0 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse2 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-09-30 10:29:01,772 INFO L422 ceAbstractionStarter]: At program point L327(lines 327 344) the Hoare annotation is: (let ((.cse3 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3)) (.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse0 .cse4 .cse2 .cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse4 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)))) [2018-09-30 10:29:01,773 INFO L422 ceAbstractionStarter]: At program point L484(lines 481 499) the Hoare annotation is: (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) [2018-09-30 10:29:01,773 INFO L422 ceAbstractionStarter]: At program point L451(lines 448 470) the Hoare annotation is: (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) [2018-09-30 10:29:01,773 INFO L422 ceAbstractionStarter]: At program point L295(lines 258 295) the Hoare annotation is: (let ((.cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 .cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-09-30 10:29:01,773 INFO L422 ceAbstractionStarter]: At program point L291(lines 291 310) the Hoare annotation is: (let ((.cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 .cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-09-30 10:29:01,792 INFO L202 PluginConnector]: Adding new model s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:29:01 BoogieIcfgContainer [2018-09-30 10:29:01,793 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:29:01,793 INFO L168 Benchmark]: Toolchain (without parser) took 13153.76 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 136.8 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -121.8 MB). Peak memory consumption was 601.1 MB. Max. memory is 7.1 GB. [2018-09-30 10:29:01,795 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:29:01,795 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:29:01,796 INFO L168 Benchmark]: Boogie Preprocessor took 48.08 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:29:01,797 INFO L168 Benchmark]: RCFGBuilder took 745.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-30 10:29:01,797 INFO L168 Benchmark]: TraceAbstraction took 12305.43 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 136.8 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -153.5 MB). Peak memory consumption was 569.4 MB. Max. memory is 7.1 GB. [2018-09-30 10:29:01,802 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.19 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 49.17 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 48.08 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 745.20 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 12305.43 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 136.8 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -153.5 MB). Peak memory consumption was 569.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 506]: 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: 271]: Loop Invariant Derived loop invariant: (((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || ((ssl3_accept_~blastFlag~5 <= 2 && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 481]: Loop Invariant Derived loop invariant: (((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && !(8640 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5) - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: (((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (((ssl3_accept_~blastFlag~5 <= 2 && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((ssl3_accept_~blastFlag~5 <= 2 && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: (((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && !(8656 == ssl3_accept_~s__state~5)) && !(8640 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 448]: Loop Invariant Derived loop invariant: (((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8656 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5) - InvariantResult [Line: 286]: Loop Invariant Derived loop invariant: (((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || ((ssl3_accept_~blastFlag~5 <= 2 && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 461]: Loop Invariant Derived loop invariant: (((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8640 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5) - InvariantResult [Line: 258]: Loop Invariant Derived loop invariant: (((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || ((ssl3_accept_~blastFlag~5 <= 2 && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 438]: Loop Invariant Derived loop invariant: (((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8656 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5) - InvariantResult [Line: 469]: Loop Invariant Derived loop invariant: ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5 - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 370]: Loop Invariant Derived loop invariant: (((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || (((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 327]: Loop Invariant Derived loop invariant: (((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || ((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || (((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || (((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: ((((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5))) || (((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 291]: Loop Invariant Derived loop invariant: (((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || ((ssl3_accept_~blastFlag~5 <= 2 && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 400]: Loop Invariant Derived loop invariant: ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: (((ssl3_accept_~blastFlag~5 <= 2 && !(8448 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (((!(8656 == ssl3_accept_~s__state~5) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 1 error locations. SAFE Result, 12.2s OverallTime, 14 OverallIterations, 19 TraceHistogramMax, 5.4s AutomataDifference, 0.0s DeadEndRemovalTime, 4.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 278 SDtfs, 197 SDslu, 137 SDs, 0 SdLazy, 547 SolverSat, 194 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 278 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=296occurred in iteration=12, 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.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 141 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 19 PreInvPairs, 220 NumberOfFragments, 1025 HoareAnnotationTreeSize, 19 FomulaSimplifications, 8878 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 19 FomulaSimplificationsInter, 3305 FormulaSimplificationTreeSizeReductionInter, 3.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1151 NumberOfCodeBlocks, 1151 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1135 ConstructedInterpolants, 0 QuantifiedInterpolants, 162691 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1200 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 4505/4529 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/s3_srvr_3.cil.c_20.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_10-29-01-820.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_3.cil.c_20.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_10-29-01-820.csv Received shutdown request...