java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_2_true-unreach-call_false-termination.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 01:42:59,238 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 01:42:59,239 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 01:42:59,251 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 01:42:59,252 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 01:42:59,252 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 01:42:59,253 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 01:42:59,254 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 01:42:59,255 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 01:42:59,256 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 01:42:59,256 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 01:42:59,256 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 01:42:59,257 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 01:42:59,258 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 01:42:59,258 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 01:42:59,263 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 01:42:59,264 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 01:42:59,267 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 01:42:59,267 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 01:42:59,268 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 01:42:59,269 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 01:42:59,269 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 01:42:59,269 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 01:42:59,270 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 01:42:59,270 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 01:42:59,271 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 01:42:59,271 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 01:42:59,271 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 01:42:59,271 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 01:42:59,271 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 01:42:59,272 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 01:42:59,272 INFO L98 SettingsManager]: Beginning loading settings from /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 01:42:59,278 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 01:42:59,278 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 01:42:59,278 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 01:42:59,282 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 01:42:59,282 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 01:42:59,282 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 01:42:59,282 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 01:42:59,283 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 01:42:59,283 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 01:42:59,283 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 01:42:59,283 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 01:42:59,283 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 01:42:59,283 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 01:42:59,283 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 01:42:59,283 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 01:42:59,284 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 01:42:59,284 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 01:42:59,284 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 01:42:59,284 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 01:42:59,284 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 01:42:59,284 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 01:42:59,284 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 01:42:59,284 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 01:42:59,284 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 01:42:59,284 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 01:42:59,284 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 01:42:59,284 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 01:42:59,285 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 01:42:59,285 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 01:42:59,285 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 01:42:59,285 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 01:42:59,285 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 01:42:59,285 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 01:42:59,285 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 01:42:59,312 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 01:42:59,319 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 01:42:59,321 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 01:42:59,324 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 01:42:59,324 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 01:42:59,325 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_2_true-unreach-call_false-termination.cil.c [2018-01-30 01:42:59,407 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 01:42:59,409 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 01:42:59,409 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 01:42:59,409 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 01:42:59,413 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 01:42:59,413 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:42:59" (1/1) ... [2018-01-30 01:42:59,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@415709b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:42:59, skipping insertion in model container [2018-01-30 01:42:59,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:42:59" (1/1) ... [2018-01-30 01:42:59,434 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:42:59,472 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:42:59,566 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:42:59,617 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:42:59,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:42:59 WrapperNode [2018-01-30 01:42:59,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 01:42:59,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 01:42:59,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 01:42:59,623 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 01:42:59,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:42:59" (1/1) ... [2018-01-30 01:42:59,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:42:59" (1/1) ... [2018-01-30 01:42:59,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:42:59" (1/1) ... [2018-01-30 01:42:59,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:42:59" (1/1) ... [2018-01-30 01:42:59,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:42:59" (1/1) ... [2018-01-30 01:42:59,662 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:42:59" (1/1) ... [2018-01-30 01:42:59,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:42:59" (1/1) ... [2018-01-30 01:42:59,666 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 01:42:59,666 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 01:42:59,666 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 01:42:59,666 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 01:42:59,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:42:59" (1/1) ... No working directory specified, using /home/daniel/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-01-30 01:42:59,699 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 01:42:59,699 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 01:42:59,699 INFO L136 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-01-30 01:42:59,699 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 01:42:59,700 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 01:42:59,700 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 01:42:59,700 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2018-01-30 01:42:59,700 INFO L128 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-01-30 01:42:59,700 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 01:42:59,700 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 01:42:59,700 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 01:42:59,954 WARN L490 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-01-30 01:42:59,954 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-30 01:43:00,769 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 01:43:00,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:43:00 BoogieIcfgContainer [2018-01-30 01:43:00,772 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 01:43:00,772 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 01:43:00,773 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 01:43:00,774 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 01:43:00,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 01:42:59" (1/3) ... [2018-01-30 01:43:00,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@707cfdae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:43:00, skipping insertion in model container [2018-01-30 01:43:00,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:42:59" (2/3) ... [2018-01-30 01:43:00,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@707cfdae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:43:00, skipping insertion in model container [2018-01-30 01:43:00,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:43:00" (3/3) ... [2018-01-30 01:43:00,790 INFO L107 eAbstractionObserver]: Analyzing ICFG s3_srvr_2_true-unreach-call_false-termination.cil.c [2018-01-30 01:43:00,795 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 01:43:00,801 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 01:43:00,837 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 01:43:00,837 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 01:43:00,837 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 01:43:00,837 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 01:43:00,837 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 01:43:00,837 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 01:43:00,837 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 01:43:00,838 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 01:43:00,838 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 01:43:00,857 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2018-01-30 01:43:00,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-01-30 01:43:00,875 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:00,876 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:00,876 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:00,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1810323293, now seen corresponding path program 1 times [2018-01-30 01:43:00,880 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:00,880 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:00,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:00,910 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:00,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:00,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:01,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:43:01,182 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:01,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:43:01,183 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:43:01,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:43:01,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:43:01,256 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 3 states. [2018-01-30 01:43:01,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:01,426 INFO L93 Difference]: Finished difference Result 929 states and 1217 transitions. [2018-01-30 01:43:01,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:43:01,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2018-01-30 01:43:01,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:01,438 INFO L225 Difference]: With dead ends: 929 [2018-01-30 01:43:01,438 INFO L226 Difference]: Without dead ends: 600 [2018-01-30 01:43:01,442 INFO L553 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-01-30 01:43:01,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-01-30 01:43:01,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2018-01-30 01:43:01,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-01-30 01:43:01,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 729 transitions. [2018-01-30 01:43:01,483 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 729 transitions. Word has length 180 [2018-01-30 01:43:01,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:01,483 INFO L432 AbstractCegarLoop]: Abstraction has 600 states and 729 transitions. [2018-01-30 01:43:01,483 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:43:01,484 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 729 transitions. [2018-01-30 01:43:01,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-01-30 01:43:01,487 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:01,487 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:01,487 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:01,488 INFO L82 PathProgramCache]: Analyzing trace with hash 831350367, now seen corresponding path program 1 times [2018-01-30 01:43:01,488 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:01,488 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:01,488 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:01,488 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:01,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:01,521 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:01,589 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:43:01,589 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:01,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:43:01,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:43:01,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:43:01,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:43:01,591 INFO L87 Difference]: Start difference. First operand 600 states and 729 transitions. Second operand 3 states. [2018-01-30 01:43:02,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:02,094 INFO L93 Difference]: Finished difference Result 1132 states and 1424 transitions. [2018-01-30 01:43:02,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:43:02,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2018-01-30 01:43:02,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:02,096 INFO L225 Difference]: With dead ends: 1132 [2018-01-30 01:43:02,096 INFO L226 Difference]: Without dead ends: 674 [2018-01-30 01:43:02,098 INFO L553 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-01-30 01:43:02,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-01-30 01:43:02,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 650. [2018-01-30 01:43:02,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2018-01-30 01:43:02,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 789 transitions. [2018-01-30 01:43:02,115 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 789 transitions. Word has length 204 [2018-01-30 01:43:02,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:02,115 INFO L432 AbstractCegarLoop]: Abstraction has 650 states and 789 transitions. [2018-01-30 01:43:02,115 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:43:02,115 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 789 transitions. [2018-01-30 01:43:02,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-01-30 01:43:02,117 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:02,117 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:02,117 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:02,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1775118663, now seen corresponding path program 1 times [2018-01-30 01:43:02,118 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:02,118 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:02,118 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:02,118 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:02,118 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:02,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:02,223 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:43:02,223 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:02,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:43:02,224 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:43:02,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:43:02,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:43:02,224 INFO L87 Difference]: Start difference. First operand 650 states and 789 transitions. Second operand 3 states. [2018-01-30 01:43:02,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:02,462 INFO L93 Difference]: Finished difference Result 1158 states and 1436 transitions. [2018-01-30 01:43:02,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:43:02,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-01-30 01:43:02,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:02,465 INFO L225 Difference]: With dead ends: 1158 [2018-01-30 01:43:02,465 INFO L226 Difference]: Without dead ends: 901 [2018-01-30 01:43:02,466 INFO L553 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-01-30 01:43:02,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2018-01-30 01:43:02,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 901. [2018-01-30 01:43:02,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-01-30 01:43:02,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1107 transitions. [2018-01-30 01:43:02,480 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1107 transitions. Word has length 211 [2018-01-30 01:43:02,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:02,481 INFO L432 AbstractCegarLoop]: Abstraction has 901 states and 1107 transitions. [2018-01-30 01:43:02,481 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:43:02,481 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1107 transitions. [2018-01-30 01:43:02,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-01-30 01:43:02,483 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:02,483 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:02,484 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:02,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1744717358, now seen corresponding path program 1 times [2018-01-30 01:43:02,484 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:02,484 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:02,485 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:02,485 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:02,485 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:02,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:02,588 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-30 01:43:02,589 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:02,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:43:02,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:43:02,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:43:02,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:43:02,590 INFO L87 Difference]: Start difference. First operand 901 states and 1107 transitions. Second operand 3 states. [2018-01-30 01:43:03,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:03,341 INFO L93 Difference]: Finished difference Result 1829 states and 2346 transitions. [2018-01-30 01:43:03,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:43:03,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-01-30 01:43:03,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:03,348 INFO L225 Difference]: With dead ends: 1829 [2018-01-30 01:43:03,348 INFO L226 Difference]: Without dead ends: 1070 [2018-01-30 01:43:03,349 INFO L553 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-01-30 01:43:03,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2018-01-30 01:43:03,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 1039. [2018-01-30 01:43:03,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1039 states. [2018-01-30 01:43:03,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1260 transitions. [2018-01-30 01:43:03,360 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1260 transitions. Word has length 230 [2018-01-30 01:43:03,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:03,361 INFO L432 AbstractCegarLoop]: Abstraction has 1039 states and 1260 transitions. [2018-01-30 01:43:03,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:43:03,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1260 transitions. [2018-01-30 01:43:03,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-01-30 01:43:03,363 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:03,363 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:03,363 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:03,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1807046094, now seen corresponding path program 1 times [2018-01-30 01:43:03,363 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:03,364 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:03,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:03,364 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:03,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:03,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:03,491 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-30 01:43:03,491 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:03,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:43:03,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:43:03,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:43:03,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:43:03,492 INFO L87 Difference]: Start difference. First operand 1039 states and 1260 transitions. Second operand 3 states. [2018-01-30 01:43:04,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:04,212 INFO L93 Difference]: Finished difference Result 2047 states and 2545 transitions. [2018-01-30 01:43:04,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:43:04,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-01-30 01:43:04,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:04,225 INFO L225 Difference]: With dead ends: 2047 [2018-01-30 01:43:04,225 INFO L226 Difference]: Without dead ends: 1150 [2018-01-30 01:43:04,226 INFO L553 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-01-30 01:43:04,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2018-01-30 01:43:04,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1120. [2018-01-30 01:43:04,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1120 states. [2018-01-30 01:43:04,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1356 transitions. [2018-01-30 01:43:04,237 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1356 transitions. Word has length 230 [2018-01-30 01:43:04,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:04,238 INFO L432 AbstractCegarLoop]: Abstraction has 1120 states and 1356 transitions. [2018-01-30 01:43:04,238 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:43:04,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1356 transitions. [2018-01-30 01:43:04,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-01-30 01:43:04,240 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:04,240 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:04,240 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:04,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1894861798, now seen corresponding path program 1 times [2018-01-30 01:43:04,240 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:04,240 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:04,241 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:04,241 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:04,241 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:04,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:04,325 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:43:04,325 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:04,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:43:04,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:43:04,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:43:04,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:43:04,326 INFO L87 Difference]: Start difference. First operand 1120 states and 1356 transitions. Second operand 3 states. [2018-01-30 01:43:04,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:04,362 INFO L93 Difference]: Finished difference Result 2971 states and 3623 transitions. [2018-01-30 01:43:04,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:43:04,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2018-01-30 01:43:04,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:04,366 INFO L225 Difference]: With dead ends: 2971 [2018-01-30 01:43:04,366 INFO L226 Difference]: Without dead ends: 1993 [2018-01-30 01:43:04,367 INFO L553 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-01-30 01:43:04,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2018-01-30 01:43:04,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1991. [2018-01-30 01:43:04,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1991 states. [2018-01-30 01:43:04,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1991 states and 2400 transitions. [2018-01-30 01:43:04,388 INFO L78 Accepts]: Start accepts. Automaton has 1991 states and 2400 transitions. Word has length 237 [2018-01-30 01:43:04,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:04,388 INFO L432 AbstractCegarLoop]: Abstraction has 1991 states and 2400 transitions. [2018-01-30 01:43:04,388 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:43:04,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 2400 transitions. [2018-01-30 01:43:04,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-01-30 01:43:04,391 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:04,391 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:04,391 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:04,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1349131347, now seen corresponding path program 1 times [2018-01-30 01:43:04,392 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:04,392 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:04,392 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:04,392 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:04,392 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:04,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:04,465 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-30 01:43:04,465 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:04,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:43:04,465 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:43:04,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:43:04,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:43:04,466 INFO L87 Difference]: Start difference. First operand 1991 states and 2400 transitions. Second operand 3 states. [2018-01-30 01:43:04,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:04,513 INFO L93 Difference]: Finished difference Result 3879 states and 4699 transitions. [2018-01-30 01:43:04,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:43:04,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 238 [2018-01-30 01:43:04,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:04,526 INFO L225 Difference]: With dead ends: 3879 [2018-01-30 01:43:04,526 INFO L226 Difference]: Without dead ends: 2030 [2018-01-30 01:43:04,528 INFO L553 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-01-30 01:43:04,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2030 states. [2018-01-30 01:43:04,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2030 to 2009. [2018-01-30 01:43:04,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2009 states. [2018-01-30 01:43:04,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2009 states to 2009 states and 2412 transitions. [2018-01-30 01:43:04,549 INFO L78 Accepts]: Start accepts. Automaton has 2009 states and 2412 transitions. Word has length 238 [2018-01-30 01:43:04,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:04,550 INFO L432 AbstractCegarLoop]: Abstraction has 2009 states and 2412 transitions. [2018-01-30 01:43:04,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:43:04,550 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 2412 transitions. [2018-01-30 01:43:04,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-01-30 01:43:04,552 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:04,552 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:04,552 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:04,552 INFO L82 PathProgramCache]: Analyzing trace with hash 598181859, now seen corresponding path program 1 times [2018-01-30 01:43:04,552 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:04,552 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:04,553 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:04,553 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:04,553 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:04,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:04,652 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:43:04,652 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:04,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:43:04,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:43:04,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:43:04,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:43:04,653 INFO L87 Difference]: Start difference. First operand 2009 states and 2412 transitions. Second operand 3 states. [2018-01-30 01:43:04,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:04,775 INFO L93 Difference]: Finished difference Result 5728 states and 6919 transitions. [2018-01-30 01:43:04,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:43:04,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2018-01-30 01:43:04,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:04,783 INFO L225 Difference]: With dead ends: 5728 [2018-01-30 01:43:04,783 INFO L226 Difference]: Without dead ends: 3861 [2018-01-30 01:43:04,786 INFO L553 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-01-30 01:43:04,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3861 states. [2018-01-30 01:43:04,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3861 to 3859. [2018-01-30 01:43:04,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3859 states. [2018-01-30 01:43:04,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3859 states to 3859 states and 4634 transitions. [2018-01-30 01:43:04,836 INFO L78 Accepts]: Start accepts. Automaton has 3859 states and 4634 transitions. Word has length 240 [2018-01-30 01:43:04,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:04,836 INFO L432 AbstractCegarLoop]: Abstraction has 3859 states and 4634 transitions. [2018-01-30 01:43:04,836 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:43:04,836 INFO L276 IsEmpty]: Start isEmpty. Operand 3859 states and 4634 transitions. [2018-01-30 01:43:04,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-01-30 01:43:04,842 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:04,842 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:04,842 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:04,842 INFO L82 PathProgramCache]: Analyzing trace with hash 2095655126, now seen corresponding path program 1 times [2018-01-30 01:43:04,842 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:04,842 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:04,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:04,843 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:04,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:04,852 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:04,941 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-30 01:43:04,941 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:04,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:43:04,942 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:43:04,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:43:04,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:43:04,942 INFO L87 Difference]: Start difference. First operand 3859 states and 4634 transitions. Second operand 3 states. [2018-01-30 01:43:05,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:05,216 INFO L93 Difference]: Finished difference Result 7570 states and 9130 transitions. [2018-01-30 01:43:05,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:43:05,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2018-01-30 01:43:05,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:05,226 INFO L225 Difference]: With dead ends: 7570 [2018-01-30 01:43:05,226 INFO L226 Difference]: Without dead ends: 5090 [2018-01-30 01:43:05,229 INFO L553 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-01-30 01:43:05,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5090 states. [2018-01-30 01:43:05,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5090 to 5090. [2018-01-30 01:43:05,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5090 states. [2018-01-30 01:43:05,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5090 states to 5090 states and 6123 transitions. [2018-01-30 01:43:05,280 INFO L78 Accepts]: Start accepts. Automaton has 5090 states and 6123 transitions. Word has length 241 [2018-01-30 01:43:05,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:05,280 INFO L432 AbstractCegarLoop]: Abstraction has 5090 states and 6123 transitions. [2018-01-30 01:43:05,280 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:43:05,280 INFO L276 IsEmpty]: Start isEmpty. Operand 5090 states and 6123 transitions. [2018-01-30 01:43:05,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-01-30 01:43:05,286 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:05,287 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:05,287 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:05,287 INFO L82 PathProgramCache]: Analyzing trace with hash -182389281, now seen corresponding path program 1 times [2018-01-30 01:43:05,287 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:05,287 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:05,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:05,287 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:05,288 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:05,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:05,385 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-01-30 01:43:05,386 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:05,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:43:05,386 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:43:05,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:43:05,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:43:05,386 INFO L87 Difference]: Start difference. First operand 5090 states and 6123 transitions. Second operand 3 states. [2018-01-30 01:43:05,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:05,634 INFO L93 Difference]: Finished difference Result 6323 states and 7621 transitions. [2018-01-30 01:43:05,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:43:05,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2018-01-30 01:43:05,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:05,649 INFO L225 Difference]: With dead ends: 6323 [2018-01-30 01:43:05,649 INFO L226 Difference]: Without dead ends: 6321 [2018-01-30 01:43:05,650 INFO L553 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-01-30 01:43:05,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6321 states. [2018-01-30 01:43:05,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6321 to 6321. [2018-01-30 01:43:05,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6321 states. [2018-01-30 01:43:05,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6321 states to 6321 states and 7616 transitions. [2018-01-30 01:43:05,703 INFO L78 Accepts]: Start accepts. Automaton has 6321 states and 7616 transitions. Word has length 277 [2018-01-30 01:43:05,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:05,703 INFO L432 AbstractCegarLoop]: Abstraction has 6321 states and 7616 transitions. [2018-01-30 01:43:05,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:43:05,703 INFO L276 IsEmpty]: Start isEmpty. Operand 6321 states and 7616 transitions. [2018-01-30 01:43:05,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-01-30 01:43:05,710 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:05,710 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:05,710 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:05,710 INFO L82 PathProgramCache]: Analyzing trace with hash -866731324, now seen corresponding path program 1 times [2018-01-30 01:43:05,710 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:05,710 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:05,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:05,711 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:05,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:05,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:05,808 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-30 01:43:05,808 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:05,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:43:05,809 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:43:05,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:43:05,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:43:05,809 INFO L87 Difference]: Start difference. First operand 6321 states and 7616 transitions. Second operand 3 states. [2018-01-30 01:43:06,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:06,424 INFO L93 Difference]: Finished difference Result 13699 states and 17023 transitions. [2018-01-30 01:43:06,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:43:06,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 323 [2018-01-30 01:43:06,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:06,440 INFO L225 Difference]: With dead ends: 13699 [2018-01-30 01:43:06,440 INFO L226 Difference]: Without dead ends: 7526 [2018-01-30 01:43:06,446 INFO L553 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-01-30 01:43:06,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7526 states. [2018-01-30 01:43:06,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7526 to 7136. [2018-01-30 01:43:06,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7136 states. [2018-01-30 01:43:06,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7136 states to 7136 states and 8521 transitions. [2018-01-30 01:43:06,512 INFO L78 Accepts]: Start accepts. Automaton has 7136 states and 8521 transitions. Word has length 323 [2018-01-30 01:43:06,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:06,513 INFO L432 AbstractCegarLoop]: Abstraction has 7136 states and 8521 transitions. [2018-01-30 01:43:06,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:43:06,513 INFO L276 IsEmpty]: Start isEmpty. Operand 7136 states and 8521 transitions. [2018-01-30 01:43:06,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-01-30 01:43:06,520 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:06,520 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:06,520 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:06,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1521976882, now seen corresponding path program 2 times [2018-01-30 01:43:06,520 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:06,520 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:06,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:06,521 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:06,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:06,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:06,811 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-01-30 01:43:06,811 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:06,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:43:06,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:43:06,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:43:06,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:43:06,812 INFO L87 Difference]: Start difference. First operand 7136 states and 8521 transitions. Second operand 5 states. [2018-01-30 01:43:07,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:07,510 INFO L93 Difference]: Finished difference Result 15348 states and 18272 transitions. [2018-01-30 01:43:07,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:43:07,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 326 [2018-01-30 01:43:07,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:07,519 INFO L225 Difference]: With dead ends: 15348 [2018-01-30 01:43:07,519 INFO L226 Difference]: Without dead ends: 8360 [2018-01-30 01:43:07,526 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:43:07,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8360 states. [2018-01-30 01:43:07,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8360 to 7227. [2018-01-30 01:43:07,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7227 states. [2018-01-30 01:43:07,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7227 states to 7227 states and 8632 transitions. [2018-01-30 01:43:07,592 INFO L78 Accepts]: Start accepts. Automaton has 7227 states and 8632 transitions. Word has length 326 [2018-01-30 01:43:07,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:07,592 INFO L432 AbstractCegarLoop]: Abstraction has 7227 states and 8632 transitions. [2018-01-30 01:43:07,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:43:07,593 INFO L276 IsEmpty]: Start isEmpty. Operand 7227 states and 8632 transitions. [2018-01-30 01:43:07,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-01-30 01:43:07,600 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:07,600 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:07,600 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:07,600 INFO L82 PathProgramCache]: Analyzing trace with hash 153901823, now seen corresponding path program 1 times [2018-01-30 01:43:07,600 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:07,600 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:07,601 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:07,601 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:43:07,601 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:07,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:07,610 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:07,823 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-01-30 01:43:07,823 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:07,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 01:43:07,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:43:07,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:43:07,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:43:07,824 INFO L87 Difference]: Start difference. First operand 7227 states and 8632 transitions. Second operand 6 states. [2018-01-30 01:43:08,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:08,019 INFO L93 Difference]: Finished difference Result 15634 states and 19193 transitions. [2018-01-30 01:43:08,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:43:08,019 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 327 [2018-01-30 01:43:08,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:08,034 INFO L225 Difference]: With dead ends: 15634 [2018-01-30 01:43:08,035 INFO L226 Difference]: Without dead ends: 8315 [2018-01-30 01:43:08,042 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-30 01:43:08,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8315 states. [2018-01-30 01:43:08,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8315 to 8142. [2018-01-30 01:43:08,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8142 states. [2018-01-30 01:43:08,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8142 states to 8142 states and 9667 transitions. [2018-01-30 01:43:08,117 INFO L78 Accepts]: Start accepts. Automaton has 8142 states and 9667 transitions. Word has length 327 [2018-01-30 01:43:08,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:08,117 INFO L432 AbstractCegarLoop]: Abstraction has 8142 states and 9667 transitions. [2018-01-30 01:43:08,117 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:43:08,117 INFO L276 IsEmpty]: Start isEmpty. Operand 8142 states and 9667 transitions. [2018-01-30 01:43:08,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-01-30 01:43:08,125 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:08,126 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:08,126 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:08,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1758656920, now seen corresponding path program 3 times [2018-01-30 01:43:08,126 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:08,126 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:08,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:08,126 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:08,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:08,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:08,252 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-30 01:43:08,252 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:08,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:43:08,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:43:08,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:43:08,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:43:08,253 INFO L87 Difference]: Start difference. First operand 8142 states and 9667 transitions. Second operand 5 states. [2018-01-30 01:43:08,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:08,396 INFO L93 Difference]: Finished difference Result 17222 states and 20430 transitions. [2018-01-30 01:43:08,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:43:08,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 329 [2018-01-30 01:43:08,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:08,405 INFO L225 Difference]: With dead ends: 17222 [2018-01-30 01:43:08,405 INFO L226 Difference]: Without dead ends: 9228 [2018-01-30 01:43:08,413 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:43:08,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9228 states. [2018-01-30 01:43:08,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9228 to 8229. [2018-01-30 01:43:08,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8229 states. [2018-01-30 01:43:08,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 9780 transitions. [2018-01-30 01:43:08,493 INFO L78 Accepts]: Start accepts. Automaton has 8229 states and 9780 transitions. Word has length 329 [2018-01-30 01:43:08,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:08,494 INFO L432 AbstractCegarLoop]: Abstraction has 8229 states and 9780 transitions. [2018-01-30 01:43:08,494 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:43:08,494 INFO L276 IsEmpty]: Start isEmpty. Operand 8229 states and 9780 transitions. [2018-01-30 01:43:08,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-01-30 01:43:08,502 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:08,503 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:08,503 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:08,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1264633666, now seen corresponding path program 1 times [2018-01-30 01:43:08,503 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:08,503 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:08,503 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:08,504 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:43:08,504 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:08,512 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:08,674 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-01-30 01:43:08,674 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:08,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:43:08,674 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:43:08,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:43:08,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:43:08,675 INFO L87 Difference]: Start difference. First operand 8229 states and 9780 transitions. Second operand 4 states. [2018-01-30 01:43:09,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:09,073 INFO L93 Difference]: Finished difference Result 26543 states and 32636 transitions. [2018-01-30 01:43:09,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 01:43:09,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 330 [2018-01-30 01:43:09,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:09,092 INFO L225 Difference]: With dead ends: 26543 [2018-01-30 01:43:09,092 INFO L226 Difference]: Without dead ends: 17982 [2018-01-30 01:43:09,102 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-01-30 01:43:09,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17982 states. [2018-01-30 01:43:09,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17982 to 8664. [2018-01-30 01:43:09,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8664 states. [2018-01-30 01:43:09,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8664 states to 8664 states and 10425 transitions. [2018-01-30 01:43:09,237 INFO L78 Accepts]: Start accepts. Automaton has 8664 states and 10425 transitions. Word has length 330 [2018-01-30 01:43:09,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:09,237 INFO L432 AbstractCegarLoop]: Abstraction has 8664 states and 10425 transitions. [2018-01-30 01:43:09,237 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:43:09,237 INFO L276 IsEmpty]: Start isEmpty. Operand 8664 states and 10425 transitions. [2018-01-30 01:43:09,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-01-30 01:43:09,244 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:09,244 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:09,244 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:09,245 INFO L82 PathProgramCache]: Analyzing trace with hash 524612648, now seen corresponding path program 1 times [2018-01-30 01:43:09,245 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:09,245 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:09,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:09,246 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:09,246 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:09,254 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:09,470 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-01-30 01:43:09,471 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:09,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:43:09,471 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:43:09,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:43:09,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:43:09,471 INFO L87 Difference]: Start difference. First operand 8664 states and 10425 transitions. Second operand 4 states. [2018-01-30 01:43:09,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:09,893 INFO L93 Difference]: Finished difference Result 26036 states and 31507 transitions. [2018-01-30 01:43:09,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 01:43:09,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 332 [2018-01-30 01:43:09,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:09,905 INFO L225 Difference]: With dead ends: 26036 [2018-01-30 01:43:09,905 INFO L226 Difference]: Without dead ends: 17520 [2018-01-30 01:43:09,914 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-01-30 01:43:09,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17520 states. [2018-01-30 01:43:10,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17520 to 8679. [2018-01-30 01:43:10,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8679 states. [2018-01-30 01:43:10,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8679 states to 8679 states and 10440 transitions. [2018-01-30 01:43:10,050 INFO L78 Accepts]: Start accepts. Automaton has 8679 states and 10440 transitions. Word has length 332 [2018-01-30 01:43:10,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:10,051 INFO L432 AbstractCegarLoop]: Abstraction has 8679 states and 10440 transitions. [2018-01-30 01:43:10,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:43:10,051 INFO L276 IsEmpty]: Start isEmpty. Operand 8679 states and 10440 transitions. [2018-01-30 01:43:10,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-01-30 01:43:10,056 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:10,056 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:10,056 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:10,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1680076241, now seen corresponding path program 1 times [2018-01-30 01:43:10,057 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:10,057 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:10,057 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:10,057 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:10,057 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:10,064 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:10,159 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-01-30 01:43:10,159 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:10,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:43:10,159 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:43:10,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:43:10,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:43:10,160 INFO L87 Difference]: Start difference. First operand 8679 states and 10440 transitions. Second operand 3 states. [2018-01-30 01:43:10,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:10,885 INFO L93 Difference]: Finished difference Result 18587 states and 22862 transitions. [2018-01-30 01:43:10,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:43:10,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 348 [2018-01-30 01:43:10,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:10,890 INFO L225 Difference]: With dead ends: 18587 [2018-01-30 01:43:10,891 INFO L226 Difference]: Without dead ends: 10036 [2018-01-30 01:43:10,898 INFO L553 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-01-30 01:43:10,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10036 states. [2018-01-30 01:43:11,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10036 to 9694. [2018-01-30 01:43:11,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9694 states. [2018-01-30 01:43:11,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9694 states to 9694 states and 12020 transitions. [2018-01-30 01:43:11,017 INFO L78 Accepts]: Start accepts. Automaton has 9694 states and 12020 transitions. Word has length 348 [2018-01-30 01:43:11,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:11,017 INFO L432 AbstractCegarLoop]: Abstraction has 9694 states and 12020 transitions. [2018-01-30 01:43:11,017 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:43:11,017 INFO L276 IsEmpty]: Start isEmpty. Operand 9694 states and 12020 transitions. [2018-01-30 01:43:11,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-01-30 01:43:11,023 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:11,023 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:11,023 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:11,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1658816530, now seen corresponding path program 1 times [2018-01-30 01:43:11,023 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:11,023 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:11,024 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:11,024 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:11,024 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:11,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:11,127 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-01-30 01:43:11,127 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:11,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:43:11,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:43:11,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:43:11,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:43:11,128 INFO L87 Difference]: Start difference. First operand 9694 states and 12020 transitions. Second operand 3 states. [2018-01-30 01:43:11,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:11,309 INFO L93 Difference]: Finished difference Result 19685 states and 24421 transitions. [2018-01-30 01:43:11,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:43:11,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 356 [2018-01-30 01:43:11,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:11,315 INFO L225 Difference]: With dead ends: 19685 [2018-01-30 01:43:11,315 INFO L226 Difference]: Without dead ends: 10139 [2018-01-30 01:43:11,321 INFO L553 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-01-30 01:43:11,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10139 states. [2018-01-30 01:43:11,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10139 to 9989. [2018-01-30 01:43:11,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9989 states. [2018-01-30 01:43:11,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9989 states to 9989 states and 12345 transitions. [2018-01-30 01:43:11,491 INFO L78 Accepts]: Start accepts. Automaton has 9989 states and 12345 transitions. Word has length 356 [2018-01-30 01:43:11,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:11,491 INFO L432 AbstractCegarLoop]: Abstraction has 9989 states and 12345 transitions. [2018-01-30 01:43:11,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:43:11,491 INFO L276 IsEmpty]: Start isEmpty. Operand 9989 states and 12345 transitions. [2018-01-30 01:43:11,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-01-30 01:43:11,497 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:11,497 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:11,497 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:11,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1982024604, now seen corresponding path program 1 times [2018-01-30 01:43:11,497 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:11,497 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:11,498 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:11,498 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:11,498 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:11,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:11,662 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-01-30 01:43:11,662 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:11,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:43:11,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:43:11,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:43:11,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:43:11,663 INFO L87 Difference]: Start difference. First operand 9989 states and 12345 transitions. Second operand 4 states. [2018-01-30 01:43:13,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:13,027 INFO L93 Difference]: Finished difference Result 30045 states and 37263 transitions. [2018-01-30 01:43:13,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 01:43:13,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 359 [2018-01-30 01:43:13,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:13,040 INFO L225 Difference]: With dead ends: 30045 [2018-01-30 01:43:13,040 INFO L226 Difference]: Without dead ends: 20199 [2018-01-30 01:43:13,048 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-01-30 01:43:13,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20199 states. [2018-01-30 01:43:13,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20199 to 9824. [2018-01-30 01:43:13,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9824 states. [2018-01-30 01:43:13,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9824 states to 9824 states and 12165 transitions. [2018-01-30 01:43:13,266 INFO L78 Accepts]: Start accepts. Automaton has 9824 states and 12165 transitions. Word has length 359 [2018-01-30 01:43:13,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:13,266 INFO L432 AbstractCegarLoop]: Abstraction has 9824 states and 12165 transitions. [2018-01-30 01:43:13,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:43:13,266 INFO L276 IsEmpty]: Start isEmpty. Operand 9824 states and 12165 transitions. [2018-01-30 01:43:13,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-01-30 01:43:13,271 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:13,272 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:13,272 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:13,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1291706511, now seen corresponding path program 1 times [2018-01-30 01:43:13,272 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:13,272 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:13,272 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:13,273 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:13,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:13,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:13,578 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-01-30 01:43:13,578 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:13,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:43:13,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:43:13,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:43:13,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:43:13,579 INFO L87 Difference]: Start difference. First operand 9824 states and 12165 transitions. Second operand 5 states. [2018-01-30 01:43:14,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:14,394 INFO L93 Difference]: Finished difference Result 20297 states and 25045 transitions. [2018-01-30 01:43:14,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:43:14,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 383 [2018-01-30 01:43:14,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:14,402 INFO L225 Difference]: With dead ends: 20297 [2018-01-30 01:43:14,402 INFO L226 Difference]: Without dead ends: 10621 [2018-01-30 01:43:14,409 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:43:14,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10621 states. [2018-01-30 01:43:14,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10621 to 9920. [2018-01-30 01:43:14,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9920 states. [2018-01-30 01:43:14,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9920 states to 9920 states and 12279 transitions. [2018-01-30 01:43:14,555 INFO L78 Accepts]: Start accepts. Automaton has 9920 states and 12279 transitions. Word has length 383 [2018-01-30 01:43:14,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:14,556 INFO L432 AbstractCegarLoop]: Abstraction has 9920 states and 12279 transitions. [2018-01-30 01:43:14,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:43:14,556 INFO L276 IsEmpty]: Start isEmpty. Operand 9920 states and 12279 transitions. [2018-01-30 01:43:14,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-01-30 01:43:14,561 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:14,561 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:14,561 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:14,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1707805232, now seen corresponding path program 1 times [2018-01-30 01:43:14,562 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:14,562 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:14,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:14,562 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:14,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:14,570 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:14,796 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-01-30 01:43:14,796 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:14,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:43:14,797 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:43:14,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:43:14,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:43:14,797 INFO L87 Difference]: Start difference. First operand 9920 states and 12279 transitions. Second operand 4 states. [2018-01-30 01:43:15,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:15,399 INFO L93 Difference]: Finished difference Result 29840 states and 36929 transitions. [2018-01-30 01:43:15,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 01:43:15,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 384 [2018-01-30 01:43:15,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:15,412 INFO L225 Difference]: With dead ends: 29840 [2018-01-30 01:43:15,412 INFO L226 Difference]: Without dead ends: 19988 [2018-01-30 01:43:15,421 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:43:15,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19988 states. [2018-01-30 01:43:15,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19988 to 9880. [2018-01-30 01:43:15,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9880 states. [2018-01-30 01:43:15,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9880 states to 9880 states and 12199 transitions. [2018-01-30 01:43:15,614 INFO L78 Accepts]: Start accepts. Automaton has 9880 states and 12199 transitions. Word has length 384 [2018-01-30 01:43:15,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:15,615 INFO L432 AbstractCegarLoop]: Abstraction has 9880 states and 12199 transitions. [2018-01-30 01:43:15,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:43:15,615 INFO L276 IsEmpty]: Start isEmpty. Operand 9880 states and 12199 transitions. [2018-01-30 01:43:15,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2018-01-30 01:43:15,621 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:15,621 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:15,621 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:15,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1155728757, now seen corresponding path program 1 times [2018-01-30 01:43:15,621 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:15,621 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:15,622 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:15,622 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:15,622 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:15,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:15,842 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2018-01-30 01:43:15,842 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:15,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:43:15,842 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:43:15,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:43:15,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:43:15,843 INFO L87 Difference]: Start difference. First operand 9880 states and 12199 transitions. Second operand 3 states. [2018-01-30 01:43:16,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:16,005 INFO L93 Difference]: Finished difference Result 14350 states and 17668 transitions. [2018-01-30 01:43:16,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:43:16,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 415 [2018-01-30 01:43:16,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:16,013 INFO L225 Difference]: With dead ends: 14350 [2018-01-30 01:43:16,013 INFO L226 Difference]: Without dead ends: 10020 [2018-01-30 01:43:16,017 INFO L553 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-01-30 01:43:16,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10020 states. [2018-01-30 01:43:16,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10020 to 10018. [2018-01-30 01:43:16,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10018 states. [2018-01-30 01:43:16,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10018 states to 10018 states and 12243 transitions. [2018-01-30 01:43:16,190 INFO L78 Accepts]: Start accepts. Automaton has 10018 states and 12243 transitions. Word has length 415 [2018-01-30 01:43:16,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:16,191 INFO L432 AbstractCegarLoop]: Abstraction has 10018 states and 12243 transitions. [2018-01-30 01:43:16,191 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:43:16,191 INFO L276 IsEmpty]: Start isEmpty. Operand 10018 states and 12243 transitions. [2018-01-30 01:43:16,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-01-30 01:43:16,197 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:16,197 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:16,197 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:16,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1480626410, now seen corresponding path program 1 times [2018-01-30 01:43:16,197 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:16,197 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:16,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:16,198 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:16,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:16,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:16,339 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2018-01-30 01:43:16,339 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:16,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:43:16,340 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:43:16,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:43:16,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:43:16,340 INFO L87 Difference]: Start difference. First operand 10018 states and 12243 transitions. Second operand 3 states. [2018-01-30 01:43:16,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:16,642 INFO L93 Difference]: Finished difference Result 16650 states and 20379 transitions. [2018-01-30 01:43:16,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:43:16,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2018-01-30 01:43:16,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:16,649 INFO L225 Difference]: With dead ends: 16650 [2018-01-30 01:43:16,649 INFO L226 Difference]: Without dead ends: 11975 [2018-01-30 01:43:16,652 INFO L553 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-01-30 01:43:16,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11975 states. [2018-01-30 01:43:16,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11975 to 11973. [2018-01-30 01:43:16,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11973 states. [2018-01-30 01:43:16,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11973 states to 11973 states and 14604 transitions. [2018-01-30 01:43:16,855 INFO L78 Accepts]: Start accepts. Automaton has 11973 states and 14604 transitions. Word has length 418 [2018-01-30 01:43:16,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:16,855 INFO L432 AbstractCegarLoop]: Abstraction has 11973 states and 14604 transitions. [2018-01-30 01:43:16,855 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:43:16,855 INFO L276 IsEmpty]: Start isEmpty. Operand 11973 states and 14604 transitions. [2018-01-30 01:43:16,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-01-30 01:43:16,861 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:16,862 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:16,862 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:16,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1952970341, now seen corresponding path program 1 times [2018-01-30 01:43:16,862 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:16,862 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:16,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:16,862 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:16,863 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:16,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:17,024 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 315 proven. 52 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2018-01-30 01:43:17,024 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:43:17,024 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:43:17,029 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:17,091 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:43:17,261 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-01-30 01:43:17,279 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 01:43:17,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-01-30 01:43:17,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:43:17,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:43:17,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:43:17,280 INFO L87 Difference]: Start difference. First operand 11973 states and 14604 transitions. Second operand 6 states. [2018-01-30 01:43:19,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:19,719 INFO L93 Difference]: Finished difference Result 36868 states and 45258 transitions. [2018-01-30 01:43:19,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 01:43:19,720 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 419 [2018-01-30 01:43:19,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:19,747 INFO L225 Difference]: With dead ends: 36868 [2018-01-30 01:43:19,747 INFO L226 Difference]: Without dead ends: 24956 [2018-01-30 01:43:19,762 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-01-30 01:43:19,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24956 states. [2018-01-30 01:43:20,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24956 to 16489. [2018-01-30 01:43:20,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16489 states. [2018-01-30 01:43:20,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16489 states to 16489 states and 20128 transitions. [2018-01-30 01:43:20,153 INFO L78 Accepts]: Start accepts. Automaton has 16489 states and 20128 transitions. Word has length 419 [2018-01-30 01:43:20,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:20,154 INFO L432 AbstractCegarLoop]: Abstraction has 16489 states and 20128 transitions. [2018-01-30 01:43:20,154 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:43:20,154 INFO L276 IsEmpty]: Start isEmpty. Operand 16489 states and 20128 transitions. [2018-01-30 01:43:20,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2018-01-30 01:43:20,172 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:20,172 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:20,172 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:20,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1632982741, now seen corresponding path program 1 times [2018-01-30 01:43:20,172 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:20,172 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:20,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:20,173 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:20,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:20,184 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:20,353 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 460 proven. 17 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-01-30 01:43:20,353 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:43:20,353 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-01-30 01:43:20,366 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:20,409 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:43:20,856 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 460 proven. 17 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-01-30 01:43:20,873 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:43:20,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-01-30 01:43:20,874 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:43:20,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:43:20,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:43:20,874 INFO L87 Difference]: Start difference. First operand 16489 states and 20128 transitions. Second operand 4 states. [2018-01-30 01:43:21,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:21,878 INFO L93 Difference]: Finished difference Result 45249 states and 55925 transitions. [2018-01-30 01:43:21,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 01:43:21,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 426 [2018-01-30 01:43:21,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:21,916 INFO L225 Difference]: With dead ends: 45249 [2018-01-30 01:43:21,916 INFO L226 Difference]: Without dead ends: 29067 [2018-01-30 01:43:21,933 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 428 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:43:21,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29067 states. [2018-01-30 01:43:22,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29067 to 25509. [2018-01-30 01:43:22,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25509 states. [2018-01-30 01:43:22,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25509 states to 25509 states and 30867 transitions. [2018-01-30 01:43:22,447 INFO L78 Accepts]: Start accepts. Automaton has 25509 states and 30867 transitions. Word has length 426 [2018-01-30 01:43:22,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:22,447 INFO L432 AbstractCegarLoop]: Abstraction has 25509 states and 30867 transitions. [2018-01-30 01:43:22,447 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:43:22,447 INFO L276 IsEmpty]: Start isEmpty. Operand 25509 states and 30867 transitions. [2018-01-30 01:43:22,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2018-01-30 01:43:22,465 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:22,465 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:22,465 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:22,465 INFO L82 PathProgramCache]: Analyzing trace with hash -162267339, now seen corresponding path program 1 times [2018-01-30 01:43:22,465 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:22,465 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:22,466 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:22,466 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:22,466 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:22,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:22,631 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2018-01-30 01:43:22,631 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:22,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:43:22,632 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:43:22,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:43:22,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:43:22,633 INFO L87 Difference]: Start difference. First operand 25509 states and 30867 transitions. Second operand 3 states. [2018-01-30 01:43:23,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:23,365 INFO L93 Difference]: Finished difference Result 64538 states and 78054 transitions. [2018-01-30 01:43:23,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:43:23,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 426 [2018-01-30 01:43:23,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:23,397 INFO L225 Difference]: With dead ends: 64538 [2018-01-30 01:43:23,397 INFO L226 Difference]: Without dead ends: 39336 [2018-01-30 01:43:23,419 INFO L553 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-01-30 01:43:23,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39336 states. [2018-01-30 01:43:24,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39336 to 38370. [2018-01-30 01:43:24,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38370 states. [2018-01-30 01:43:24,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38370 states to 38370 states and 46338 transitions. [2018-01-30 01:43:24,279 INFO L78 Accepts]: Start accepts. Automaton has 38370 states and 46338 transitions. Word has length 426 [2018-01-30 01:43:24,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:24,280 INFO L432 AbstractCegarLoop]: Abstraction has 38370 states and 46338 transitions. [2018-01-30 01:43:24,280 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:43:24,280 INFO L276 IsEmpty]: Start isEmpty. Operand 38370 states and 46338 transitions. [2018-01-30 01:43:24,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2018-01-30 01:43:24,300 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:24,300 INFO L350 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:24,301 INFO L371 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:24,301 INFO L82 PathProgramCache]: Analyzing trace with hash -306023011, now seen corresponding path program 1 times [2018-01-30 01:43:24,301 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:24,301 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:24,301 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:24,301 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:24,301 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:24,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:24,416 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 414 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-01-30 01:43:24,416 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:24,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:43:24,416 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:43:24,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:43:24,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:43:24,416 INFO L87 Difference]: Start difference. First operand 38370 states and 46338 transitions. Second operand 3 states. [2018-01-30 01:43:25,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:25,373 INFO L93 Difference]: Finished difference Result 76227 states and 92667 transitions. [2018-01-30 01:43:25,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:43:25,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 442 [2018-01-30 01:43:25,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:25,416 INFO L225 Difference]: With dead ends: 76227 [2018-01-30 01:43:25,416 INFO L226 Difference]: Without dead ends: 43741 [2018-01-30 01:43:25,442 INFO L553 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-01-30 01:43:25,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43741 states. [2018-01-30 01:43:26,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43741 to 40094. [2018-01-30 01:43:26,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40094 states. [2018-01-30 01:43:26,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40094 states to 40094 states and 47751 transitions. [2018-01-30 01:43:26,872 INFO L78 Accepts]: Start accepts. Automaton has 40094 states and 47751 transitions. Word has length 442 [2018-01-30 01:43:26,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:26,872 INFO L432 AbstractCegarLoop]: Abstraction has 40094 states and 47751 transitions. [2018-01-30 01:43:26,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:43:26,872 INFO L276 IsEmpty]: Start isEmpty. Operand 40094 states and 47751 transitions. [2018-01-30 01:43:26,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2018-01-30 01:43:26,892 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:26,892 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:26,892 INFO L371 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:26,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1609625685, now seen corresponding path program 1 times [2018-01-30 01:43:26,893 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:26,893 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:26,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:26,893 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:26,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:26,901 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:27,068 INFO L134 CoverageAnalysis]: Checked inductivity of 629 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2018-01-30 01:43:27,068 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:27,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:43:27,069 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:43:27,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:43:27,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:43:27,069 INFO L87 Difference]: Start difference. First operand 40094 states and 47751 transitions. Second operand 4 states. [2018-01-30 01:43:28,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:28,158 INFO L93 Difference]: Finished difference Result 66955 states and 80919 transitions. [2018-01-30 01:43:28,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 01:43:28,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 451 [2018-01-30 01:43:28,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:28,199 INFO L225 Difference]: With dead ends: 66955 [2018-01-30 01:43:28,199 INFO L226 Difference]: Without dead ends: 54471 [2018-01-30 01:43:28,215 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:43:28,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54471 states. [2018-01-30 01:43:29,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54471 to 39950. [2018-01-30 01:43:29,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39950 states. [2018-01-30 01:43:29,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39950 states to 39950 states and 47523 transitions. [2018-01-30 01:43:29,078 INFO L78 Accepts]: Start accepts. Automaton has 39950 states and 47523 transitions. Word has length 451 [2018-01-30 01:43:29,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:29,078 INFO L432 AbstractCegarLoop]: Abstraction has 39950 states and 47523 transitions. [2018-01-30 01:43:29,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:43:29,079 INFO L276 IsEmpty]: Start isEmpty. Operand 39950 states and 47523 transitions. [2018-01-30 01:43:29,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2018-01-30 01:43:29,098 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:29,098 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:29,099 INFO L371 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:29,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1440560973, now seen corresponding path program 1 times [2018-01-30 01:43:29,099 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:29,099 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:29,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:29,099 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:29,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:29,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:29,438 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 515 proven. 21 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-01-30 01:43:29,438 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:43:29,438 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:43:29,445 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:29,496 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:43:29,597 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 483 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-01-30 01:43:29,614 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 01:43:29,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-01-30 01:43:29,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:43:29,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:43:29,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:43:29,615 INFO L87 Difference]: Start difference. First operand 39950 states and 47523 transitions. Second operand 5 states. [2018-01-30 01:43:30,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:30,668 INFO L93 Difference]: Finished difference Result 76567 states and 91482 transitions. [2018-01-30 01:43:30,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 01:43:30,669 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 452 [2018-01-30 01:43:30,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:30,689 INFO L225 Difference]: With dead ends: 76567 [2018-01-30 01:43:30,689 INFO L226 Difference]: Without dead ends: 18125 [2018-01-30 01:43:30,717 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-30 01:43:30,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18125 states. [2018-01-30 01:43:31,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18125 to 17176. [2018-01-30 01:43:31,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17176 states. [2018-01-30 01:43:31,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17176 states to 17176 states and 21264 transitions. [2018-01-30 01:43:31,104 INFO L78 Accepts]: Start accepts. Automaton has 17176 states and 21264 transitions. Word has length 452 [2018-01-30 01:43:31,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:31,104 INFO L432 AbstractCegarLoop]: Abstraction has 17176 states and 21264 transitions. [2018-01-30 01:43:31,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:43:31,104 INFO L276 IsEmpty]: Start isEmpty. Operand 17176 states and 21264 transitions. [2018-01-30 01:43:31,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2018-01-30 01:43:31,113 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:31,114 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:31,114 INFO L371 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:31,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1501273371, now seen corresponding path program 2 times [2018-01-30 01:43:31,114 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:31,114 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:31,115 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:31,115 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:31,115 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:31,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:31,697 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 486 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2018-01-30 01:43:31,697 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:31,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:43:31,698 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:43:31,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:43:31,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:43:31,698 INFO L87 Difference]: Start difference. First operand 17176 states and 21264 transitions. Second operand 5 states. [2018-01-30 01:43:32,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:32,128 INFO L93 Difference]: Finished difference Result 30210 states and 37112 transitions. [2018-01-30 01:43:32,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:43:32,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 455 [2018-01-30 01:43:32,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:32,139 INFO L225 Difference]: With dead ends: 30210 [2018-01-30 01:43:32,139 INFO L226 Difference]: Without dead ends: 18294 [2018-01-30 01:43:32,148 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:43:32,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18294 states. [2018-01-30 01:43:32,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18294 to 17176. [2018-01-30 01:43:32,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17176 states. [2018-01-30 01:43:32,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17176 states to 17176 states and 21254 transitions. [2018-01-30 01:43:32,534 INFO L78 Accepts]: Start accepts. Automaton has 17176 states and 21254 transitions. Word has length 455 [2018-01-30 01:43:32,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:32,534 INFO L432 AbstractCegarLoop]: Abstraction has 17176 states and 21254 transitions. [2018-01-30 01:43:32,534 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:43:32,534 INFO L276 IsEmpty]: Start isEmpty. Operand 17176 states and 21254 transitions. [2018-01-30 01:43:32,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2018-01-30 01:43:32,544 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:32,544 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:32,544 INFO L371 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:32,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1600851213, now seen corresponding path program 1 times [2018-01-30 01:43:32,544 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:32,544 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:32,545 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:32,545 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:43:32,545 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:32,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:32,833 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 546 proven. 24 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-01-30 01:43:32,833 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:43:32,833 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-01-30 01:43:32,845 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:32,889 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:43:32,965 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 546 proven. 24 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-01-30 01:43:32,982 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:43:32,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-30 01:43:32,983 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:43:32,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:43:32,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:43:32,983 INFO L87 Difference]: Start difference. First operand 17176 states and 21254 transitions. Second operand 5 states. [2018-01-30 01:43:33,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:33,832 INFO L93 Difference]: Finished difference Result 39282 states and 48334 transitions. [2018-01-30 01:43:33,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 01:43:33,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 458 [2018-01-30 01:43:33,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:33,846 INFO L225 Difference]: With dead ends: 39282 [2018-01-30 01:43:33,846 INFO L226 Difference]: Without dead ends: 22256 [2018-01-30 01:43:33,859 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 464 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-30 01:43:33,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22256 states. [2018-01-30 01:43:34,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22256 to 16392. [2018-01-30 01:43:34,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16392 states. [2018-01-30 01:43:34,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16392 states to 16392 states and 19877 transitions. [2018-01-30 01:43:34,246 INFO L78 Accepts]: Start accepts. Automaton has 16392 states and 19877 transitions. Word has length 458 [2018-01-30 01:43:34,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:34,246 INFO L432 AbstractCegarLoop]: Abstraction has 16392 states and 19877 transitions. [2018-01-30 01:43:34,246 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:43:34,246 INFO L276 IsEmpty]: Start isEmpty. Operand 16392 states and 19877 transitions. [2018-01-30 01:43:34,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2018-01-30 01:43:34,254 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:34,254 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:34,254 INFO L371 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:34,255 INFO L82 PathProgramCache]: Analyzing trace with hash -3119123, now seen corresponding path program 1 times [2018-01-30 01:43:34,255 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:34,255 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:34,255 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:34,255 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:34,255 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:34,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:34,385 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2018-01-30 01:43:34,385 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:34,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:43:34,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:43:34,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:43:34,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:43:34,386 INFO L87 Difference]: Start difference. First operand 16392 states and 19877 transitions. Second operand 4 states. [2018-01-30 01:43:35,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:35,059 INFO L93 Difference]: Finished difference Result 36394 states and 44008 transitions. [2018-01-30 01:43:35,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 01:43:35,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 458 [2018-01-30 01:43:35,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:35,079 INFO L225 Difference]: With dead ends: 36394 [2018-01-30 01:43:35,079 INFO L226 Difference]: Without dead ends: 29247 [2018-01-30 01:43:35,089 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:43:35,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29247 states. [2018-01-30 01:43:35,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29247 to 16665. [2018-01-30 01:43:35,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16665 states. [2018-01-30 01:43:35,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16665 states to 16665 states and 20267 transitions. [2018-01-30 01:43:35,595 INFO L78 Accepts]: Start accepts. Automaton has 16665 states and 20267 transitions. Word has length 458 [2018-01-30 01:43:35,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:35,595 INFO L432 AbstractCegarLoop]: Abstraction has 16665 states and 20267 transitions. [2018-01-30 01:43:35,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:43:35,595 INFO L276 IsEmpty]: Start isEmpty. Operand 16665 states and 20267 transitions. [2018-01-30 01:43:35,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2018-01-30 01:43:35,604 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:35,604 INFO L350 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:35,604 INFO L371 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:35,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1652800164, now seen corresponding path program 1 times [2018-01-30 01:43:35,605 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:35,605 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:35,605 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:35,605 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:35,605 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:35,615 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:35,738 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 370 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2018-01-30 01:43:35,739 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:35,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:43:35,739 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:43:35,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:43:35,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:43:35,739 INFO L87 Difference]: Start difference. First operand 16665 states and 20267 transitions. Second operand 3 states. [2018-01-30 01:43:36,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:36,174 INFO L93 Difference]: Finished difference Result 33205 states and 40404 transitions. [2018-01-30 01:43:36,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:43:36,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 486 [2018-01-30 01:43:36,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:36,186 INFO L225 Difference]: With dead ends: 33205 [2018-01-30 01:43:36,186 INFO L226 Difference]: Without dead ends: 16690 [2018-01-30 01:43:36,197 INFO L553 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-01-30 01:43:36,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16690 states. [2018-01-30 01:43:36,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16690 to 16665. [2018-01-30 01:43:36,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16665 states. [2018-01-30 01:43:36,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16665 states to 16665 states and 20242 transitions. [2018-01-30 01:43:36,580 INFO L78 Accepts]: Start accepts. Automaton has 16665 states and 20242 transitions. Word has length 486 [2018-01-30 01:43:36,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:36,581 INFO L432 AbstractCegarLoop]: Abstraction has 16665 states and 20242 transitions. [2018-01-30 01:43:36,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:43:36,581 INFO L276 IsEmpty]: Start isEmpty. Operand 16665 states and 20242 transitions. [2018-01-30 01:43:36,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2018-01-30 01:43:36,589 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:36,589 INFO L350 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:36,589 INFO L371 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:36,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1968023500, now seen corresponding path program 1 times [2018-01-30 01:43:36,589 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:36,589 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:36,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:36,590 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:36,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:36,599 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:36,849 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 604 trivial. 0 not checked. [2018-01-30 01:43:36,849 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:36,849 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:43:36,849 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:43:36,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:43:36,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:43:36,849 INFO L87 Difference]: Start difference. First operand 16665 states and 20242 transitions. Second operand 5 states. [2018-01-30 01:43:37,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:37,395 INFO L93 Difference]: Finished difference Result 25980 states and 31446 transitions. [2018-01-30 01:43:37,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:43:37,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 489 [2018-01-30 01:43:37,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:37,469 INFO L225 Difference]: With dead ends: 25980 [2018-01-30 01:43:37,469 INFO L226 Difference]: Without dead ends: 18637 [2018-01-30 01:43:37,472 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:43:37,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18637 states. [2018-01-30 01:43:37,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18637 to 16904. [2018-01-30 01:43:37,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16904 states. [2018-01-30 01:43:37,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16904 states to 16904 states and 20508 transitions. [2018-01-30 01:43:37,871 INFO L78 Accepts]: Start accepts. Automaton has 16904 states and 20508 transitions. Word has length 489 [2018-01-30 01:43:37,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:37,871 INFO L432 AbstractCegarLoop]: Abstraction has 16904 states and 20508 transitions. [2018-01-30 01:43:37,871 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:43:37,871 INFO L276 IsEmpty]: Start isEmpty. Operand 16904 states and 20508 transitions. [2018-01-30 01:43:37,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2018-01-30 01:43:37,880 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:37,880 INFO L350 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:37,880 INFO L371 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:37,880 INFO L82 PathProgramCache]: Analyzing trace with hash -587989152, now seen corresponding path program 1 times [2018-01-30 01:43:37,880 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:37,881 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:37,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:37,881 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:37,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:37,889 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:38,138 INFO L134 CoverageAnalysis]: Checked inductivity of 928 backedges. 574 proven. 22 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2018-01-30 01:43:38,138 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:43:38,138 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:43:38,143 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:38,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:38,185 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:43:38,272 INFO L134 CoverageAnalysis]: Checked inductivity of 928 backedges. 442 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2018-01-30 01:43:38,289 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 01:43:38,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-01-30 01:43:38,290 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 01:43:38,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 01:43:38,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-30 01:43:38,290 INFO L87 Difference]: Start difference. First operand 16904 states and 20508 transitions. Second operand 7 states. [2018-01-30 01:43:39,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:39,525 INFO L93 Difference]: Finished difference Result 48144 states and 58496 transitions. [2018-01-30 01:43:39,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-30 01:43:39,525 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 489 [2018-01-30 01:43:39,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:39,544 INFO L225 Difference]: With dead ends: 48144 [2018-01-30 01:43:39,544 INFO L226 Difference]: Without dead ends: 31286 [2018-01-30 01:43:39,551 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 497 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2018-01-30 01:43:39,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31286 states. [2018-01-30 01:43:40,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31286 to 17162. [2018-01-30 01:43:40,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17162 states. [2018-01-30 01:43:40,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17162 states to 17162 states and 20651 transitions. [2018-01-30 01:43:40,015 INFO L78 Accepts]: Start accepts. Automaton has 17162 states and 20651 transitions. Word has length 489 [2018-01-30 01:43:40,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:40,015 INFO L432 AbstractCegarLoop]: Abstraction has 17162 states and 20651 transitions. [2018-01-30 01:43:40,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 01:43:40,016 INFO L276 IsEmpty]: Start isEmpty. Operand 17162 states and 20651 transitions. [2018-01-30 01:43:40,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2018-01-30 01:43:40,024 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:40,024 INFO L350 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:40,024 INFO L371 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:40,025 INFO L82 PathProgramCache]: Analyzing trace with hash 133748739, now seen corresponding path program 1 times [2018-01-30 01:43:40,025 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:40,025 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:40,025 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:40,025 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:40,025 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:40,033 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:40,316 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 630 proven. 13 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-01-30 01:43:40,316 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:43:40,316 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-30 01:43:40,321 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:43:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:40,370 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:43:40,440 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 630 proven. 13 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-01-30 01:43:40,458 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:43:40,458 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-30 01:43:40,458 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:43:40,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:43:40,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:43:40,459 INFO L87 Difference]: Start difference. First operand 17162 states and 20651 transitions. Second operand 5 states. [2018-01-30 01:43:41,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:41,420 INFO L93 Difference]: Finished difference Result 41534 states and 49316 transitions. [2018-01-30 01:43:41,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 01:43:41,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 502 [2018-01-30 01:43:41,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:41,436 INFO L225 Difference]: With dead ends: 41534 [2018-01-30 01:43:41,436 INFO L226 Difference]: Without dead ends: 26914 [2018-01-30 01:43:41,440 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-30 01:43:41,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26914 states. [2018-01-30 01:43:41,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26914 to 14949. [2018-01-30 01:43:41,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14949 states. [2018-01-30 01:43:41,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14949 states to 14949 states and 17580 transitions. [2018-01-30 01:43:41,893 INFO L78 Accepts]: Start accepts. Automaton has 14949 states and 17580 transitions. Word has length 502 [2018-01-30 01:43:41,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:41,893 INFO L432 AbstractCegarLoop]: Abstraction has 14949 states and 17580 transitions. [2018-01-30 01:43:41,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:43:41,893 INFO L276 IsEmpty]: Start isEmpty. Operand 14949 states and 17580 transitions. [2018-01-30 01:43:41,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2018-01-30 01:43:41,901 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:41,901 INFO L350 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:41,901 INFO L371 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:41,902 INFO L82 PathProgramCache]: Analyzing trace with hash -2034776568, now seen corresponding path program 1 times [2018-01-30 01:43:41,902 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:41,902 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:41,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:41,902 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:41,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:41,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:42,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 802 proven. 22 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-01-30 01:43:42,201 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:43:42,201 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:43:42,211 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:42,257 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:43:42,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 802 proven. 22 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-01-30 01:43:42,350 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:43:42,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-30 01:43:42,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:43:42,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:43:42,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:43:42,351 INFO L87 Difference]: Start difference. First operand 14949 states and 17580 transitions. Second operand 5 states. [2018-01-30 01:43:42,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:42,997 INFO L93 Difference]: Finished difference Result 31657 states and 37246 transitions. [2018-01-30 01:43:42,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 01:43:42,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 549 [2018-01-30 01:43:42,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:43,008 INFO L225 Difference]: With dead ends: 31657 [2018-01-30 01:43:43,008 INFO L226 Difference]: Without dead ends: 16513 [2018-01-30 01:43:43,019 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 552 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-30 01:43:43,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16513 states. [2018-01-30 01:43:43,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16513 to 14559. [2018-01-30 01:43:43,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14559 states. [2018-01-30 01:43:43,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14559 states to 14559 states and 16931 transitions. [2018-01-30 01:43:43,505 INFO L78 Accepts]: Start accepts. Automaton has 14559 states and 16931 transitions. Word has length 549 [2018-01-30 01:43:43,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:43,505 INFO L432 AbstractCegarLoop]: Abstraction has 14559 states and 16931 transitions. [2018-01-30 01:43:43,505 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:43:43,505 INFO L276 IsEmpty]: Start isEmpty. Operand 14559 states and 16931 transitions. [2018-01-30 01:43:43,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2018-01-30 01:43:43,513 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:43,514 INFO L350 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:43,514 INFO L371 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:43,514 INFO L82 PathProgramCache]: Analyzing trace with hash -2123983312, now seen corresponding path program 1 times [2018-01-30 01:43:43,514 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:43,514 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:43,514 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:43,514 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:43,514 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:43,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:43,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1150 backedges. 676 proven. 0 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2018-01-30 01:43:43,749 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:43,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:43:43,749 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:43:43,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:43:43,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:43:43,750 INFO L87 Difference]: Start difference. First operand 14559 states and 16931 transitions. Second operand 4 states. [2018-01-30 01:43:44,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:44,084 INFO L93 Difference]: Finished difference Result 24922 states and 28889 transitions. [2018-01-30 01:43:44,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 01:43:44,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 552 [2018-01-30 01:43:44,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:44,089 INFO L225 Difference]: With dead ends: 24922 [2018-01-30 01:43:44,089 INFO L226 Difference]: Without dead ends: 8318 [2018-01-30 01:43:44,097 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-01-30 01:43:44,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8318 states. [2018-01-30 01:43:44,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8318 to 6402. [2018-01-30 01:43:44,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6402 states. [2018-01-30 01:43:44,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6402 states to 6402 states and 7478 transitions. [2018-01-30 01:43:44,295 INFO L78 Accepts]: Start accepts. Automaton has 6402 states and 7478 transitions. Word has length 552 [2018-01-30 01:43:44,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:44,296 INFO L432 AbstractCegarLoop]: Abstraction has 6402 states and 7478 transitions. [2018-01-30 01:43:44,296 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:43:44,296 INFO L276 IsEmpty]: Start isEmpty. Operand 6402 states and 7478 transitions. [2018-01-30 01:43:44,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2018-01-30 01:43:44,300 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:44,300 INFO L350 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:44,300 INFO L371 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:44,300 INFO L82 PathProgramCache]: Analyzing trace with hash 47105333, now seen corresponding path program 1 times [2018-01-30 01:43:44,300 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:44,300 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:44,301 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:44,301 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:44,301 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:44,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:44,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 699 proven. 0 refuted. 0 times theorem prover too weak. 978 trivial. 0 not checked. [2018-01-30 01:43:44,464 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:44,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:43:44,465 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:43:44,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:43:44,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:43:44,465 INFO L87 Difference]: Start difference. First operand 6402 states and 7478 transitions. Second operand 3 states. [2018-01-30 01:43:44,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:44,740 INFO L93 Difference]: Finished difference Result 13421 states and 15737 transitions. [2018-01-30 01:43:44,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:43:44,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 613 [2018-01-30 01:43:44,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:44,745 INFO L225 Difference]: With dead ends: 13421 [2018-01-30 01:43:44,745 INFO L226 Difference]: Without dead ends: 7169 [2018-01-30 01:43:44,749 INFO L553 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-01-30 01:43:44,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7169 states. [2018-01-30 01:43:44,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7169 to 6805. [2018-01-30 01:43:44,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6805 states. [2018-01-30 01:43:44,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6805 states to 6805 states and 7907 transitions. [2018-01-30 01:43:44,986 INFO L78 Accepts]: Start accepts. Automaton has 6805 states and 7907 transitions. Word has length 613 [2018-01-30 01:43:44,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:44,987 INFO L432 AbstractCegarLoop]: Abstraction has 6805 states and 7907 transitions. [2018-01-30 01:43:44,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:43:44,987 INFO L276 IsEmpty]: Start isEmpty. Operand 6805 states and 7907 transitions. [2018-01-30 01:43:44,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2018-01-30 01:43:44,991 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:44,991 INFO L350 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:44,991 INFO L371 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:44,991 INFO L82 PathProgramCache]: Analyzing trace with hash 550961945, now seen corresponding path program 1 times [2018-01-30 01:43:44,991 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:44,992 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:44,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:44,992 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:44,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:45,003 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:45,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1776 backedges. 836 proven. 0 refuted. 0 times theorem prover too weak. 940 trivial. 0 not checked. [2018-01-30 01:43:45,272 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:45,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:43:45,272 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:43:45,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:43:45,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:43:45,273 INFO L87 Difference]: Start difference. First operand 6805 states and 7907 transitions. Second operand 4 states. [2018-01-30 01:43:45,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:45,866 INFO L93 Difference]: Finished difference Result 19891 states and 23186 transitions. [2018-01-30 01:43:45,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 01:43:45,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 631 [2018-01-30 01:43:45,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:45,874 INFO L225 Difference]: With dead ends: 19891 [2018-01-30 01:43:45,874 INFO L226 Difference]: Without dead ends: 13091 [2018-01-30 01:43:45,879 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-01-30 01:43:45,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13091 states. [2018-01-30 01:43:46,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13091 to 7091. [2018-01-30 01:43:46,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7091 states. [2018-01-30 01:43:46,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7091 states to 7091 states and 8219 transitions. [2018-01-30 01:43:46,122 INFO L78 Accepts]: Start accepts. Automaton has 7091 states and 8219 transitions. Word has length 631 [2018-01-30 01:43:46,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:46,123 INFO L432 AbstractCegarLoop]: Abstraction has 7091 states and 8219 transitions. [2018-01-30 01:43:46,123 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:43:46,123 INFO L276 IsEmpty]: Start isEmpty. Operand 7091 states and 8219 transitions. [2018-01-30 01:43:46,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2018-01-30 01:43:46,127 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:46,128 INFO L350 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 11, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:46,128 INFO L371 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:46,128 INFO L82 PathProgramCache]: Analyzing trace with hash -737184489, now seen corresponding path program 1 times [2018-01-30 01:43:46,128 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:46,128 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:46,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:46,129 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:46,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:46,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:46,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2195 backedges. 798 proven. 0 refuted. 0 times theorem prover too weak. 1397 trivial. 0 not checked. [2018-01-30 01:43:46,349 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:46,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:43:46,349 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:43:46,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:43:46,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:43:46,350 INFO L87 Difference]: Start difference. First operand 7091 states and 8219 transitions. Second operand 3 states. [2018-01-30 01:43:46,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:46,760 INFO L93 Difference]: Finished difference Result 20765 states and 24061 transitions. [2018-01-30 01:43:46,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:43:46,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 677 [2018-01-30 01:43:46,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:46,769 INFO L225 Difference]: With dead ends: 20765 [2018-01-30 01:43:46,770 INFO L226 Difference]: Without dead ends: 13824 [2018-01-30 01:43:46,775 INFO L553 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-01-30 01:43:46,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13824 states. [2018-01-30 01:43:47,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13824 to 7104. [2018-01-30 01:43:47,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7104 states. [2018-01-30 01:43:47,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7104 states to 7104 states and 8232 transitions. [2018-01-30 01:43:47,028 INFO L78 Accepts]: Start accepts. Automaton has 7104 states and 8232 transitions. Word has length 677 [2018-01-30 01:43:47,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:47,029 INFO L432 AbstractCegarLoop]: Abstraction has 7104 states and 8232 transitions. [2018-01-30 01:43:47,029 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:43:47,029 INFO L276 IsEmpty]: Start isEmpty. Operand 7104 states and 8232 transitions. [2018-01-30 01:43:47,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2018-01-30 01:43:47,033 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:47,034 INFO L350 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 11, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:47,034 INFO L371 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:47,034 INFO L82 PathProgramCache]: Analyzing trace with hash 299699671, now seen corresponding path program 1 times [2018-01-30 01:43:47,034 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:47,034 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:47,034 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:47,034 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:47,034 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:47,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:47,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2195 backedges. 1008 proven. 0 refuted. 0 times theorem prover too weak. 1187 trivial. 0 not checked. [2018-01-30 01:43:47,198 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:47,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:43:47,199 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:43:47,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:43:47,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:43:47,199 INFO L87 Difference]: Start difference. First operand 7104 states and 8232 transitions. Second operand 3 states. [2018-01-30 01:43:47,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:47,502 INFO L93 Difference]: Finished difference Result 14738 states and 17145 transitions. [2018-01-30 01:43:47,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:43:47,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 677 [2018-01-30 01:43:47,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:47,507 INFO L225 Difference]: With dead ends: 14738 [2018-01-30 01:43:47,507 INFO L226 Difference]: Without dead ends: 7784 [2018-01-30 01:43:47,512 INFO L553 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-01-30 01:43:47,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7784 states. [2018-01-30 01:43:47,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7784 to 7533. [2018-01-30 01:43:47,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7533 states. [2018-01-30 01:43:47,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7533 states to 7533 states and 8687 transitions. [2018-01-30 01:43:47,765 INFO L78 Accepts]: Start accepts. Automaton has 7533 states and 8687 transitions. Word has length 677 [2018-01-30 01:43:47,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:47,765 INFO L432 AbstractCegarLoop]: Abstraction has 7533 states and 8687 transitions. [2018-01-30 01:43:47,765 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:43:47,765 INFO L276 IsEmpty]: Start isEmpty. Operand 7533 states and 8687 transitions. [2018-01-30 01:43:47,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2018-01-30 01:43:47,770 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:47,770 INFO L350 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 11, 11, 11, 11, 9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:47,770 INFO L371 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:47,770 INFO L82 PathProgramCache]: Analyzing trace with hash -602523911, now seen corresponding path program 1 times [2018-01-30 01:43:47,770 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:47,771 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:47,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:47,771 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:47,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:47,783 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:48,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2292 backedges. 1131 proven. 0 refuted. 0 times theorem prover too weak. 1161 trivial. 0 not checked. [2018-01-30 01:43:48,087 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:48,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:43:48,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:43:48,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:43:48,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:43:48,088 INFO L87 Difference]: Start difference. First operand 7533 states and 8687 transitions. Second operand 4 states. [2018-01-30 01:43:48,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:48,663 INFO L93 Difference]: Finished difference Result 21576 states and 24923 transitions. [2018-01-30 01:43:48,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 01:43:48,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 691 [2018-01-30 01:43:48,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:48,671 INFO L225 Difference]: With dead ends: 21576 [2018-01-30 01:43:48,671 INFO L226 Difference]: Without dead ends: 14074 [2018-01-30 01:43:48,678 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:43:48,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14074 states. [2018-01-30 01:43:48,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14074 to 7845. [2018-01-30 01:43:48,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7845 states. [2018-01-30 01:43:48,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7845 states to 7845 states and 9051 transitions. [2018-01-30 01:43:48,965 INFO L78 Accepts]: Start accepts. Automaton has 7845 states and 9051 transitions. Word has length 691 [2018-01-30 01:43:48,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:48,966 INFO L432 AbstractCegarLoop]: Abstraction has 7845 states and 9051 transitions. [2018-01-30 01:43:48,966 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:43:48,966 INFO L276 IsEmpty]: Start isEmpty. Operand 7845 states and 9051 transitions. [2018-01-30 01:43:48,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2018-01-30 01:43:48,971 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:48,971 INFO L350 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 13, 11, 11, 9, 9, 9, 9, 9, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:48,971 INFO L371 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:48,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1475518603, now seen corresponding path program 1 times [2018-01-30 01:43:48,971 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:48,971 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:48,972 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:48,972 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:48,972 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:48,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:49,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2825 backedges. 1373 proven. 0 refuted. 0 times theorem prover too weak. 1452 trivial. 0 not checked. [2018-01-30 01:43:49,149 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:49,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:43:49,150 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:43:49,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:43:49,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:43:49,150 INFO L87 Difference]: Start difference. First operand 7845 states and 9051 transitions. Second operand 3 states. [2018-01-30 01:43:49,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:49,472 INFO L93 Difference]: Finished difference Result 15513 states and 17929 transitions. [2018-01-30 01:43:49,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:43:49,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 733 [2018-01-30 01:43:49,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:49,476 INFO L225 Difference]: With dead ends: 15513 [2018-01-30 01:43:49,476 INFO L226 Difference]: Without dead ends: 7818 [2018-01-30 01:43:49,480 INFO L553 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-01-30 01:43:49,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7818 states. [2018-01-30 01:43:49,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7818 to 5696. [2018-01-30 01:43:49,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5696 states. [2018-01-30 01:43:49,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5696 states to 5696 states and 6590 transitions. [2018-01-30 01:43:49,704 INFO L78 Accepts]: Start accepts. Automaton has 5696 states and 6590 transitions. Word has length 733 [2018-01-30 01:43:49,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:49,705 INFO L432 AbstractCegarLoop]: Abstraction has 5696 states and 6590 transitions. [2018-01-30 01:43:49,705 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:43:49,705 INFO L276 IsEmpty]: Start isEmpty. Operand 5696 states and 6590 transitions. [2018-01-30 01:43:49,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 828 [2018-01-30 01:43:49,710 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:49,711 INFO L350 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 16, 15, 13, 13, 13, 13, 13, 11, 11, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:49,711 INFO L371 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:49,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1705753095, now seen corresponding path program 1 times [2018-01-30 01:43:49,711 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:49,711 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:49,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:49,711 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:49,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:49,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:50,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3786 backedges. 1492 proven. 2 refuted. 0 times theorem prover too weak. 2292 trivial. 0 not checked. [2018-01-30 01:43:50,099 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:43:50,099 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:43:50,103 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:50,170 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:43:50,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3786 backedges. 1492 proven. 2 refuted. 0 times theorem prover too weak. 2292 trivial. 0 not checked. [2018-01-30 01:43:50,420 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:43:50,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-01-30 01:43:50,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 01:43:50,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 01:43:50,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-30 01:43:50,421 INFO L87 Difference]: Start difference. First operand 5696 states and 6590 transitions. Second operand 8 states. [2018-01-30 01:43:50,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:50,985 INFO L93 Difference]: Finished difference Result 13669 states and 15853 transitions. [2018-01-30 01:43:50,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 01:43:50,985 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 827 [2018-01-30 01:43:50,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:50,989 INFO L225 Difference]: With dead ends: 13669 [2018-01-30 01:43:50,990 INFO L226 Difference]: Without dead ends: 7811 [2018-01-30 01:43:50,994 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 835 GetRequests, 827 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-30 01:43:50,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7811 states. [2018-01-30 01:43:51,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7811 to 6259. [2018-01-30 01:43:51,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6259 states. [2018-01-30 01:43:51,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6259 states to 6259 states and 7267 transitions. [2018-01-30 01:43:51,247 INFO L78 Accepts]: Start accepts. Automaton has 6259 states and 7267 transitions. Word has length 827 [2018-01-30 01:43:51,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:51,248 INFO L432 AbstractCegarLoop]: Abstraction has 6259 states and 7267 transitions. [2018-01-30 01:43:51,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 01:43:51,248 INFO L276 IsEmpty]: Start isEmpty. Operand 6259 states and 7267 transitions. [2018-01-30 01:43:51,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 834 [2018-01-30 01:43:51,253 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:51,253 INFO L350 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 16, 15, 13, 13, 13, 13, 13, 11, 11, 10, 10, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:51,253 INFO L371 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:51,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1195454461, now seen corresponding path program 2 times [2018-01-30 01:43:51,254 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:51,254 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:51,254 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:51,254 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:51,254 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:51,265 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:51,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3837 backedges. 2071 proven. 34 refuted. 0 times theorem prover too weak. 1732 trivial. 0 not checked. [2018-01-30 01:43:51,578 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:43:51,578 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:43:51,583 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 01:43:51,604 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:43:51,640 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:43:51,649 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:43:51,654 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:43:51,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3837 backedges. 2071 proven. 34 refuted. 0 times theorem prover too weak. 1732 trivial. 0 not checked. [2018-01-30 01:43:51,839 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:43:51,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-30 01:43:51,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:43:51,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:43:51,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:43:51,840 INFO L87 Difference]: Start difference. First operand 6259 states and 7267 transitions. Second operand 5 states. [2018-01-30 01:43:52,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:52,629 INFO L93 Difference]: Finished difference Result 17946 states and 20575 transitions. [2018-01-30 01:43:52,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 01:43:52,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 833 [2018-01-30 01:43:52,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:52,637 INFO L225 Difference]: With dead ends: 17946 [2018-01-30 01:43:52,637 INFO L226 Difference]: Without dead ends: 12520 [2018-01-30 01:43:52,642 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 846 GetRequests, 839 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-30 01:43:52,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12520 states. [2018-01-30 01:43:52,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12520 to 6269. [2018-01-30 01:43:52,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6269 states. [2018-01-30 01:43:52,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6269 states to 6269 states and 7277 transitions. [2018-01-30 01:43:52,926 INFO L78 Accepts]: Start accepts. Automaton has 6269 states and 7277 transitions. Word has length 833 [2018-01-30 01:43:52,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:52,926 INFO L432 AbstractCegarLoop]: Abstraction has 6269 states and 7277 transitions. [2018-01-30 01:43:52,926 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:43:52,926 INFO L276 IsEmpty]: Start isEmpty. Operand 6269 states and 7277 transitions. [2018-01-30 01:43:52,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 920 [2018-01-30 01:43:52,931 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:52,932 INFO L350 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 18, 17, 15, 15, 15, 15, 15, 13, 13, 11, 11, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:52,932 INFO L371 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:52,932 INFO L82 PathProgramCache]: Analyzing trace with hash 476389657, now seen corresponding path program 1 times [2018-01-30 01:43:52,932 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:52,932 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:52,933 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:52,933 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:43:52,933 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:52,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:53,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4836 backedges. 2521 proven. 0 refuted. 0 times theorem prover too weak. 2315 trivial. 0 not checked. [2018-01-30 01:43:53,224 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:53,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:43:53,224 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:43:53,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:43:53,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:43:53,225 INFO L87 Difference]: Start difference. First operand 6269 states and 7277 transitions. Second operand 3 states. [2018-01-30 01:43:53,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:53,554 INFO L93 Difference]: Finished difference Result 12928 states and 15047 transitions. [2018-01-30 01:43:53,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:43:53,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 919 [2018-01-30 01:43:53,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:53,558 INFO L225 Difference]: With dead ends: 12928 [2018-01-30 01:43:53,558 INFO L226 Difference]: Without dead ends: 6809 [2018-01-30 01:43:53,562 INFO L553 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-01-30 01:43:53,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6809 states. [2018-01-30 01:43:53,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6809 to 6725. [2018-01-30 01:43:53,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6725 states. [2018-01-30 01:43:53,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6725 states to 6725 states and 7757 transitions. [2018-01-30 01:43:53,834 INFO L78 Accepts]: Start accepts. Automaton has 6725 states and 7757 transitions. Word has length 919 [2018-01-30 01:43:53,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:53,834 INFO L432 AbstractCegarLoop]: Abstraction has 6725 states and 7757 transitions. [2018-01-30 01:43:53,834 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:43:53,834 INFO L276 IsEmpty]: Start isEmpty. Operand 6725 states and 7757 transitions. [2018-01-30 01:43:53,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 926 [2018-01-30 01:43:53,840 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:53,840 INFO L350 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 18, 17, 15, 15, 15, 15, 15, 13, 13, 12, 12, 12, 12, 11, 11, 11, 11, 8, 6, 6, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:53,841 INFO L371 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:53,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1880547255, now seen corresponding path program 2 times [2018-01-30 01:43:53,841 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:53,841 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:53,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:53,841 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:53,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:53,854 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:54,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4899 backedges. 2586 proven. 0 refuted. 0 times theorem prover too weak. 2313 trivial. 0 not checked. [2018-01-30 01:43:54,201 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:54,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:43:54,202 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:43:54,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:43:54,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:43:54,202 INFO L87 Difference]: Start difference. First operand 6725 states and 7757 transitions. Second operand 4 states. [2018-01-30 01:43:54,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:54,827 INFO L93 Difference]: Finished difference Result 18762 states and 21545 transitions. [2018-01-30 01:43:54,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 01:43:54,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 925 [2018-01-30 01:43:54,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:54,834 INFO L225 Difference]: With dead ends: 18762 [2018-01-30 01:43:54,834 INFO L226 Difference]: Without dead ends: 12160 [2018-01-30 01:43:54,839 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:43:54,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12160 states. [2018-01-30 01:43:55,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12160 to 7097. [2018-01-30 01:43:55,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7097 states. [2018-01-30 01:43:55,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7097 states to 7097 states and 8249 transitions. [2018-01-30 01:43:55,148 INFO L78 Accepts]: Start accepts. Automaton has 7097 states and 8249 transitions. Word has length 925 [2018-01-30 01:43:55,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:55,149 INFO L432 AbstractCegarLoop]: Abstraction has 7097 states and 8249 transitions. [2018-01-30 01:43:55,149 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:43:55,149 INFO L276 IsEmpty]: Start isEmpty. Operand 7097 states and 8249 transitions. [2018-01-30 01:43:55,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1000 [2018-01-30 01:43:55,155 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:55,156 INFO L350 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 20, 19, 17, 17, 17, 17, 17, 15, 15, 13, 13, 13, 13, 10, 10, 10, 10, 10, 8, 8, 7, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:55,156 INFO L371 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:55,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1357848537, now seen corresponding path program 1 times [2018-01-30 01:43:55,156 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:55,156 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:55,156 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:55,157 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:43:55,157 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:55,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:55,458 INFO L134 CoverageAnalysis]: Checked inductivity of 5984 backedges. 3159 proven. 0 refuted. 0 times theorem prover too weak. 2825 trivial. 0 not checked. [2018-01-30 01:43:55,459 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:55,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:43:55,459 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:43:55,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:43:55,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:43:55,459 INFO L87 Difference]: Start difference. First operand 7097 states and 8249 transitions. Second operand 3 states. [2018-01-30 01:43:55,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:55,780 INFO L93 Difference]: Finished difference Result 14026 states and 16342 transitions. [2018-01-30 01:43:55,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:43:55,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 999 [2018-01-30 01:43:55,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:55,784 INFO L225 Difference]: With dead ends: 14026 [2018-01-30 01:43:55,785 INFO L226 Difference]: Without dead ends: 7079 [2018-01-30 01:43:55,789 INFO L553 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-01-30 01:43:55,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7079 states. [2018-01-30 01:43:56,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7079 to 6844. [2018-01-30 01:43:56,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6844 states. [2018-01-30 01:43:56,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6844 states to 6844 states and 7912 transitions. [2018-01-30 01:43:56,073 INFO L78 Accepts]: Start accepts. Automaton has 6844 states and 7912 transitions. Word has length 999 [2018-01-30 01:43:56,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:56,074 INFO L432 AbstractCegarLoop]: Abstraction has 6844 states and 7912 transitions. [2018-01-30 01:43:56,074 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:43:56,074 INFO L276 IsEmpty]: Start isEmpty. Operand 6844 states and 7912 transitions. [2018-01-30 01:43:56,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1006 [2018-01-30 01:43:56,080 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:56,081 INFO L350 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 20, 19, 17, 17, 17, 17, 17, 15, 15, 13, 13, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:56,081 INFO L371 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:56,081 INFO L82 PathProgramCache]: Analyzing trace with hash -874832333, now seen corresponding path program 2 times [2018-01-30 01:43:56,081 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:56,081 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:56,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:56,081 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:56,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:56,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:56,494 INFO L134 CoverageAnalysis]: Checked inductivity of 6047 backedges. 2675 proven. 0 refuted. 0 times theorem prover too weak. 3372 trivial. 0 not checked. [2018-01-30 01:43:56,494 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:56,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:43:56,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:43:56,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:43:56,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:43:56,495 INFO L87 Difference]: Start difference. First operand 6844 states and 7912 transitions. Second operand 5 states. [2018-01-30 01:43:56,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:56,949 INFO L93 Difference]: Finished difference Result 14290 states and 16481 transitions. [2018-01-30 01:43:56,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:43:56,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1005 [2018-01-30 01:43:56,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:56,953 INFO L225 Difference]: With dead ends: 14290 [2018-01-30 01:43:56,953 INFO L226 Difference]: Without dead ends: 7596 [2018-01-30 01:43:56,958 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:43:56,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7596 states. [2018-01-30 01:43:57,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7596 to 7084. [2018-01-30 01:43:57,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7084 states. [2018-01-30 01:43:57,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7084 states to 7084 states and 8176 transitions. [2018-01-30 01:43:57,260 INFO L78 Accepts]: Start accepts. Automaton has 7084 states and 8176 transitions. Word has length 1005 [2018-01-30 01:43:57,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:57,261 INFO L432 AbstractCegarLoop]: Abstraction has 7084 states and 8176 transitions. [2018-01-30 01:43:57,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:43:57,261 INFO L276 IsEmpty]: Start isEmpty. Operand 7084 states and 8176 transitions. [2018-01-30 01:43:57,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1012 [2018-01-30 01:43:57,267 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:57,267 INFO L350 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 20, 19, 17, 17, 17, 17, 17, 15, 15, 14, 14, 14, 14, 13, 13, 13, 13, 10, 8, 8, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:57,268 INFO L371 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:57,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1540846745, now seen corresponding path program 3 times [2018-01-30 01:43:57,268 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:57,268 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:57,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:57,268 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:43:57,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:57,281 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:57,693 INFO L134 CoverageAnalysis]: Checked inductivity of 6122 backedges. 3256 proven. 0 refuted. 0 times theorem prover too weak. 2866 trivial. 0 not checked. [2018-01-30 01:43:57,693 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:57,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:43:57,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:43:57,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:43:57,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:43:57,694 INFO L87 Difference]: Start difference. First operand 7084 states and 8176 transitions. Second operand 4 states. [2018-01-30 01:43:58,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:58,315 INFO L93 Difference]: Finished difference Result 17288 states and 19705 transitions. [2018-01-30 01:43:58,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 01:43:58,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1011 [2018-01-30 01:43:58,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:58,322 INFO L225 Difference]: With dead ends: 17288 [2018-01-30 01:43:58,322 INFO L226 Difference]: Without dead ends: 11182 [2018-01-30 01:43:58,327 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:43:58,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11182 states. [2018-01-30 01:43:58,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11182 to 7074. [2018-01-30 01:43:58,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7074 states. [2018-01-30 01:43:58,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7074 states to 7074 states and 8156 transitions. [2018-01-30 01:43:58,652 INFO L78 Accepts]: Start accepts. Automaton has 7074 states and 8156 transitions. Word has length 1011 [2018-01-30 01:43:58,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:58,653 INFO L432 AbstractCegarLoop]: Abstraction has 7074 states and 8156 transitions. [2018-01-30 01:43:58,653 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:43:58,653 INFO L276 IsEmpty]: Start isEmpty. Operand 7074 states and 8156 transitions. [2018-01-30 01:43:58,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1090 [2018-01-30 01:43:58,660 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:58,660 INFO L350 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 22, 21, 19, 19, 19, 19, 19, 17, 17, 15, 15, 15, 15, 12, 12, 12, 12, 12, 10, 10, 8, 8, 7, 6, 6, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:58,660 INFO L371 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:58,661 INFO L82 PathProgramCache]: Analyzing trace with hash -337251787, now seen corresponding path program 1 times [2018-01-30 01:43:58,661 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:58,661 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:58,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:58,661 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:43:58,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:58,675 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:43:59,168 INFO L134 CoverageAnalysis]: Checked inductivity of 7357 backedges. 3374 proven. 0 refuted. 0 times theorem prover too weak. 3983 trivial. 0 not checked. [2018-01-30 01:43:59,168 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:43:59,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:43:59,169 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:43:59,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:43:59,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:43:59,169 INFO L87 Difference]: Start difference. First operand 7074 states and 8156 transitions. Second operand 5 states. [2018-01-30 01:43:59,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:43:59,591 INFO L93 Difference]: Finished difference Result 13614 states and 15615 transitions. [2018-01-30 01:43:59,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:43:59,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1089 [2018-01-30 01:43:59,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:43:59,596 INFO L225 Difference]: With dead ends: 13614 [2018-01-30 01:43:59,596 INFO L226 Difference]: Without dead ends: 7528 [2018-01-30 01:43:59,600 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:43:59,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7528 states. [2018-01-30 01:43:59,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7528 to 7254. [2018-01-30 01:43:59,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7254 states. [2018-01-30 01:43:59,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7254 states to 7254 states and 8348 transitions. [2018-01-30 01:43:59,947 INFO L78 Accepts]: Start accepts. Automaton has 7254 states and 8348 transitions. Word has length 1089 [2018-01-30 01:43:59,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:43:59,947 INFO L432 AbstractCegarLoop]: Abstraction has 7254 states and 8348 transitions. [2018-01-30 01:43:59,947 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:43:59,947 INFO L276 IsEmpty]: Start isEmpty. Operand 7254 states and 8348 transitions. [2018-01-30 01:43:59,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1096 [2018-01-30 01:43:59,954 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:43:59,955 INFO L350 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 22, 21, 19, 19, 19, 19, 19, 17, 17, 15, 15, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:43:59,955 INFO L371 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:43:59,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1585342535, now seen corresponding path program 2 times [2018-01-30 01:43:59,955 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:43:59,955 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:43:59,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:59,956 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:43:59,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:43:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:43:59,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:44:00,433 INFO L134 CoverageAnalysis]: Checked inductivity of 7432 backedges. 3711 proven. 0 refuted. 0 times theorem prover too weak. 3721 trivial. 0 not checked. [2018-01-30 01:44:00,433 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:44:00,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:44:00,434 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:44:00,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:44:00,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:44:00,434 INFO L87 Difference]: Start difference. First operand 7254 states and 8348 transitions. Second operand 5 states. [2018-01-30 01:44:00,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:44:00,847 INFO L93 Difference]: Finished difference Result 13712 states and 15715 transitions. [2018-01-30 01:44:00,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:44:00,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1095 [2018-01-30 01:44:00,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:44:00,852 INFO L225 Difference]: With dead ends: 13712 [2018-01-30 01:44:00,852 INFO L226 Difference]: Without dead ends: 7476 [2018-01-30 01:44:00,856 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:44:00,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7476 states. [2018-01-30 01:44:01,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7476 to 7284. [2018-01-30 01:44:01,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7284 states. [2018-01-30 01:44:01,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7284 states to 7284 states and 8377 transitions. [2018-01-30 01:44:01,178 INFO L78 Accepts]: Start accepts. Automaton has 7284 states and 8377 transitions. Word has length 1095 [2018-01-30 01:44:01,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:44:01,178 INFO L432 AbstractCegarLoop]: Abstraction has 7284 states and 8377 transitions. [2018-01-30 01:44:01,179 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:44:01,179 INFO L276 IsEmpty]: Start isEmpty. Operand 7284 states and 8377 transitions. [2018-01-30 01:44:01,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1102 [2018-01-30 01:44:01,186 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:44:01,186 INFO L350 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 22, 21, 19, 19, 19, 19, 19, 17, 17, 16, 16, 16, 16, 15, 15, 15, 15, 12, 10, 10, 8, 8, 6, 6, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:44:01,186 INFO L371 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:44:01,186 INFO L82 PathProgramCache]: Analyzing trace with hash -2048191487, now seen corresponding path program 3 times [2018-01-30 01:44:01,186 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:44:01,186 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:44:01,187 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:44:01,187 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:44:01,187 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:44:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:44:01,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:44:01,674 INFO L134 CoverageAnalysis]: Checked inductivity of 7519 backedges. 3995 proven. 0 refuted. 0 times theorem prover too weak. 3524 trivial. 0 not checked. [2018-01-30 01:44:01,674 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:44:01,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:44:01,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:44:01,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:44:01,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:44:01,675 INFO L87 Difference]: Start difference. First operand 7284 states and 8377 transitions. Second operand 5 states. [2018-01-30 01:44:02,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:44:02,140 INFO L93 Difference]: Finished difference Result 13813 states and 15816 transitions. [2018-01-30 01:44:02,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:44:02,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1101 [2018-01-30 01:44:02,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:44:02,145 INFO L225 Difference]: With dead ends: 13813 [2018-01-30 01:44:02,145 INFO L226 Difference]: Without dead ends: 7577 [2018-01-30 01:44:02,149 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:44:02,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7577 states. [2018-01-30 01:44:02,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7577 to 7364. [2018-01-30 01:44:02,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7364 states. [2018-01-30 01:44:02,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7364 states to 7364 states and 8462 transitions. [2018-01-30 01:44:02,480 INFO L78 Accepts]: Start accepts. Automaton has 7364 states and 8462 transitions. Word has length 1101 [2018-01-30 01:44:02,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:44:02,480 INFO L432 AbstractCegarLoop]: Abstraction has 7364 states and 8462 transitions. [2018-01-30 01:44:02,480 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:44:02,480 INFO L276 IsEmpty]: Start isEmpty. Operand 7364 states and 8462 transitions. [2018-01-30 01:44:02,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1108 [2018-01-30 01:44:02,488 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:44:02,488 INFO L350 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 22, 21, 19, 19, 19, 19, 19, 18, 18, 18, 18, 17, 17, 15, 15, 15, 15, 12, 10, 10, 8, 8, 6, 6, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:44:02,488 INFO L371 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:44:02,488 INFO L82 PathProgramCache]: Analyzing trace with hash -347431815, now seen corresponding path program 4 times [2018-01-30 01:44:02,488 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:44:02,488 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:44:02,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:44:02,489 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:44:02,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:44:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:44:02,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:44:03,022 INFO L134 CoverageAnalysis]: Checked inductivity of 7618 backedges. 4584 proven. 25 refuted. 0 times theorem prover too weak. 3009 trivial. 0 not checked. [2018-01-30 01:44:03,022 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:44:03,023 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:44:03,029 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 01:44:03,119 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:44:03,126 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:44:03,442 INFO L134 CoverageAnalysis]: Checked inductivity of 7618 backedges. 4584 proven. 25 refuted. 0 times theorem prover too weak. 3009 trivial. 0 not checked. [2018-01-30 01:44:03,460 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:44:03,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-30 01:44:03,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:44:03,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:44:03,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:44:03,461 INFO L87 Difference]: Start difference. First operand 7364 states and 8462 transitions. Second operand 5 states. Received shutdown request... [2018-01-30 01:44:03,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-30 01:44:03,593 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 01:44:03,596 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 01:44:03,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 01:44:03 BoogieIcfgContainer [2018-01-30 01:44:03,597 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 01:44:03,597 INFO L168 Benchmark]: Toolchain (without parser) took 64189.53 ms. Allocated memory was 148.9 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 114.8 MB in the beginning and 1.1 GB in the end (delta: -982.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-01-30 01:44:03,598 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 148.9 MB. Free memory is still 119.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 01:44:03,598 INFO L168 Benchmark]: CACSL2BoogieTranslator took 212.98 ms. Allocated memory is still 148.9 MB. Free memory was 114.6 MB in the beginning and 100.4 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 5.3 GB. [2018-01-30 01:44:03,598 INFO L168 Benchmark]: Boogie Preprocessor took 43.09 ms. Allocated memory is still 148.9 MB. Free memory was 100.4 MB in the beginning and 98.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-30 01:44:03,598 INFO L168 Benchmark]: RCFGBuilder took 1106.31 ms. Allocated memory is still 148.9 MB. Free memory was 98.3 MB in the beginning and 89.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 39.4 MB. Max. memory is 5.3 GB. [2018-01-30 01:44:03,598 INFO L168 Benchmark]: TraceAbstraction took 62824.24 ms. Allocated memory was 148.9 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 89.1 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-01-30 01:44:03,602 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 148.9 MB. Free memory is still 119.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 212.98 ms. Allocated memory is still 148.9 MB. Free memory was 114.6 MB in the beginning and 100.4 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.09 ms. Allocated memory is still 148.9 MB. Free memory was 100.4 MB in the beginning and 98.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 1106.31 ms. Allocated memory is still 148.9 MB. Free memory was 98.3 MB in the beginning and 89.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 39.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 62824.24 ms. Allocated memory was 148.9 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 89.1 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 608]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 608). Cancelled while BasicCegarLoop was constructing difference of abstraction (7364states) and interpolant automaton (currently 2 states, 5 states before enhancement), while ReachableStatesComputation was computing reachable states (153 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 412 locations, 1 error locations. TIMEOUT Result, 62.7s OverallTime, 55 OverallIterations, 24 TraceHistogramMax, 31.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 30453 SDtfs, 19651 SDslu, 38680 SDs, 0 SdLazy, 11841 SolverSat, 1530 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6408 GetRequests, 6224 SyntacticMatches, 10 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40094occurred in iteration=27, 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: 14.6s AutomataMinimizationTime, 54 MinimizatonAttempts, 166203 StatesRemovedByMinimization, 50 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 34967 NumberOfCodeBlocks, 34967 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 34902 ConstructedInterpolants, 0 QuantifiedInterpolants, 27118091 SizeOfPredicates, 30 NumberOfNonLiveVariables, 8343 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 65 InterpolantComputations, 48 PerfectInterpolantSequences, 114704/115073 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_2_true-unreach-call_false-termination.cil.c_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_01-44-03-611.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_2_true-unreach-call_false-termination.cil.c_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_01-44-03-611.csv Completed graceful shutdown