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-d19836b [2018-09-26 21:26:24,022 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:26:24,025 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:26:24,043 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:26:24,044 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:26:24,045 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:26:24,047 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:26:24,049 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:26:24,051 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:26:24,054 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:26:24,056 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:26:24,056 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:26:24,058 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:26:24,059 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:26:24,062 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:26:24,063 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:26:24,064 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:26:24,073 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:26:24,076 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:26:24,078 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:26:24,079 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:26:24,081 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:26:24,084 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:26:24,084 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:26:24,084 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:26:24,085 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:26:24,086 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:26:24,090 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:26:24,090 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:26:24,091 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:26:24,092 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:26:24,093 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:26:24,094 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:26:24,094 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:26:24,095 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:26:24,096 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:26:24,096 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-26 21:26:24,115 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:26:24,116 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:26:24,117 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:26:24,117 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:26:24,118 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:26:24,118 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:26:24,118 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:26:24,118 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:26:24,119 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:26:24,119 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:26:24,120 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:26:24,120 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:26:24,120 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:26:24,120 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:26:24,120 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:26:24,121 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:26:24,121 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:26:24,121 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:26:24,121 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:26:24,121 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:26:24,122 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:26:24,123 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:26:24,123 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:26:24,123 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:26:24,123 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:26:24,123 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:26:24,124 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:26:24,124 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:26:24,124 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:26:24,124 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:26:24,183 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:26:24,198 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:26:24,206 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:26:24,207 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:26:24,209 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:26:24,210 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-26 21:26:24,210 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-26 21:26:24,310 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:26:24,313 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:26:24,314 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:26:24,314 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:26:24,314 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:26:24,334 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 26.09 09:26:24" (1/1) ... [2018-09-26 21:26:24,351 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 26.09 09:26:24" (1/1) ... [2018-09-26 21:26:24,359 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:26:24,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:26:24,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:26:24,360 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:26:24,372 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 26.09 09:26:24" (1/1) ... [2018-09-26 21:26:24,372 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 26.09 09:26:24" (1/1) ... [2018-09-26 21:26:24,375 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 26.09 09:26:24" (1/1) ... [2018-09-26 21:26:24,376 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 26.09 09:26:24" (1/1) ... [2018-09-26 21:26:24,385 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 26.09 09:26:24" (1/1) ... [2018-09-26 21:26:24,390 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 26.09 09:26:24" (1/1) ... [2018-09-26 21:26:24,395 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 26.09 09:26:24" (1/1) ... [2018-09-26 21:26:24,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:26:24,409 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:26:24,409 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:26:24,410 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:26:24,411 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 26.09 09:26:24" (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-26 21:26:24,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 21:26:24,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 21:26:25,346 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 21:26:25,347 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 26.09 09:26:25 BoogieIcfgContainer [2018-09-26 21:26:25,347 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:26:25,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:26:25,348 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:26:25,351 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:26:25,352 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 26.09 09:26:24" (1/2) ... [2018-09-26 21:26:25,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be9107 and model type s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:26:25, skipping insertion in model container [2018-09-26 21:26:25,353 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 26.09 09:26:25" (2/2) ... [2018-09-26 21:26:25,355 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3_alt.BV.c.cil.c_19.bpl [2018-09-26 21:26:25,365 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:26:25,373 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 21:26:25,418 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:26:25,419 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:26:25,419 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:26:25,419 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:26:25,419 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:26:25,419 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:26:25,420 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:26:25,420 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:26:25,420 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:26:25,436 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-09-26 21:26:25,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 21:26:25,444 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:25,445 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:26:25,446 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:25,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:25,453 INFO L82 PathProgramCache]: Analyzing trace with hash -505433715, now seen corresponding path program 1 times [2018-09-26 21:26:25,455 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:25,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:25,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:25,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:25,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:25,690 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-26 21:26:25,692 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:25,693 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:26:25,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:25,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:25,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:25,717 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-09-26 21:26:26,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:26,041 INFO L93 Difference]: Finished difference Result 56 states and 94 transitions. [2018-09-26 21:26:26,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:26,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-26 21:26:26,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:26,059 INFO L225 Difference]: With dead ends: 56 [2018-09-26 21:26:26,059 INFO L226 Difference]: Without dead ends: 34 [2018-09-26 21:26:26,063 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-26 21:26:26,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-26 21:26:26,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-09-26 21:26:26,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-26 21:26:26,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2018-09-26 21:26:26,112 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 15 [2018-09-26 21:26:26,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:26,113 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2018-09-26 21:26:26,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:26,113 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2018-09-26 21:26:26,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 21:26:26,114 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:26,114 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:26:26,116 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:26,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:26,117 INFO L82 PathProgramCache]: Analyzing trace with hash -912155261, now seen corresponding path program 1 times [2018-09-26 21:26:26,117 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:26,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:26,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:26,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:26,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:26,241 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-26 21:26:26,242 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:26,242 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:26:26,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:26,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:26,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:26,245 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2018-09-26 21:26:26,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:26,549 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-09-26 21:26:26,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:26,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-09-26 21:26:26,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:26,552 INFO L225 Difference]: With dead ends: 83 [2018-09-26 21:26:26,552 INFO L226 Difference]: Without dead ends: 50 [2018-09-26 21:26:26,554 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-26 21:26:26,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-26 21:26:26,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-09-26 21:26:26,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-26 21:26:26,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 83 transitions. [2018-09-26 21:26:26,570 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 83 transitions. Word has length 23 [2018-09-26 21:26:26,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:26,571 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 83 transitions. [2018-09-26 21:26:26,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:26,573 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 83 transitions. [2018-09-26 21:26:26,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 21:26:26,575 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:26,575 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-26 21:26:26,576 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:26,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:26,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1423527967, now seen corresponding path program 1 times [2018-09-26 21:26:26,577 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:26,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:26,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:26,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:26,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:26,706 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-26 21:26:26,707 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:26,707 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:26:26,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:26,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:26,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:26,708 INFO L87 Difference]: Start difference. First operand 50 states and 83 transitions. Second operand 3 states. [2018-09-26 21:26:26,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:26,914 INFO L93 Difference]: Finished difference Result 106 states and 177 transitions. [2018-09-26 21:26:26,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:26,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-09-26 21:26:26,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:26,917 INFO L225 Difference]: With dead ends: 106 [2018-09-26 21:26:26,917 INFO L226 Difference]: Without dead ends: 57 [2018-09-26 21:26:26,918 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-26 21:26:26,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-26 21:26:26,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-09-26 21:26:26,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-26 21:26:26,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 92 transitions. [2018-09-26 21:26:26,932 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 92 transitions. Word has length 30 [2018-09-26 21:26:26,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:26,933 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 92 transitions. [2018-09-26 21:26:26,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:26,933 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 92 transitions. [2018-09-26 21:26:26,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 21:26:26,934 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:26,934 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-26 21:26:26,935 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:26,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:26,935 INFO L82 PathProgramCache]: Analyzing trace with hash 222883079, now seen corresponding path program 1 times [2018-09-26 21:26:26,935 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:26,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:26,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:26,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:26,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:27,021 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-26 21:26:27,021 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:27,021 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:26:27,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:27,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:27,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:27,025 INFO L87 Difference]: Start difference. First operand 57 states and 92 transitions. Second operand 3 states. [2018-09-26 21:26:27,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:27,300 INFO L93 Difference]: Finished difference Result 131 states and 214 transitions. [2018-09-26 21:26:27,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:27,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-09-26 21:26:27,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:27,302 INFO L225 Difference]: With dead ends: 131 [2018-09-26 21:26:27,302 INFO L226 Difference]: Without dead ends: 74 [2018-09-26 21:26:27,302 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-26 21:26:27,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-26 21:26:27,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-09-26 21:26:27,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-26 21:26:27,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 120 transitions. [2018-09-26 21:26:27,325 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 120 transitions. Word has length 30 [2018-09-26 21:26:27,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:27,326 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 120 transitions. [2018-09-26 21:26:27,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:27,326 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 120 transitions. [2018-09-26 21:26:27,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 21:26:27,328 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:27,329 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-26 21:26:27,329 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:27,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:27,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1035189277, now seen corresponding path program 1 times [2018-09-26 21:26:27,330 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:27,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:27,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:27,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:27,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:27,419 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-26 21:26:27,419 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:27,419 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:26:27,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:27,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:27,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:27,421 INFO L87 Difference]: Start difference. First operand 74 states and 120 transitions. Second operand 3 states. [2018-09-26 21:26:27,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:27,794 INFO L93 Difference]: Finished difference Result 153 states and 249 transitions. [2018-09-26 21:26:27,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:27,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-09-26 21:26:27,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:27,797 INFO L225 Difference]: With dead ends: 153 [2018-09-26 21:26:27,797 INFO L226 Difference]: Without dead ends: 80 [2018-09-26 21:26:27,799 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-26 21:26:27,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-09-26 21:26:27,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-09-26 21:26:27,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-09-26 21:26:27,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 125 transitions. [2018-09-26 21:26:27,825 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 125 transitions. Word has length 36 [2018-09-26 21:26:27,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:27,826 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 125 transitions. [2018-09-26 21:26:27,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:27,826 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 125 transitions. [2018-09-26 21:26:27,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-26 21:26:27,830 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:27,831 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-26 21:26:27,831 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:27,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:27,832 INFO L82 PathProgramCache]: Analyzing trace with hash -720648959, now seen corresponding path program 1 times [2018-09-26 21:26:27,832 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:27,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:27,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:27,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:27,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:27,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:27,915 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-26 21:26:27,915 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:27,915 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:26:27,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:27,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:27,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:27,917 INFO L87 Difference]: Start difference. First operand 80 states and 125 transitions. Second operand 3 states. [2018-09-26 21:26:28,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:28,118 INFO L93 Difference]: Finished difference Result 164 states and 257 transitions. [2018-09-26 21:26:28,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:28,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-09-26 21:26:28,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:28,120 INFO L225 Difference]: With dead ends: 164 [2018-09-26 21:26:28,120 INFO L226 Difference]: Without dead ends: 85 [2018-09-26 21:26:28,121 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-26 21:26:28,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-26 21:26:28,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-26 21:26:28,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-26 21:26:28,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2018-09-26 21:26:28,136 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 41 [2018-09-26 21:26:28,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:28,136 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2018-09-26 21:26:28,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:28,137 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2018-09-26 21:26:28,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 21:26:28,138 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:28,138 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-26 21:26:28,139 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:28,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:28,139 INFO L82 PathProgramCache]: Analyzing trace with hash -2015268825, now seen corresponding path program 1 times [2018-09-26 21:26:28,139 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:28,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:28,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:28,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:28,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:28,151 ERROR L236 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-09-26 21:26:28,151 INFO L259 seRefinementStrategy]: Advancing trace checker [2018-09-26 21:26:28,151 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-26 21:26:28,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:28,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:26:28,302 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-26 21:26:28,341 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:28,341 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:26:28,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:28,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:28,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:28,342 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand 3 states. [2018-09-26 21:26:28,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:28,563 INFO L93 Difference]: Finished difference Result 246 states and 370 transitions. [2018-09-26 21:26:28,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:28,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-09-26 21:26:28,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:28,565 INFO L225 Difference]: With dead ends: 246 [2018-09-26 21:26:28,566 INFO L226 Difference]: Without dead ends: 162 [2018-09-26 21:26:28,567 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-26 21:26:28,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-09-26 21:26:28,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-09-26 21:26:28,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-09-26 21:26:28,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 234 transitions. [2018-09-26 21:26:28,617 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 234 transitions. Word has length 44 [2018-09-26 21:26:28,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:28,617 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 234 transitions. [2018-09-26 21:26:28,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:28,620 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 234 transitions. [2018-09-26 21:26:28,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-26 21:26:28,622 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:28,622 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-26 21:26:28,625 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:28,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:28,626 INFO L82 PathProgramCache]: Analyzing trace with hash -688187521, now seen corresponding path program 1 times [2018-09-26 21:26:28,626 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:28,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:28,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:28,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:28,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:28,733 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-26 21:26:28,735 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:28,735 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:26:28,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:28,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:28,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:28,736 INFO L87 Difference]: Start difference. First operand 162 states and 234 transitions. Second operand 3 states. [2018-09-26 21:26:28,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:28,982 INFO L93 Difference]: Finished difference Result 250 states and 366 transitions. [2018-09-26 21:26:28,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:28,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-09-26 21:26:28,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:28,984 INFO L225 Difference]: With dead ends: 250 [2018-09-26 21:26:28,984 INFO L226 Difference]: Without dead ends: 166 [2018-09-26 21:26:28,985 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-26 21:26:28,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-09-26 21:26:29,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-09-26 21:26:29,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-09-26 21:26:29,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 238 transitions. [2018-09-26 21:26:29,008 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 238 transitions. Word has length 47 [2018-09-26 21:26:29,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:29,008 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 238 transitions. [2018-09-26 21:26:29,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:29,008 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 238 transitions. [2018-09-26 21:26:29,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 21:26:29,010 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:29,010 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-26 21:26:29,011 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:29,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:29,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1326956629, now seen corresponding path program 1 times [2018-09-26 21:26:29,011 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:29,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:29,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:29,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:29,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:29,143 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-26 21:26:29,143 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:26:29,144 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-26 21:26:29,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:29,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:26:29,315 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-26 21:26:29,339 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-26 21:26:29,340 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-09-26 21:26:29,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 21:26:29,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 21:26:29,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 21:26:29,341 INFO L87 Difference]: Start difference. First operand 166 states and 238 transitions. Second operand 5 states. [2018-09-26 21:26:30,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:30,376 INFO L93 Difference]: Finished difference Result 598 states and 860 transitions. [2018-09-26 21:26:30,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 21:26:30,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-09-26 21:26:30,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:30,379 INFO L225 Difference]: With dead ends: 598 [2018-09-26 21:26:30,379 INFO L226 Difference]: Without dead ends: 406 [2018-09-26 21:26:30,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-26 21:26:30,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-09-26 21:26:30,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 240. [2018-09-26 21:26:30,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-09-26 21:26:30,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 333 transitions. [2018-09-26 21:26:30,421 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 333 transitions. Word has length 48 [2018-09-26 21:26:30,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:30,422 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 333 transitions. [2018-09-26 21:26:30,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 21:26:30,422 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 333 transitions. [2018-09-26 21:26:30,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 21:26:30,423 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:30,423 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-26 21:26:30,424 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:30,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:30,424 INFO L82 PathProgramCache]: Analyzing trace with hash 2115677753, now seen corresponding path program 1 times [2018-09-26 21:26:30,424 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:30,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:30,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:30,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:30,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:30,501 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-26 21:26:30,501 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:30,501 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:26:30,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:30,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:30,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:30,503 INFO L87 Difference]: Start difference. First operand 240 states and 333 transitions. Second operand 3 states. [2018-09-26 21:26:30,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:30,672 INFO L93 Difference]: Finished difference Result 399 states and 560 transitions. [2018-09-26 21:26:30,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:30,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-09-26 21:26:30,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:30,674 INFO L225 Difference]: With dead ends: 399 [2018-09-26 21:26:30,674 INFO L226 Difference]: Without dead ends: 239 [2018-09-26 21:26:30,675 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-26 21:26:30,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-09-26 21:26:30,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-09-26 21:26:30,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-09-26 21:26:30,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 329 transitions. [2018-09-26 21:26:30,711 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 329 transitions. Word has length 60 [2018-09-26 21:26:30,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:30,712 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 329 transitions. [2018-09-26 21:26:30,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:30,712 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 329 transitions. [2018-09-26 21:26:30,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-26 21:26:30,713 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:30,713 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-26 21:26:30,714 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:30,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:30,714 INFO L82 PathProgramCache]: Analyzing trace with hash 227864519, now seen corresponding path program 1 times [2018-09-26 21:26:30,714 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:30,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:30,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:30,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:30,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:30,809 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-26 21:26:30,810 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:30,810 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:26:30,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:30,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:30,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:30,811 INFO L87 Difference]: Start difference. First operand 239 states and 329 transitions. Second operand 3 states. [2018-09-26 21:26:30,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:30,954 INFO L93 Difference]: Finished difference Result 470 states and 649 transitions. [2018-09-26 21:26:30,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:30,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-09-26 21:26:30,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:30,959 INFO L225 Difference]: With dead ends: 470 [2018-09-26 21:26:30,959 INFO L226 Difference]: Without dead ends: 237 [2018-09-26 21:26:30,960 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-26 21:26:30,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-09-26 21:26:30,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-09-26 21:26:30,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-09-26 21:26:30,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 319 transitions. [2018-09-26 21:26:30,992 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 319 transitions. Word has length 65 [2018-09-26 21:26:30,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:30,993 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 319 transitions. [2018-09-26 21:26:30,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:30,993 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 319 transitions. [2018-09-26 21:26:30,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-26 21:26:30,994 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:30,994 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-26 21:26:30,995 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:30,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:30,995 INFO L82 PathProgramCache]: Analyzing trace with hash -242141821, now seen corresponding path program 1 times [2018-09-26 21:26:30,995 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:30,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:30,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:30,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:30,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:31,087 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-26 21:26:31,088 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:31,088 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:26:31,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:31,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:31,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:31,089 INFO L87 Difference]: Start difference. First operand 237 states and 319 transitions. Second operand 3 states. [2018-09-26 21:26:31,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:31,247 INFO L93 Difference]: Finished difference Result 465 states and 628 transitions. [2018-09-26 21:26:31,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:31,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-09-26 21:26:31,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:31,250 INFO L225 Difference]: With dead ends: 465 [2018-09-26 21:26:31,251 INFO L226 Difference]: Without dead ends: 235 [2018-09-26 21:26:31,251 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-26 21:26:31,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-09-26 21:26:31,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-09-26 21:26:31,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-09-26 21:26:31,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 309 transitions. [2018-09-26 21:26:31,283 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 309 transitions. Word has length 71 [2018-09-26 21:26:31,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:31,283 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 309 transitions. [2018-09-26 21:26:31,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:31,283 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 309 transitions. [2018-09-26 21:26:31,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-26 21:26:31,284 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:31,285 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-26 21:26:31,285 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:31,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:31,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1274982729, now seen corresponding path program 1 times [2018-09-26 21:26:31,286 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:31,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:31,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:31,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:31,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:31,373 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-26 21:26:31,373 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:31,373 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:26:31,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:31,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:31,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:31,374 INFO L87 Difference]: Start difference. First operand 235 states and 309 transitions. Second operand 3 states. [2018-09-26 21:26:31,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:31,570 INFO L93 Difference]: Finished difference Result 465 states and 615 transitions. [2018-09-26 21:26:31,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:31,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-09-26 21:26:31,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:31,572 INFO L225 Difference]: With dead ends: 465 [2018-09-26 21:26:31,572 INFO L226 Difference]: Without dead ends: 238 [2018-09-26 21:26:31,573 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-26 21:26:31,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-09-26 21:26:31,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-09-26 21:26:31,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-09-26 21:26:31,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 307 transitions. [2018-09-26 21:26:31,599 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 307 transitions. Word has length 78 [2018-09-26 21:26:31,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:31,599 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 307 transitions. [2018-09-26 21:26:31,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:31,600 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 307 transitions. [2018-09-26 21:26:31,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-26 21:26:31,600 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:31,601 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-26 21:26:31,601 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:31,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:31,601 INFO L82 PathProgramCache]: Analyzing trace with hash 409856557, now seen corresponding path program 1 times [2018-09-26 21:26:31,601 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:31,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:31,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:31,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:31,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:31,698 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-26 21:26:31,698 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:31,699 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:26:31,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:31,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:31,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:31,700 INFO L87 Difference]: Start difference. First operand 238 states and 307 transitions. Second operand 3 states. [2018-09-26 21:26:31,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:31,967 INFO L93 Difference]: Finished difference Result 498 states and 646 transitions. [2018-09-26 21:26:31,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:31,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-09-26 21:26:31,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:31,969 INFO L225 Difference]: With dead ends: 498 [2018-09-26 21:26:31,969 INFO L226 Difference]: Without dead ends: 268 [2018-09-26 21:26:31,970 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-26 21:26:31,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-09-26 21:26:31,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-09-26 21:26:31,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-09-26 21:26:32,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 337 transitions. [2018-09-26 21:26:32,000 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 337 transitions. Word has length 86 [2018-09-26 21:26:32,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:32,000 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 337 transitions. [2018-09-26 21:26:32,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:32,001 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 337 transitions. [2018-09-26 21:26:32,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-26 21:26:32,002 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:32,002 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-26 21:26:32,002 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:32,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:32,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1980925187, now seen corresponding path program 1 times [2018-09-26 21:26:32,003 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:32,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:32,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:32,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:32,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:32,110 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-26 21:26:32,110 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:32,111 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:26:32,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:32,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:32,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:32,112 INFO L87 Difference]: Start difference. First operand 268 states and 337 transitions. Second operand 3 states. [2018-09-26 21:26:32,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:32,306 INFO L93 Difference]: Finished difference Result 561 states and 712 transitions. [2018-09-26 21:26:32,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:32,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-09-26 21:26:32,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:32,308 INFO L225 Difference]: With dead ends: 561 [2018-09-26 21:26:32,309 INFO L226 Difference]: Without dead ends: 301 [2018-09-26 21:26:32,310 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-26 21:26:32,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-09-26 21:26:32,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-09-26 21:26:32,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-09-26 21:26:32,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 370 transitions. [2018-09-26 21:26:32,343 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 370 transitions. Word has length 96 [2018-09-26 21:26:32,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:32,343 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 370 transitions. [2018-09-26 21:26:32,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:32,343 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 370 transitions. [2018-09-26 21:26:32,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-09-26 21:26:32,345 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:32,345 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-26 21:26:32,345 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:32,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:32,345 INFO L82 PathProgramCache]: Analyzing trace with hash -93746115, now seen corresponding path program 1 times [2018-09-26 21:26:32,346 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:32,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:32,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:32,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:32,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:32,452 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-26 21:26:32,453 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:32,453 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:26:32,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:32,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:32,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:32,454 INFO L87 Difference]: Start difference. First operand 301 states and 370 transitions. Second operand 3 states. [2018-09-26 21:26:32,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:32,635 INFO L93 Difference]: Finished difference Result 397 states and 491 transitions. [2018-09-26 21:26:32,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:32,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-09-26 21:26:32,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:32,638 INFO L225 Difference]: With dead ends: 397 [2018-09-26 21:26:32,638 INFO L226 Difference]: Without dead ends: 395 [2018-09-26 21:26:32,639 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-26 21:26:32,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-09-26 21:26:32,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-09-26 21:26:32,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-09-26 21:26:32,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 489 transitions. [2018-09-26 21:26:32,687 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 489 transitions. Word has length 107 [2018-09-26 21:26:32,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:32,687 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 489 transitions. [2018-09-26 21:26:32,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:32,688 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 489 transitions. [2018-09-26 21:26:32,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-26 21:26:32,689 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:32,690 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-26 21:26:32,690 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:32,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:32,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1780977529, now seen corresponding path program 1 times [2018-09-26 21:26:32,690 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:32,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:32,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:32,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:32,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:32,708 ERROR L236 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-09-26 21:26:32,708 INFO L259 seRefinementStrategy]: Advancing trace checker [2018-09-26 21:26:32,708 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) [2018-09-26 21:26:32,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-09-26 21:26:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:32,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:26:32,897 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-26 21:26:32,921 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:32,921 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:26:32,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:32,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:32,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:32,922 INFO L87 Difference]: Start difference. First operand 395 states and 489 transitions. Second operand 3 states. [2018-09-26 21:26:33,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:33,038 INFO L93 Difference]: Finished difference Result 782 states and 969 transitions. [2018-09-26 21:26:33,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:33,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2018-09-26 21:26:33,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:33,040 INFO L225 Difference]: With dead ends: 782 [2018-09-26 21:26:33,040 INFO L226 Difference]: Without dead ends: 395 [2018-09-26 21:26:33,041 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-26 21:26:33,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-09-26 21:26:33,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-09-26 21:26:33,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-09-26 21:26:33,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 466 transitions. [2018-09-26 21:26:33,084 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 466 transitions. Word has length 136 [2018-09-26 21:26:33,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:33,085 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 466 transitions. [2018-09-26 21:26:33,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:33,085 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 466 transitions. [2018-09-26 21:26:33,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-26 21:26:33,087 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:33,087 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-26 21:26:33,087 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:33,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:33,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1988836963, now seen corresponding path program 1 times [2018-09-26 21:26:33,088 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:33,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:33,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:33,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:33,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:33,293 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-26 21:26:33,294 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:26:33,294 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-26 21:26:33,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:33,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:26:33,450 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-26 21:26:33,483 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:26:33,484 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-09-26 21:26:33,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 21:26:33,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 21:26:33,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 21:26:33,485 INFO L87 Difference]: Start difference. First operand 395 states and 466 transitions. Second operand 4 states. [2018-09-26 21:26:33,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:33,751 INFO L93 Difference]: Finished difference Result 629 states and 744 transitions. [2018-09-26 21:26:33,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 21:26:33,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2018-09-26 21:26:33,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:33,752 INFO L225 Difference]: With dead ends: 629 [2018-09-26 21:26:33,752 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 21:26:33,753 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-26 21:26:33,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 21:26:33,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 21:26:33,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 21:26:33,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 21:26:33,753 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 188 [2018-09-26 21:26:33,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:33,754 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 21:26:33,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 21:26:33,754 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 21:26:33,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 21:26:33,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 21:26:33,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:33,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:34,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:34,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:34,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:34,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:34,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:34,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:34,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:34,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:34,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:34,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:34,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:34,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:34,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:34,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:34,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:34,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:34,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:34,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:34,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:34,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:34,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:34,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:34,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:34,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:34,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:34,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:34,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:26:34,955 WARN L178 SmtUtils]: Spent 746.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2018-09-26 21:26:35,161 WARN L178 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2018-09-26 21:26:36,012 WARN L178 SmtUtils]: Spent 788.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-09-26 21:26:36,375 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-09-26 21:26:36,476 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-09-26 21:26:36,847 WARN L178 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-09-26 21:26:37,136 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 26 [2018-09-26 21:26:37,241 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-09-26 21:26:37,244 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-26 21:26:37,245 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-26 21:26:37,245 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 484) no Hoare annotation was computed. [2018-09-26 21:26:37,245 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-26 21:26:37,245 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-26 21:26:37,246 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-26 21:26:37,246 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 3 485) no Hoare annotation was computed. [2018-09-26 21:26:37,246 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 3 485) no Hoare annotation was computed. [2018-09-26 21:26:37,246 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-26 21:26:37,246 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-26 21:26:37,246 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-26 21:26:37,247 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-26 21:26:37,247 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-26 21:26:37,247 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 3 485) no Hoare annotation was computed. [2018-09-26 21:26:37,247 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-26 21:26:37,247 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-26 21:26:37,247 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-26 21:26:37,247 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-26 21:26:37,247 INFO L422 ceAbstractionStarter]: At program point L476(lines 476 483) the Hoare annotation is: false [2018-09-26 21:26:37,248 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-26 21:26:37,248 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-26 21:26:37,248 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-26 21:26:37,248 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-26 21:26:37,266 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 26.09 09:26:37 BoogieIcfgContainer [2018-09-26 21:26:37,266 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:26:37,267 INFO L168 Benchmark]: Toolchain (without parser) took 12956.58 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 133.2 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 33.7 MB). Peak memory consumption was 596.3 MB. Max. memory is 7.1 GB. [2018-09-26 21:26:37,268 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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-26 21:26:37,269 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.37 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-26 21:26:37,269 INFO L168 Benchmark]: Boogie Preprocessor took 49.37 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-26 21:26:37,270 INFO L168 Benchmark]: RCFGBuilder took 937.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-26 21:26:37,273 INFO L168 Benchmark]: TraceAbstraction took 11918.28 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 133.2 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 1.9 MB). Peak memory consumption was 564.6 MB. Max. memory is 7.1 GB. [2018-09-26 21:26:37,277 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.37 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 49.37 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 937.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 11918.28 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 133.2 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 1.9 MB). Peak memory consumption was 564.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, 11.8s OverallTime, 18 OverallIterations, 19 TraceHistogramMax, 4.9s AutomataDifference, 0.0s DeadEndRemovalTime, 3.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 463 SDtfs, 165 SDslu, 184 SDs, 0 SdLazy, 673 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s 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.4s HoareSimplificationTime, 19 FomulaSimplificationsInter, 1541 FormulaSimplificationTreeSizeReductionInter, 3.0s 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-26_21-26-37-295.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-26_21-26-37-295.csv Received shutdown request...