java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3_alt.BV.c.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-4eac566 [2018-09-23 19:45:10,801 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-23 19:45:10,803 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-23 19:45:10,816 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-23 19:45:10,816 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-23 19:45:10,817 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-23 19:45:10,818 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-23 19:45:10,820 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-23 19:45:10,822 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-23 19:45:10,822 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-23 19:45:10,823 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-23 19:45:10,824 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-23 19:45:10,825 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-23 19:45:10,826 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-23 19:45:10,827 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-23 19:45:10,828 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-23 19:45:10,828 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-23 19:45:10,830 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-23 19:45:10,832 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-23 19:45:10,834 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-23 19:45:10,835 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-23 19:45:10,836 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-23 19:45:10,838 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-23 19:45:10,839 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-23 19:45:10,839 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-23 19:45:10,840 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-23 19:45:10,841 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-23 19:45:10,842 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-23 19:45:10,843 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-23 19:45:10,844 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-23 19:45:10,844 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-23 19:45:10,845 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-23 19:45:10,845 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-23 19:45:10,845 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-23 19:45:10,846 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-23 19:45:10,847 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-23 19:45:10,847 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-23 19:45:10,868 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-23 19:45:10,868 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-23 19:45:10,869 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-23 19:45:10,869 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-23 19:45:10,870 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-23 19:45:10,870 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-23 19:45:10,870 INFO L133 SettingsManager]: * Use SBE=true [2018-09-23 19:45:10,870 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-23 19:45:10,870 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-23 19:45:10,871 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-23 19:45:10,871 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-23 19:45:10,871 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-23 19:45:10,871 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-23 19:45:10,871 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-23 19:45:10,872 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-23 19:45:10,872 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-23 19:45:10,872 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-23 19:45:10,872 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-23 19:45:10,874 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-23 19:45:10,874 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-23 19:45:10,874 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-23 19:45:10,874 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-23 19:45:10,874 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 19:45:10,875 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-23 19:45:10,875 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-23 19:45:10,875 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-23 19:45:10,875 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-23 19:45:10,875 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-23 19:45:10,876 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-23 19:45:10,876 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-23 19:45:10,934 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-23 19:45:10,947 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-23 19:45:10,951 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-23 19:45:10,952 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-23 19:45:10,953 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-23 19:45:10,954 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3_alt.BV.c.cil.c_19.bpl [2018-09-23 19:45:10,954 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3_alt.BV.c.cil.c_19.bpl' [2018-09-23 19:45:11,053 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-23 19:45:11,056 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-23 19:45:11,057 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-23 19:45:11,057 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-23 19:45:11,058 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-23 19:45:11,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:45:11" (1/1) ... [2018-09-23 19:45:11,096 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:45:11" (1/1) ... [2018-09-23 19:45:11,111 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-23 19:45:11,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-23 19:45:11,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-23 19:45:11,113 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-23 19:45:11,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:45:11" (1/1) ... [2018-09-23 19:45:11,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:45:11" (1/1) ... [2018-09-23 19:45:11,127 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:45:11" (1/1) ... [2018-09-23 19:45:11,134 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:45:11" (1/1) ... [2018-09-23 19:45:11,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:45:11" (1/1) ... [2018-09-23 19:45:11,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:45:11" (1/1) ... [2018-09-23 19:45:11,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:45:11" (1/1) ... [2018-09-23 19:45:11,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-23 19:45:11,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-23 19:45:11,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-23 19:45:11,174 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-23 19:45:11,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:45:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 19:45:11,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-23 19:45:11,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-23 19:45:11,943 INFO L354 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-23 19:45:11,944 INFO L202 PluginConnector]: Adding new model s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 07:45:11 BoogieIcfgContainer [2018-09-23 19:45:11,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-23 19:45:11,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-23 19:45:11,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-23 19:45:11,948 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-23 19:45:11,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:45:11" (1/2) ... [2018-09-23 19:45:11,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f997c5 and model type s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.09 07:45:11, skipping insertion in model container [2018-09-23 19:45:11,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 07:45:11" (2/2) ... [2018-09-23 19:45:11,951 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3_alt.BV.c.cil.c_19.bpl [2018-09-23 19:45:11,961 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-23 19:45:11,972 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-23 19:45:12,018 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-23 19:45:12,019 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-23 19:45:12,019 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-23 19:45:12,020 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-23 19:45:12,020 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-23 19:45:12,020 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-23 19:45:12,020 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-23 19:45:12,020 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-23 19:45:12,020 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-23 19:45:12,036 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-09-23 19:45:12,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-23 19:45:12,043 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:45:12,044 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:45:12,045 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:45:12,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:45:12,051 INFO L82 PathProgramCache]: Analyzing trace with hash -505433715, now seen corresponding path program 1 times [2018-09-23 19:45:12,053 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:45:12,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:45:12,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:12,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:45:12,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:45:12,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:45:12,285 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:45:12,285 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 19:45:12,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:45:12,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:45:12,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:45:12,308 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-09-23 19:45:12,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:45:12,693 INFO L93 Difference]: Finished difference Result 56 states and 94 transitions. [2018-09-23 19:45:12,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:45:12,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-23 19:45:12,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:45:12,707 INFO L225 Difference]: With dead ends: 56 [2018-09-23 19:45:12,708 INFO L226 Difference]: Without dead ends: 34 [2018-09-23 19:45:12,712 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:45:12,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-23 19:45:12,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-09-23 19:45:12,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-23 19:45:12,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2018-09-23 19:45:12,757 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 15 [2018-09-23 19:45:12,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:45:12,757 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2018-09-23 19:45:12,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:45:12,758 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2018-09-23 19:45:12,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-23 19:45:12,759 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:45:12,759 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:45:12,760 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:45:12,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:45:12,760 INFO L82 PathProgramCache]: Analyzing trace with hash -912155261, now seen corresponding path program 1 times [2018-09-23 19:45:12,760 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:45:12,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:45:12,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:12,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:45:12,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:45:12,869 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-23 19:45:12,869 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:45:12,871 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 19:45:12,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:45:12,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:45:12,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:45:12,874 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2018-09-23 19:45:13,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:45:13,066 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-09-23 19:45:13,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:45:13,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-09-23 19:45:13,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:45:13,068 INFO L225 Difference]: With dead ends: 83 [2018-09-23 19:45:13,069 INFO L226 Difference]: Without dead ends: 50 [2018-09-23 19:45:13,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:45:13,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-23 19:45:13,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-09-23 19:45:13,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-23 19:45:13,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 83 transitions. [2018-09-23 19:45:13,087 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 83 transitions. Word has length 23 [2018-09-23 19:45:13,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:45:13,088 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 83 transitions. [2018-09-23 19:45:13,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:45:13,089 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 83 transitions. [2018-09-23 19:45:13,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-23 19:45:13,090 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:45:13,091 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-23 19:45:13,091 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:45:13,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:45:13,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1423527967, now seen corresponding path program 1 times [2018-09-23 19:45:13,092 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:45:13,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:45:13,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:13,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:45:13,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:45:13,197 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-23 19:45:13,198 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:45:13,198 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 19:45:13,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:45:13,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:45:13,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:45:13,202 INFO L87 Difference]: Start difference. First operand 50 states and 83 transitions. Second operand 3 states. [2018-09-23 19:45:13,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:45:13,405 INFO L93 Difference]: Finished difference Result 106 states and 177 transitions. [2018-09-23 19:45:13,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:45:13,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-09-23 19:45:13,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:45:13,407 INFO L225 Difference]: With dead ends: 106 [2018-09-23 19:45:13,407 INFO L226 Difference]: Without dead ends: 57 [2018-09-23 19:45:13,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:45:13,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-23 19:45:13,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-09-23 19:45:13,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-23 19:45:13,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 92 transitions. [2018-09-23 19:45:13,421 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 92 transitions. Word has length 30 [2018-09-23 19:45:13,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:45:13,422 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 92 transitions. [2018-09-23 19:45:13,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:45:13,422 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 92 transitions. [2018-09-23 19:45:13,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-23 19:45:13,423 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:45:13,424 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-23 19:45:13,424 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:45:13,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:45:13,425 INFO L82 PathProgramCache]: Analyzing trace with hash 222883079, now seen corresponding path program 1 times [2018-09-23 19:45:13,425 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:45:13,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:45:13,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:13,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:45:13,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:45:13,491 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-23 19:45:13,492 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:45:13,492 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 19:45:13,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:45:13,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:45:13,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:45:13,493 INFO L87 Difference]: Start difference. First operand 57 states and 92 transitions. Second operand 3 states. [2018-09-23 19:45:13,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:45:13,767 INFO L93 Difference]: Finished difference Result 131 states and 214 transitions. [2018-09-23 19:45:13,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:45:13,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-09-23 19:45:13,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:45:13,769 INFO L225 Difference]: With dead ends: 131 [2018-09-23 19:45:13,769 INFO L226 Difference]: Without dead ends: 74 [2018-09-23 19:45:13,770 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:45:13,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-23 19:45:13,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-09-23 19:45:13,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-23 19:45:13,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 120 transitions. [2018-09-23 19:45:13,784 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 120 transitions. Word has length 30 [2018-09-23 19:45:13,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:45:13,785 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 120 transitions. [2018-09-23 19:45:13,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:45:13,785 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 120 transitions. [2018-09-23 19:45:13,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-23 19:45:13,786 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:45:13,787 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-23 19:45:13,787 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:45:13,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:45:13,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1035189277, now seen corresponding path program 1 times [2018-09-23 19:45:13,788 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:45:13,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:45:13,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:13,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:45:13,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:45:13,881 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-23 19:45:13,881 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:45:13,882 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 19:45:13,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:45:13,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:45:13,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:45:13,883 INFO L87 Difference]: Start difference. First operand 74 states and 120 transitions. Second operand 3 states. [2018-09-23 19:45:14,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:45:14,337 INFO L93 Difference]: Finished difference Result 153 states and 249 transitions. [2018-09-23 19:45:14,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:45:14,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-09-23 19:45:14,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:45:14,340 INFO L225 Difference]: With dead ends: 153 [2018-09-23 19:45:14,340 INFO L226 Difference]: Without dead ends: 80 [2018-09-23 19:45:14,341 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:45:14,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-09-23 19:45:14,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-09-23 19:45:14,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-09-23 19:45:14,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 125 transitions. [2018-09-23 19:45:14,363 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 125 transitions. Word has length 36 [2018-09-23 19:45:14,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:45:14,364 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 125 transitions. [2018-09-23 19:45:14,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:45:14,364 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 125 transitions. [2018-09-23 19:45:14,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-23 19:45:14,368 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:45:14,369 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-23 19:45:14,369 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:45:14,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:45:14,370 INFO L82 PathProgramCache]: Analyzing trace with hash -720648959, now seen corresponding path program 1 times [2018-09-23 19:45:14,370 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:45:14,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:45:14,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:14,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:45:14,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:45:14,473 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-23 19:45:14,473 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:45:14,474 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 19:45:14,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:45:14,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:45:14,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:45:14,475 INFO L87 Difference]: Start difference. First operand 80 states and 125 transitions. Second operand 3 states. [2018-09-23 19:45:14,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:45:14,671 INFO L93 Difference]: Finished difference Result 164 states and 257 transitions. [2018-09-23 19:45:14,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:45:14,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-09-23 19:45:14,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:45:14,678 INFO L225 Difference]: With dead ends: 164 [2018-09-23 19:45:14,678 INFO L226 Difference]: Without dead ends: 85 [2018-09-23 19:45:14,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:45:14,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-23 19:45:14,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-23 19:45:14,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-23 19:45:14,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2018-09-23 19:45:14,707 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 41 [2018-09-23 19:45:14,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:45:14,707 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2018-09-23 19:45:14,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:45:14,708 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2018-09-23 19:45:14,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-23 19:45:14,711 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:45:14,711 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-23 19:45:14,711 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:45:14,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:45:14,712 INFO L82 PathProgramCache]: Analyzing trace with hash -2015268825, now seen corresponding path program 1 times [2018-09-23 19:45:14,712 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:45:14,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:45:14,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:14,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:45:14,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:14,739 ERROR L236 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-09-23 19:45:14,739 INFO L259 seRefinementStrategy]: Advancing trace checker [2018-09-23 19:45:14,739 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-09-23 19:45:14,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:45:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:45:14,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:45:14,850 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-23 19:45:14,881 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:45:14,881 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 19:45:14,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:45:14,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:45:14,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:45:14,883 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand 3 states. [2018-09-23 19:45:15,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:45:15,044 INFO L93 Difference]: Finished difference Result 246 states and 370 transitions. [2018-09-23 19:45:15,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:45:15,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-09-23 19:45:15,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:45:15,046 INFO L225 Difference]: With dead ends: 246 [2018-09-23 19:45:15,047 INFO L226 Difference]: Without dead ends: 162 [2018-09-23 19:45:15,048 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:45:15,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-09-23 19:45:15,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-09-23 19:45:15,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-09-23 19:45:15,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 234 transitions. [2018-09-23 19:45:15,085 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 234 transitions. Word has length 44 [2018-09-23 19:45:15,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:45:15,086 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 234 transitions. [2018-09-23 19:45:15,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:45:15,086 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 234 transitions. [2018-09-23 19:45:15,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-23 19:45:15,092 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:45:15,093 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:45:15,093 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:45:15,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:45:15,099 INFO L82 PathProgramCache]: Analyzing trace with hash -688187521, now seen corresponding path program 1 times [2018-09-23 19:45:15,099 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:45:15,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:45:15,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:15,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:45:15,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:45:15,201 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-09-23 19:45:15,202 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:45:15,202 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:45:15,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:45:15,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:45:15,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:45:15,205 INFO L87 Difference]: Start difference. First operand 162 states and 234 transitions. Second operand 3 states. [2018-09-23 19:45:15,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:45:15,458 INFO L93 Difference]: Finished difference Result 250 states and 366 transitions. [2018-09-23 19:45:15,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:45:15,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-09-23 19:45:15,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:45:15,461 INFO L225 Difference]: With dead ends: 250 [2018-09-23 19:45:15,461 INFO L226 Difference]: Without dead ends: 166 [2018-09-23 19:45:15,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:45:15,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-09-23 19:45:15,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-09-23 19:45:15,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-09-23 19:45:15,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 238 transitions. [2018-09-23 19:45:15,487 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 238 transitions. Word has length 47 [2018-09-23 19:45:15,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:45:15,488 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 238 transitions. [2018-09-23 19:45:15,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:45:15,488 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 238 transitions. [2018-09-23 19:45:15,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-23 19:45:15,490 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:45:15,490 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-23 19:45:15,490 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:45:15,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:45:15,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1326956629, now seen corresponding path program 1 times [2018-09-23 19:45:15,491 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:45:15,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:45:15,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:15,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:45:15,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:45:15,677 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-23 19:45:15,677 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:45:15,678 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-23 19:45:15,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:45:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:45:15,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:45:15,883 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-23 19:45:15,914 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-23 19:45:15,914 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-09-23 19:45:15,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-23 19:45:15,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-23 19:45:15,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-23 19:45:15,915 INFO L87 Difference]: Start difference. First operand 166 states and 238 transitions. Second operand 5 states. [2018-09-23 19:45:17,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:45:17,146 INFO L93 Difference]: Finished difference Result 598 states and 860 transitions. [2018-09-23 19:45:17,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-23 19:45:17,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-09-23 19:45:17,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:45:17,150 INFO L225 Difference]: With dead ends: 598 [2018-09-23 19:45:17,150 INFO L226 Difference]: Without dead ends: 406 [2018-09-23 19:45:17,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:45:17,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-09-23 19:45:17,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 240. [2018-09-23 19:45:17,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-09-23 19:45:17,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 333 transitions. [2018-09-23 19:45:17,190 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 333 transitions. Word has length 48 [2018-09-23 19:45:17,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:45:17,191 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 333 transitions. [2018-09-23 19:45:17,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-23 19:45:17,191 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 333 transitions. [2018-09-23 19:45:17,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-23 19:45:17,192 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:45:17,192 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:45:17,193 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:45:17,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:45:17,193 INFO L82 PathProgramCache]: Analyzing trace with hash 2115677753, now seen corresponding path program 1 times [2018-09-23 19:45:17,193 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:45:17,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:45:17,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:17,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:45:17,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:45:17,274 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-09-23 19:45:17,275 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:45:17,275 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:45:17,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:45:17,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:45:17,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:45:17,276 INFO L87 Difference]: Start difference. First operand 240 states and 333 transitions. Second operand 3 states. [2018-09-23 19:45:17,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:45:17,633 INFO L93 Difference]: Finished difference Result 399 states and 560 transitions. [2018-09-23 19:45:17,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:45:17,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-09-23 19:45:17,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:45:17,638 INFO L225 Difference]: With dead ends: 399 [2018-09-23 19:45:17,639 INFO L226 Difference]: Without dead ends: 239 [2018-09-23 19:45:17,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:45:17,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-09-23 19:45:17,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-09-23 19:45:17,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-09-23 19:45:17,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 329 transitions. [2018-09-23 19:45:17,674 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 329 transitions. Word has length 60 [2018-09-23 19:45:17,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:45:17,675 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 329 transitions. [2018-09-23 19:45:17,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:45:17,675 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 329 transitions. [2018-09-23 19:45:17,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-23 19:45:17,676 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:45:17,676 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:45:17,677 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:45:17,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:45:17,677 INFO L82 PathProgramCache]: Analyzing trace with hash 227864519, now seen corresponding path program 1 times [2018-09-23 19:45:17,677 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:45:17,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:45:17,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:17,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:45:17,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:45:17,769 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-09-23 19:45:17,770 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:45:17,770 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:45:17,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:45:17,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:45:17,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:45:17,771 INFO L87 Difference]: Start difference. First operand 239 states and 329 transitions. Second operand 3 states. [2018-09-23 19:45:17,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:45:17,896 INFO L93 Difference]: Finished difference Result 470 states and 649 transitions. [2018-09-23 19:45:17,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:45:17,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-09-23 19:45:17,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:45:17,901 INFO L225 Difference]: With dead ends: 470 [2018-09-23 19:45:17,901 INFO L226 Difference]: Without dead ends: 237 [2018-09-23 19:45:17,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:45:17,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-09-23 19:45:17,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-09-23 19:45:17,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-09-23 19:45:17,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 319 transitions. [2018-09-23 19:45:17,932 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 319 transitions. Word has length 65 [2018-09-23 19:45:17,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:45:17,933 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 319 transitions. [2018-09-23 19:45:17,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:45:17,933 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 319 transitions. [2018-09-23 19:45:17,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-23 19:45:17,934 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:45:17,934 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:45:17,934 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:45:17,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:45:17,934 INFO L82 PathProgramCache]: Analyzing trace with hash -242141821, now seen corresponding path program 1 times [2018-09-23 19:45:17,935 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:45:17,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:45:17,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:17,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:45:17,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:45:18,025 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-09-23 19:45:18,026 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:45:18,026 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:45:18,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:45:18,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:45:18,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:45:18,027 INFO L87 Difference]: Start difference. First operand 237 states and 319 transitions. Second operand 3 states. [2018-09-23 19:45:18,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:45:18,171 INFO L93 Difference]: Finished difference Result 465 states and 628 transitions. [2018-09-23 19:45:18,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:45:18,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-09-23 19:45:18,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:45:18,174 INFO L225 Difference]: With dead ends: 465 [2018-09-23 19:45:18,174 INFO L226 Difference]: Without dead ends: 235 [2018-09-23 19:45:18,175 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:45:18,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-09-23 19:45:18,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-09-23 19:45:18,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-09-23 19:45:18,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 309 transitions. [2018-09-23 19:45:18,206 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 309 transitions. Word has length 71 [2018-09-23 19:45:18,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:45:18,207 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 309 transitions. [2018-09-23 19:45:18,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:45:18,207 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 309 transitions. [2018-09-23 19:45:18,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-23 19:45:18,208 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:45:18,208 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 5, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:45:18,209 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:45:18,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:45:18,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1274982729, now seen corresponding path program 1 times [2018-09-23 19:45:18,210 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:45:18,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:45:18,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:18,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:45:18,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:45:18,314 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-09-23 19:45:18,314 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:45:18,314 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:45:18,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:45:18,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:45:18,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:45:18,316 INFO L87 Difference]: Start difference. First operand 235 states and 309 transitions. Second operand 3 states. [2018-09-23 19:45:18,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:45:18,726 INFO L93 Difference]: Finished difference Result 465 states and 615 transitions. [2018-09-23 19:45:18,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:45:18,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-09-23 19:45:18,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:45:18,728 INFO L225 Difference]: With dead ends: 465 [2018-09-23 19:45:18,728 INFO L226 Difference]: Without dead ends: 238 [2018-09-23 19:45:18,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:45:18,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-09-23 19:45:18,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-09-23 19:45:18,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-09-23 19:45:18,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 307 transitions. [2018-09-23 19:45:18,759 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 307 transitions. Word has length 78 [2018-09-23 19:45:18,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:45:18,759 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 307 transitions. [2018-09-23 19:45:18,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:45:18,759 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 307 transitions. [2018-09-23 19:45:18,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-23 19:45:18,760 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:45:18,760 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 6, 5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:45:18,761 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:45:18,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:45:18,761 INFO L82 PathProgramCache]: Analyzing trace with hash 409856557, now seen corresponding path program 1 times [2018-09-23 19:45:18,761 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:45:18,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:45:18,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:18,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:45:18,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:45:18,866 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-09-23 19:45:18,867 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:45:18,867 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:45:18,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:45:18,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:45:18,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:45:18,868 INFO L87 Difference]: Start difference. First operand 238 states and 307 transitions. Second operand 3 states. [2018-09-23 19:45:19,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:45:19,402 INFO L93 Difference]: Finished difference Result 498 states and 646 transitions. [2018-09-23 19:45:19,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:45:19,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-09-23 19:45:19,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:45:19,405 INFO L225 Difference]: With dead ends: 498 [2018-09-23 19:45:19,405 INFO L226 Difference]: Without dead ends: 268 [2018-09-23 19:45:19,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:45:19,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-09-23 19:45:19,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-09-23 19:45:19,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-09-23 19:45:19,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 337 transitions. [2018-09-23 19:45:19,439 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 337 transitions. Word has length 86 [2018-09-23 19:45:19,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:45:19,440 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 337 transitions. [2018-09-23 19:45:19,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:45:19,440 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 337 transitions. [2018-09-23 19:45:19,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-23 19:45:19,441 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:45:19,442 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:45:19,442 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:45:19,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:45:19,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1980925187, now seen corresponding path program 1 times [2018-09-23 19:45:19,445 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:45:19,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:45:19,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:19,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:45:19,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:45:19,547 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-09-23 19:45:19,548 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:45:19,548 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:45:19,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:45:19,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:45:19,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:45:19,549 INFO L87 Difference]: Start difference. First operand 268 states and 337 transitions. Second operand 3 states. [2018-09-23 19:45:20,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:45:20,104 INFO L93 Difference]: Finished difference Result 561 states and 712 transitions. [2018-09-23 19:45:20,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:45:20,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-09-23 19:45:20,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:45:20,106 INFO L225 Difference]: With dead ends: 561 [2018-09-23 19:45:20,107 INFO L226 Difference]: Without dead ends: 301 [2018-09-23 19:45:20,108 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:45:20,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-09-23 19:45:20,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-09-23 19:45:20,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-09-23 19:45:20,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 370 transitions. [2018-09-23 19:45:20,142 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 370 transitions. Word has length 96 [2018-09-23 19:45:20,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:45:20,143 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 370 transitions. [2018-09-23 19:45:20,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:45:20,143 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 370 transitions. [2018-09-23 19:45:20,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-09-23 19:45:20,144 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:45:20,144 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-23 19:45:20,145 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:45:20,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:45:20,146 INFO L82 PathProgramCache]: Analyzing trace with hash -93746115, now seen corresponding path program 1 times [2018-09-23 19:45:20,146 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:45:20,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:45:20,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:20,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:45:20,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:20,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:45:20,276 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-23 19:45:20,276 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:45:20,276 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:45:20,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:45:20,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:45:20,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:45:20,277 INFO L87 Difference]: Start difference. First operand 301 states and 370 transitions. Second operand 3 states. [2018-09-23 19:45:20,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:45:20,444 INFO L93 Difference]: Finished difference Result 397 states and 491 transitions. [2018-09-23 19:45:20,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:45:20,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-09-23 19:45:20,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:45:20,447 INFO L225 Difference]: With dead ends: 397 [2018-09-23 19:45:20,447 INFO L226 Difference]: Without dead ends: 395 [2018-09-23 19:45:20,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:45:20,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-09-23 19:45:20,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-09-23 19:45:20,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-09-23 19:45:20,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 489 transitions. [2018-09-23 19:45:20,497 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 489 transitions. Word has length 107 [2018-09-23 19:45:20,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:45:20,498 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 489 transitions. [2018-09-23 19:45:20,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:45:20,498 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 489 transitions. [2018-09-23 19:45:20,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-23 19:45:20,499 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:45:20,500 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 11, 10, 9, 8, 7, 6, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:45:20,500 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:45:20,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:45:20,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1780977529, now seen corresponding path program 1 times [2018-09-23 19:45:20,500 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:45:20,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:45:20,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:20,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:45:20,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:20,518 ERROR L236 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-09-23 19:45:20,519 INFO L259 seRefinementStrategy]: Advancing trace checker [2018-09-23 19:45:20,519 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-09-23 19:45:20,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:45:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:45:20,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:45:20,695 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2018-09-23 19:45:20,725 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:45:20,725 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:45:20,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:45:20,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:45:20,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:45:20,726 INFO L87 Difference]: Start difference. First operand 395 states and 489 transitions. Second operand 3 states. [2018-09-23 19:45:20,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:45:20,906 INFO L93 Difference]: Finished difference Result 782 states and 969 transitions. [2018-09-23 19:45:20,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:45:20,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2018-09-23 19:45:20,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:45:20,908 INFO L225 Difference]: With dead ends: 782 [2018-09-23 19:45:20,908 INFO L226 Difference]: Without dead ends: 395 [2018-09-23 19:45:20,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:45:20,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-09-23 19:45:20,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-09-23 19:45:20,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-09-23 19:45:20,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 466 transitions. [2018-09-23 19:45:20,950 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 466 transitions. Word has length 136 [2018-09-23 19:45:20,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:45:20,951 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 466 transitions. [2018-09-23 19:45:20,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:45:20,951 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 466 transitions. [2018-09-23 19:45:20,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-23 19:45:20,953 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:45:20,953 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-23 19:45:20,953 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:45:20,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:45:20,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1988836963, now seen corresponding path program 1 times [2018-09-23 19:45:20,954 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:45:20,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:45:20,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:20,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:45:20,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:45:21,152 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-23 19:45:21,153 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:45:21,153 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:45:21,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:45:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:45:21,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:45:21,337 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-23 19:45:21,366 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:45:21,366 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-09-23 19:45:21,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-23 19:45:21,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-23 19:45:21,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-23 19:45:21,368 INFO L87 Difference]: Start difference. First operand 395 states and 466 transitions. Second operand 4 states. [2018-09-23 19:45:21,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:45:21,695 INFO L93 Difference]: Finished difference Result 629 states and 744 transitions. [2018-09-23 19:45:21,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-23 19:45:21,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2018-09-23 19:45:21,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:45:21,696 INFO L225 Difference]: With dead ends: 629 [2018-09-23 19:45:21,696 INFO L226 Difference]: Without dead ends: 0 [2018-09-23 19:45:21,697 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-23 19:45:21,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-23 19:45:21,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-23 19:45:21,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-23 19:45:21,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-23 19:45:21,697 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 188 [2018-09-23 19:45:21,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:45:21,699 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-23 19:45:21,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-23 19:45:21,699 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-23 19:45:21,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-23 19:45:21,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-23 19:45:21,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:21,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:22,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:22,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:22,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:22,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:22,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:22,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:22,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:22,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:22,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:22,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:22,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:22,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:22,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:45:23,187 WARN L178 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2018-09-23 19:45:23,637 WARN L178 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2018-09-23 19:45:23,808 WARN L178 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-09-23 19:45:24,286 WARN L178 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-09-23 19:45:24,409 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2018-09-23 19:45:24,656 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-09-23 19:45:24,780 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-09-23 19:45:24,927 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2018-09-23 19:45:25,229 WARN L178 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-09-23 19:45:25,358 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2018-09-23 19:45:25,461 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-09-23 19:45:25,570 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 26 [2018-09-23 19:45:25,672 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-09-23 19:45:25,676 INFO L422 ceAbstractionStarter]: At program point L345(lines 345 353) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)) (and .cse2 .cse3 .cse4 .cse5 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)))) [2018-09-23 19:45:25,676 INFO L422 ceAbstractionStarter]: At program point L304(lines 304 320) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0) (and .cse1 .cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and .cse3 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)) (and .cse3 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)))) [2018-09-23 19:45:25,677 INFO L422 ceAbstractionStarter]: At program point L420(lines 420 440) the Hoare annotation is: (let ((.cse0 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) .cse0 .cse1) (and (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) .cse0 .cse1))) [2018-09-23 19:45:25,677 INFO L422 ceAbstractionStarter]: At program point L482(lines 264 482) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-09-23 19:45:25,677 INFO L422 ceAbstractionStarter]: At program point L416(lines 416 427) the Hoare annotation is: (and (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) [2018-09-23 19:45:25,677 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 3 485) no Hoare annotation was computed. [2018-09-23 19:45:25,677 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 3 485) no Hoare annotation was computed. [2018-09-23 19:45:25,678 INFO L422 ceAbstractionStarter]: At program point L408(lines 408 417) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~4 8576) .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) .cse0 .cse1 .cse2 .cse3))) [2018-09-23 19:45:25,678 INFO L422 ceAbstractionStarter]: At program point L375(lines 375 387) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~4 8576) .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) .cse0 .cse1 .cse2 .cse3))) [2018-09-23 19:45:25,678 INFO L422 ceAbstractionStarter]: At program point L462(lines 459 477) the Hoare annotation is: (and (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) [2018-09-23 19:45:25,679 INFO L422 ceAbstractionStarter]: At program point L429(lines 426 448) the Hoare annotation is: (and (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) [2018-09-23 19:45:25,679 INFO L422 ceAbstractionStarter]: At program point L355(lines 355 372) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-09-23 19:45:25,679 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 3 485) no Hoare annotation was computed. [2018-09-23 19:45:25,679 INFO L422 ceAbstractionStarter]: At program point L273(lines 236 273) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-09-23 19:45:25,679 INFO L422 ceAbstractionStarter]: At program point L269(lines 269 288) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-09-23 19:45:25,679 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 484) no Hoare annotation was computed. [2018-09-23 19:45:25,680 INFO L422 ceAbstractionStarter]: At program point L323(lines 323 340) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse4 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)) (and .cse2 .cse3 .cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse3 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)))) [2018-09-23 19:45:25,680 INFO L422 ceAbstractionStarter]: At program point L447(lines 447 473) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) [2018-09-23 19:45:25,680 INFO L422 ceAbstractionStarter]: At program point L476(lines 476 483) the Hoare annotation is: false [2018-09-23 19:45:25,680 INFO L422 ceAbstractionStarter]: At program point L249(lines 249 265) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-09-23 19:45:25,680 INFO L422 ceAbstractionStarter]: At program point L439(lines 439 460) the Hoare annotation is: (and (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) [2018-09-23 19:45:25,680 INFO L422 ceAbstractionStarter]: At program point L390(lines 390 405) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~4 8576) .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) .cse0 .cse1 .cse2 .cse3))) [2018-09-23 19:45:25,680 INFO L422 ceAbstractionStarter]: At program point L291(lines 291 301) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-09-23 19:45:25,698 INFO L202 PluginConnector]: Adding new model s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.09 07:45:25 BoogieIcfgContainer [2018-09-23 19:45:25,699 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-23 19:45:25,699 INFO L168 Benchmark]: Toolchain (without parser) took 14646.01 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 116.9 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 18.6 MB). Peak memory consumption was 590.3 MB. Max. memory is 7.1 GB. [2018-09-23 19:45:25,701 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 19:45:25,701 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.75 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-23 19:45:25,702 INFO L168 Benchmark]: Boogie Preprocessor took 61.24 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-23 19:45:25,702 INFO L168 Benchmark]: RCFGBuilder took 769.88 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-23 19:45:25,703 INFO L168 Benchmark]: TraceAbstraction took 13753.70 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 116.9 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -13.1 MB). Peak memory consumption was 558.6 MB. Max. memory is 7.1 GB. [2018-09-23 19:45:25,706 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 54.75 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 61.24 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 769.88 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 13753.70 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 116.9 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -13.1 MB). Peak memory consumption was 558.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 484]: 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: 420]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || ((ssl3_accept_~blastFlag~4 <= 2 && !(8544 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || (((!(8656 == ssl3_accept_~s__state~4) && !(8672 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4)) - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: (((((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3)) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) - InvariantResult [Line: 459]: Loop Invariant Derived loop invariant: ((((!(8672 == ssl3_accept_~s__state~4) && !(8512 == ssl3_accept_~s__state~4)) && ssl3_accept_~blastFlag~4 <= 3) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4) - InvariantResult [Line: 323]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3)) || (((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || (((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448) - InvariantResult [Line: 355]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || (((((!(8512 == ssl3_accept_~s__state~4) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) && ssl3_accept_~s__state~4 <= 8576) && !(8448 == ssl3_accept_~s__state~4))) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4)) - InvariantResult [Line: 426]: Loop Invariant Derived loop invariant: (((((!(8656 == ssl3_accept_~s__state~4) && !(8672 == ssl3_accept_~s__state~4)) && ssl3_accept_~blastFlag~4 <= 2) && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4) - InvariantResult [Line: 236]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || (((((!(8512 == ssl3_accept_~s__state~4) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) && ssl3_accept_~s__state~4 <= 8576) && !(8448 == ssl3_accept_~s__state~4))) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4)) - InvariantResult [Line: 439]: Loop Invariant Derived loop invariant: ((((!(8672 == ssl3_accept_~s__state~4) && ssl3_accept_~blastFlag~4 <= 2) && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: (((((!(8656 == ssl3_accept_~s__state~4) && !(8672 == ssl3_accept_~s__state~4)) && ssl3_accept_~blastFlag~4 <= 2) && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4) - InvariantResult [Line: 447]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3 - InvariantResult [Line: 476]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 269]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || (((((!(8512 == ssl3_accept_~s__state~4) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) && ssl3_accept_~s__state~4 <= 8576) && !(8448 == ssl3_accept_~s__state~4))) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4)) - InvariantResult [Line: 291]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 304]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || ((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448) - InvariantResult [Line: 249]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 1 error locations. SAFE Result, 13.6s OverallTime, 18 OverallIterations, 19 TraceHistogramMax, 6.2s AutomataDifference, 0.0s DeadEndRemovalTime, 3.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 463 SDtfs, 165 SDslu, 184 SDs, 0 SdLazy, 673 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 465 GetRequests, 439 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=395occurred in iteration=16, 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.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 166 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 19 PreInvPairs, 288 NumberOfFragments, 732 HoareAnnotationTreeSize, 19 FomulaSimplifications, 12030 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 19 FomulaSimplificationsInter, 1541 FormulaSimplificationTreeSizeReductionInter, 3.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1437 NumberOfCodeBlocks, 1437 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1417 ConstructedInterpolants, 0 QuantifiedInterpolants, 184792 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2058 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 5056/5080 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_3_alt.BV.c.cil.c_19.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-23_19-45-25-726.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_3_alt.BV.c.cil.c_19.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-23_19-45-25-726.csv Received shutdown request...