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_1.BV.c.cil.c_21.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-00a8621 [2018-09-30 10:28:36,862 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:28:36,864 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:28:36,879 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:28:36,880 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:28:36,881 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:28:36,885 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:28:36,888 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:28:36,890 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:28:36,891 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:28:36,892 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:28:36,893 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:28:36,898 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:28:36,899 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:28:36,903 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:28:36,904 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:28:36,905 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:28:36,907 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:28:36,908 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:28:36,910 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:28:36,911 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:28:36,912 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:28:36,915 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:28:36,915 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:28:36,915 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:28:36,916 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:28:36,917 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:28:36,918 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:28:36,918 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:28:36,920 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:28:36,920 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:28:36,920 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:28:36,921 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:28:36,921 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:28:36,922 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:28:36,923 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:28:36,923 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:36,947 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:28:36,948 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:28:36,951 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:28:36,951 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:28:36,952 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:28:36,952 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:28:36,954 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:28:36,955 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:28:36,955 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:28:36,955 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:28:36,955 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:28:36,955 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:28:36,956 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:28:36,956 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:28:36,956 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:28:36,956 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:28:36,957 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:28:36,957 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:28:36,957 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:28:36,958 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:28:36,958 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:28:36,958 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:28:36,958 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:28:36,959 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:28:36,959 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:28:36,959 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:28:36,959 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:28:36,960 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:28:36,960 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:28:36,960 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:28:37,012 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:28:37,027 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:28:37,033 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:28:37,035 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:28:37,035 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:28:37,036 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.BV.c.cil.c_21.bpl [2018-09-30 10:28:37,037 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.BV.c.cil.c_21.bpl' [2018-09-30 10:28:37,139 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:28:37,143 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:28:37,143 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:28:37,144 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:28:37,144 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:28:37,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:37" (1/1) ... [2018-09-30 10:28:37,187 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:37" (1/1) ... [2018-09-30 10:28:37,204 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:28:37,210 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:28:37,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:28:37,211 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:28:37,229 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:37" (1/1) ... [2018-09-30 10:28:37,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:37" (1/1) ... [2018-09-30 10:28:37,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:37" (1/1) ... [2018-09-30 10:28:37,234 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:37" (1/1) ... [2018-09-30 10:28:37,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:37" (1/1) ... [2018-09-30 10:28:37,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:37" (1/1) ... [2018-09-30 10:28:37,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:37" (1/1) ... [2018-09-30 10:28:37,275 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:28:37,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:28:37,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:28:37,280 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:28:37,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:37" (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:37,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 10:28:37,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 10:28:37,929 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 10:28:37,930 INFO L202 PluginConnector]: Adding new model s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:28:37 BoogieIcfgContainer [2018-09-30 10:28:37,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:28:37,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:28:37,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:28:37,935 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:28:37,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:37" (1/2) ... [2018-09-30 10:28:37,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c984947 and model type s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:28:37, skipping insertion in model container [2018-09-30 10:28:37,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:28:37" (2/2) ... [2018-09-30 10:28:37,938 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.BV.c.cil.c_21.bpl [2018-09-30 10:28:37,948 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:28:37,957 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 10:28:38,004 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:28:38,005 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:28:38,005 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:28:38,006 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:28:38,006 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:28:38,006 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:28:38,006 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:28:38,006 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:28:38,006 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:28:38,023 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-09-30 10:28:38,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 10:28:38,030 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:38,031 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:38,032 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:38,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:38,039 INFO L82 PathProgramCache]: Analyzing trace with hash -505433777, now seen corresponding path program 1 times [2018-09-30 10:28:38,041 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:38,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:38,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:38,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:38,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:38,262 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:38,264 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:38,265 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:28:38,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:38,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:38,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:38,284 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-09-30 10:28:38,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:38,732 INFO L93 Difference]: Finished difference Result 56 states and 94 transitions. [2018-09-30 10:28:38,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:38,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-30 10:28:38,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:38,747 INFO L225 Difference]: With dead ends: 56 [2018-09-30 10:28:38,747 INFO L226 Difference]: Without dead ends: 34 [2018-09-30 10:28:38,751 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:38,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-30 10:28:38,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-09-30 10:28:38,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-30 10:28:38,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2018-09-30 10:28:38,794 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 15 [2018-09-30 10:28:38,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:38,794 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2018-09-30 10:28:38,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:38,795 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2018-09-30 10:28:38,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-30 10:28:38,796 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:38,796 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:38,796 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:38,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:38,797 INFO L82 PathProgramCache]: Analyzing trace with hash -912155323, now seen corresponding path program 1 times [2018-09-30 10:28:38,797 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:38,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:38,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:38,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:38,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:38,892 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:38,893 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:38,893 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:28:38,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:38,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:38,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:38,896 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2018-09-30 10:28:39,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:39,084 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-09-30 10:28:39,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:39,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-09-30 10:28:39,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:39,088 INFO L225 Difference]: With dead ends: 83 [2018-09-30 10:28:39,088 INFO L226 Difference]: Without dead ends: 50 [2018-09-30 10:28:39,089 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:39,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-30 10:28:39,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-09-30 10:28:39,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-30 10:28:39,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 83 transitions. [2018-09-30 10:28:39,103 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 83 transitions. Word has length 23 [2018-09-30 10:28:39,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:39,104 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 83 transitions. [2018-09-30 10:28:39,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:39,104 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 83 transitions. [2018-09-30 10:28:39,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-30 10:28:39,106 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:39,106 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:39,106 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:39,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:39,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1423527905, now seen corresponding path program 1 times [2018-09-30 10:28:39,107 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:39,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:39,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:39,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:39,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:39,177 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:39,177 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:39,178 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:28:39,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:39,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:39,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:39,179 INFO L87 Difference]: Start difference. First operand 50 states and 83 transitions. Second operand 3 states. [2018-09-30 10:28:39,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:39,466 INFO L93 Difference]: Finished difference Result 106 states and 177 transitions. [2018-09-30 10:28:39,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:39,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-09-30 10:28:39,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:39,468 INFO L225 Difference]: With dead ends: 106 [2018-09-30 10:28:39,468 INFO L226 Difference]: Without dead ends: 57 [2018-09-30 10:28:39,469 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:39,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-30 10:28:39,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-09-30 10:28:39,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-30 10:28:39,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 92 transitions. [2018-09-30 10:28:39,483 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 92 transitions. Word has length 30 [2018-09-30 10:28:39,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:39,483 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 92 transitions. [2018-09-30 10:28:39,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:39,483 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 92 transitions. [2018-09-30 10:28:39,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-30 10:28:39,485 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:39,485 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:39,485 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:39,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:39,486 INFO L82 PathProgramCache]: Analyzing trace with hash 222883017, now seen corresponding path program 1 times [2018-09-30 10:28:39,486 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:39,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:39,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:39,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:39,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:39,582 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:39,583 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:39,583 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:28:39,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:39,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:39,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:39,584 INFO L87 Difference]: Start difference. First operand 57 states and 92 transitions. Second operand 3 states. [2018-09-30 10:28:39,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:39,858 INFO L93 Difference]: Finished difference Result 131 states and 214 transitions. [2018-09-30 10:28:39,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:39,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-09-30 10:28:39,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:39,860 INFO L225 Difference]: With dead ends: 131 [2018-09-30 10:28:39,860 INFO L226 Difference]: Without dead ends: 74 [2018-09-30 10:28:39,861 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:39,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-30 10:28:39,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-09-30 10:28:39,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-30 10:28:39,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 120 transitions. [2018-09-30 10:28:39,875 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 120 transitions. Word has length 30 [2018-09-30 10:28:39,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:39,876 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 120 transitions. [2018-09-30 10:28:39,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:39,876 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 120 transitions. [2018-09-30 10:28:39,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-30 10:28:39,878 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:39,878 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:39,878 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:39,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:39,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1035189339, now seen corresponding path program 1 times [2018-09-30 10:28:39,879 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:39,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:39,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:39,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:39,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:39,966 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:39,966 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:39,966 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:28:39,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:39,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:39,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:39,968 INFO L87 Difference]: Start difference. First operand 74 states and 120 transitions. Second operand 3 states. [2018-09-30 10:28:40,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:40,302 INFO L93 Difference]: Finished difference Result 153 states and 249 transitions. [2018-09-30 10:28:40,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:40,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-09-30 10:28:40,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:40,304 INFO L225 Difference]: With dead ends: 153 [2018-09-30 10:28:40,306 INFO L226 Difference]: Without dead ends: 80 [2018-09-30 10:28:40,307 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:40,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-09-30 10:28:40,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-09-30 10:28:40,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-09-30 10:28:40,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 125 transitions. [2018-09-30 10:28:40,331 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 125 transitions. Word has length 36 [2018-09-30 10:28:40,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:40,331 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 125 transitions. [2018-09-30 10:28:40,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:40,332 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 125 transitions. [2018-09-30 10:28:40,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-30 10:28:40,333 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:40,333 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:40,334 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:40,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:40,334 INFO L82 PathProgramCache]: Analyzing trace with hash -720649021, now seen corresponding path program 1 times [2018-09-30 10:28:40,334 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:40,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:40,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:40,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:40,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:40,422 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:40,422 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:40,423 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:28:40,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:40,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:40,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:40,424 INFO L87 Difference]: Start difference. First operand 80 states and 125 transitions. Second operand 3 states. [2018-09-30 10:28:40,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:40,666 INFO L93 Difference]: Finished difference Result 164 states and 257 transitions. [2018-09-30 10:28:40,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:40,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-09-30 10:28:40,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:40,667 INFO L225 Difference]: With dead ends: 164 [2018-09-30 10:28:40,668 INFO L226 Difference]: Without dead ends: 85 [2018-09-30 10:28:40,669 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:40,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-30 10:28:40,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-30 10:28:40,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-30 10:28:40,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2018-09-30 10:28:40,686 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 41 [2018-09-30 10:28:40,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:40,686 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2018-09-30 10:28:40,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:40,686 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2018-09-30 10:28:40,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-30 10:28:40,688 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:40,688 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:40,689 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:40,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:40,689 INFO L82 PathProgramCache]: Analyzing trace with hash -2015268887, now seen corresponding path program 1 times [2018-09-30 10:28:40,689 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:40,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:40,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:40,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:40,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:40,753 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:40,753 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:40,753 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:28:40,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:40,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:40,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:40,754 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand 3 states. [2018-09-30 10:28:40,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:40,987 INFO L93 Difference]: Finished difference Result 181 states and 270 transitions. [2018-09-30 10:28:40,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:40,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-09-30 10:28:40,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:40,991 INFO L225 Difference]: With dead ends: 181 [2018-09-30 10:28:40,991 INFO L226 Difference]: Without dead ends: 96 [2018-09-30 10:28:40,992 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:40,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-09-30 10:28:41,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-09-30 10:28:41,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-30 10:28:41,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 140 transitions. [2018-09-30 10:28:41,009 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 140 transitions. Word has length 44 [2018-09-30 10:28:41,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:41,010 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 140 transitions. [2018-09-30 10:28:41,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:41,010 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 140 transitions. [2018-09-30 10:28:41,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-30 10:28:41,012 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:41,012 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:41,012 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:41,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:41,013 INFO L82 PathProgramCache]: Analyzing trace with hash 483195845, now seen corresponding path program 1 times [2018-09-30 10:28:41,013 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:41,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:41,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:41,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:41,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:41,091 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:41,093 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:41,093 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:28:41,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:41,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:41,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:41,094 INFO L87 Difference]: Start difference. First operand 96 states and 140 transitions. Second operand 3 states. [2018-09-30 10:28:41,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:41,368 INFO L93 Difference]: Finished difference Result 195 states and 285 transitions. [2018-09-30 10:28:41,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:41,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-09-30 10:28:41,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:41,370 INFO L225 Difference]: With dead ends: 195 [2018-09-30 10:28:41,371 INFO L226 Difference]: Without dead ends: 100 [2018-09-30 10:28:41,372 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:41,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-09-30 10:28:41,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-09-30 10:28:41,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-30 10:28:41,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 138 transitions. [2018-09-30 10:28:41,405 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 138 transitions. Word has length 45 [2018-09-30 10:28:41,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:41,405 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 138 transitions. [2018-09-30 10:28:41,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:41,408 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 138 transitions. [2018-09-30 10:28:41,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-30 10:28:41,410 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:41,413 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:41,414 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:41,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:41,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1326956691, now seen corresponding path program 1 times [2018-09-30 10:28:41,415 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:41,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:41,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:41,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:41,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:41,627 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:41,628 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:28:41,628 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:41,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:41,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:28:41,775 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:41,797 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 10:28:41,797 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-09-30 10:28:41,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:28:41,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:28:41,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-30 10:28:41,799 INFO L87 Difference]: Start difference. First operand 100 states and 138 transitions. Second operand 5 states. [2018-09-30 10:28:42,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:42,806 INFO L93 Difference]: Finished difference Result 441 states and 602 transitions. [2018-09-30 10:28:42,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 10:28:42,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-09-30 10:28:42,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:42,810 INFO L225 Difference]: With dead ends: 441 [2018-09-30 10:28:42,810 INFO L226 Difference]: Without dead ends: 328 [2018-09-30 10:28:42,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:28:42,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-09-30 10:28:42,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 187. [2018-09-30 10:28:42,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-09-30 10:28:42,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 247 transitions. [2018-09-30 10:28:42,859 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 247 transitions. Word has length 48 [2018-09-30 10:28:42,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:42,860 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 247 transitions. [2018-09-30 10:28:42,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:28:42,860 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 247 transitions. [2018-09-30 10:28:42,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-30 10:28:42,862 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:42,862 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:42,862 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:42,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:42,870 INFO L82 PathProgramCache]: Analyzing trace with hash 636359981, now seen corresponding path program 1 times [2018-09-30 10:28:42,870 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:42,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:42,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:42,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:42,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:42,978 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:42,979 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:42,979 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:28:42,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:42,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:42,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:42,981 INFO L87 Difference]: Start difference. First operand 187 states and 247 transitions. Second operand 3 states. [2018-09-30 10:28:43,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:43,308 INFO L93 Difference]: Finished difference Result 374 states and 495 transitions. [2018-09-30 10:28:43,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:43,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-09-30 10:28:43,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:43,311 INFO L225 Difference]: With dead ends: 374 [2018-09-30 10:28:43,311 INFO L226 Difference]: Without dead ends: 182 [2018-09-30 10:28:43,312 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:43,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-09-30 10:28:43,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-09-30 10:28:43,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-09-30 10:28:43,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 227 transitions. [2018-09-30 10:28:43,345 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 227 transitions. Word has length 64 [2018-09-30 10:28:43,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:43,346 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 227 transitions. [2018-09-30 10:28:43,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:43,346 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 227 transitions. [2018-09-30 10:28:43,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-09-30 10:28:43,347 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:43,348 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:43,348 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:43,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:43,348 INFO L82 PathProgramCache]: Analyzing trace with hash -739459377, now seen corresponding path program 1 times [2018-09-30 10:28:43,349 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:43,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:43,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:43,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:43,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:43,485 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:43,485 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:43,485 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:28:43,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:43,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:43,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:43,487 INFO L87 Difference]: Start difference. First operand 182 states and 227 transitions. Second operand 3 states. [2018-09-30 10:28:43,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:43,794 INFO L93 Difference]: Finished difference Result 381 states and 475 transitions. [2018-09-30 10:28:43,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:43,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-09-30 10:28:43,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:43,798 INFO L225 Difference]: With dead ends: 381 [2018-09-30 10:28:43,798 INFO L226 Difference]: Without dead ends: 202 [2018-09-30 10:28:43,799 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:43,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-09-30 10:28:43,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-09-30 10:28:43,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-09-30 10:28:43,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 247 transitions. [2018-09-30 10:28:43,835 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 247 transitions. Word has length 97 [2018-09-30 10:28:43,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:43,836 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 247 transitions. [2018-09-30 10:28:43,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:43,836 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 247 transitions. [2018-09-30 10:28:43,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-09-30 10:28:43,837 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:43,837 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:43,838 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:43,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:43,838 INFO L82 PathProgramCache]: Analyzing trace with hash -93746177, now seen corresponding path program 1 times [2018-09-30 10:28:43,838 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:43,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:43,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:43,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:43,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:44,003 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:44,004 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:44,004 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:28:44,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:44,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:44,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:44,005 INFO L87 Difference]: Start difference. First operand 202 states and 247 transitions. Second operand 3 states. [2018-09-30 10:28:44,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:44,270 INFO L93 Difference]: Finished difference Result 298 states and 365 transitions. [2018-09-30 10:28:44,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:44,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-09-30 10:28:44,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:44,276 INFO L225 Difference]: With dead ends: 298 [2018-09-30 10:28:44,276 INFO L226 Difference]: Without dead ends: 296 [2018-09-30 10:28:44,277 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:44,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-09-30 10:28:44,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2018-09-30 10:28:44,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-09-30 10:28:44,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 363 transitions. [2018-09-30 10:28:44,328 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 363 transitions. Word has length 107 [2018-09-30 10:28:44,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:44,328 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 363 transitions. [2018-09-30 10:28:44,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:44,329 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 363 transitions. [2018-09-30 10:28:44,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-09-30 10:28:44,331 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:44,332 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:44,332 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:44,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:44,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1497686773, now seen corresponding path program 1 times [2018-09-30 10:28:44,333 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:44,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:44,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:44,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:44,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:44,516 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:44,517 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:44,517 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:28:44,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:44,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:44,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:44,518 INFO L87 Difference]: Start difference. First operand 296 states and 363 transitions. Second operand 3 states. [2018-09-30 10:28:45,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:45,079 INFO L93 Difference]: Finished difference Result 589 states and 723 transitions. [2018-09-30 10:28:45,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:45,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2018-09-30 10:28:45,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:45,083 INFO L225 Difference]: With dead ends: 589 [2018-09-30 10:28:45,084 INFO L226 Difference]: Without dead ends: 296 [2018-09-30 10:28:45,084 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:45,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-09-30 10:28:45,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2018-09-30 10:28:45,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-09-30 10:28:45,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 354 transitions. [2018-09-30 10:28:45,131 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 354 transitions. Word has length 147 [2018-09-30 10:28:45,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:45,131 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 354 transitions. [2018-09-30 10:28:45,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:45,132 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 354 transitions. [2018-09-30 10:28:45,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-30 10:28:45,134 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:45,134 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:45,134 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:45,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:45,135 INFO L82 PathProgramCache]: Analyzing trace with hash -663980831, now seen corresponding path program 1 times [2018-09-30 10:28:45,135 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:45,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:45,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:45,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:45,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:45,366 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:45,367 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:28:45,367 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:45,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:45,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:28:45,531 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:45,557 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:28:45,558 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-09-30 10:28:45,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:28:45,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:28:45,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 10:28:45,559 INFO L87 Difference]: Start difference. First operand 296 states and 354 transitions. Second operand 4 states. [2018-09-30 10:28:45,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:45,879 INFO L93 Difference]: Finished difference Result 470 states and 566 transitions. [2018-09-30 10:28:45,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 10:28:45,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2018-09-30 10:28:45,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:45,880 INFO L225 Difference]: With dead ends: 470 [2018-09-30 10:28:45,880 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 10:28:45,881 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:45,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 10:28:45,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 10:28:45,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 10:28:45,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 10:28:45,882 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 188 [2018-09-30 10:28:45,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:45,882 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 10:28:45,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:28:45,883 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 10:28:45,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 10:28:45,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 10:28:45,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:45,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:45,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:45,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:45,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:45,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:46,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:46,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:46,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:46,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:46,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:46,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:46,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:46,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:46,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:46,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:46,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:46,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:46,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:46,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:46,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:46,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:46,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:46,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:46,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:46,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:46,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:46,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:46,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:46,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:46,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:46,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:46,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:46,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:28:46,839 WARN L178 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-09-30 10:28:48,101 WARN L178 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2018-09-30 10:28:48,456 WARN L178 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2018-09-30 10:28:48,588 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 23 [2018-09-30 10:28:48,832 WARN L178 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-09-30 10:28:49,086 WARN L178 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2018-09-30 10:28:49,213 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2018-09-30 10:28:49,314 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-09-30 10:28:49,519 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2018-09-30 10:28:49,767 WARN L178 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2018-09-30 10:28:49,925 WARN L178 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2018-09-30 10:28:50,120 WARN L178 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2018-09-30 10:28:50,281 WARN L178 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2018-09-30 10:28:50,578 WARN L178 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2018-09-30 10:28:50,730 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2018-09-30 10:28:50,734 INFO L422 ceAbstractionStarter]: At program point L477(lines 252 477) 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:28:50,734 INFO L422 ceAbstractionStarter]: At program point L279(lines 279 289) 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:28:50,734 INFO L422 ceAbstractionStarter]: At program point L366(lines 366 378) 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:28:50,735 INFO L422 ceAbstractionStarter]: At program point L333(lines 333 344) 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:28:50,735 INFO L422 ceAbstractionStarter]: At program point L453(lines 450 469) 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:28:50,735 INFO L422 ceAbstractionStarter]: At program point L292(lines 292 308) 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:28:50,736 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 479) no Hoare annotation was computed. [2018-09-30 10:28:50,736 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 3 480) no Hoare annotation was computed. [2018-09-30 10:28:50,736 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 3 480) no Hoare annotation was computed. [2018-09-30 10:28:50,736 INFO L422 ceAbstractionStarter]: At program point L346(lines 346 363) 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:28:50,736 INFO L422 ceAbstractionStarter]: At program point L408(lines 408 431) 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:28:50,736 INFO L422 ceAbstractionStarter]: At program point L404(lines 404 415) 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:28:50,736 INFO L422 ceAbstractionStarter]: At program point L396(lines 396 405) 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:28:50,737 INFO L422 ceAbstractionStarter]: At program point L417(lines 414 439) 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:28:50,737 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 3 480) no Hoare annotation was computed. [2018-09-30 10:28:50,737 INFO L422 ceAbstractionStarter]: At program point L438(lines 438 460) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) [2018-09-30 10:28:50,737 INFO L422 ceAbstractionStarter]: At program point L430(lines 430 451) 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:28:50,737 INFO L422 ceAbstractionStarter]: At program point L459(lines 459 478) the Hoare annotation is: false [2018-09-30 10:28:50,737 INFO L422 ceAbstractionStarter]: At program point L261(lines 224 261) 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:28:50,737 INFO L422 ceAbstractionStarter]: At program point L257(lines 257 276) 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:28:50,738 INFO L422 ceAbstractionStarter]: At program point L381(lines 381 393) 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:28:50,738 INFO L422 ceAbstractionStarter]: At program point L311(lines 311 328) 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:28:50,738 INFO L422 ceAbstractionStarter]: At program point L237(lines 237 253) 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:28:50,758 INFO L202 PluginConnector]: Adding new model s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:28:50 BoogieIcfgContainer [2018-09-30 10:28:50,759 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:28:50,760 INFO L168 Benchmark]: Toolchain (without parser) took 13620.27 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 122.7 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -122.1 MB). Peak memory consumption was 596.4 MB. Max. memory is 7.1 GB. [2018-09-30 10:28:50,761 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 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:28:50,762 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.56 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:28:50,762 INFO L168 Benchmark]: Boogie Preprocessor took 64.79 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:28:50,763 INFO L168 Benchmark]: RCFGBuilder took 650.47 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:28:50,764 INFO L168 Benchmark]: TraceAbstraction took 12827.49 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 122.7 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -153.8 MB). Peak memory consumption was 564.7 MB. Max. memory is 7.1 GB. [2018-09-30 10:28:50,768 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.22 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 66.56 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.79 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 650.47 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 12827.49 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 122.7 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -153.8 MB). Peak memory consumption was 564.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 479]: 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: 224]: 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: 366]: 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: 430]: 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: 408]: 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) - InvariantResult [Line: 333]: 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: 311]: 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: 396]: 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: 414]: 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: 438]: Loop Invariant Derived loop invariant: ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5 - InvariantResult [Line: 459]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 404]: 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: 252]: 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: 381]: 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: 257]: 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: 279]: 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: 237]: 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: 450]: 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: 346]: 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: 292]: 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) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 1 error locations. SAFE Result, 12.7s OverallTime, 14 OverallIterations, 19 TraceHistogramMax, 5.1s AutomataDifference, 0.0s DeadEndRemovalTime, 4.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 278 SDtfs, 197 SDslu, 137 SDs, 0 SdLazy, 547 SolverSat, 194 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 278 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s 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, 4.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1151 NumberOfCodeBlocks, 1151 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1135 ConstructedInterpolants, 0 QuantifiedInterpolants, 162691 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1181 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_1.BV.c.cil.c_21.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_10-28-50-786.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_1.BV.c.cil.c_21.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_10-28-50-786.csv Received shutdown request...