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/s3_srvr.blast.09_false-unreach-call.i.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 02:01:49,391 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 02:01:49,392 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 02:01:49,408 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 02:01:49,408 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 02:01:49,409 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 02:01:49,409 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 02:01:49,411 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 02:01:49,412 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 02:01:49,413 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 02:01:49,413 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 02:01:49,413 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 02:01:49,414 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 02:01:49,415 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 02:01:49,415 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 02:01:49,417 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 02:01:49,418 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 02:01:49,419 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 02:01:49,420 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 02:01:49,420 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 02:01:49,422 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 02:01:49,422 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 02:01:49,428 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 02:01:49,430 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 02:01:49,430 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 02:01:49,431 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 02:01:49,431 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 02:01:49,431 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 02:01:49,432 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 02:01:49,432 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 02:01:49,432 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 02:01:49,432 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 02:01:49,441 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 02:01:49,441 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 02:01:49,441 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 02:01:49,441 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 02:01:49,441 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 02:01:49,441 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 02:01:49,442 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 02:01:49,443 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 02:01:49,443 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 02:01:49,444 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 02:01:49,444 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 02:01:49,444 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 02:01:49,444 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 02:01:49,444 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 02:01:49,444 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 02:01:49,444 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 02:01:49,444 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 02:01:49,444 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 02:01:49,444 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 02:01:49,444 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 02:01:49,444 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 02:01:49,445 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 02:01:49,445 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 02:01:49,445 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 02:01:49,445 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 02:01:49,445 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 02:01:49,445 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 02:01:49,445 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 02:01:49,445 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 02:01:49,445 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 02:01:49,445 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 02:01:49,446 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 02:01:49,446 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 02:01:49,446 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 02:01:49,471 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 02:01:49,480 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 02:01:49,483 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 02:01:49,483 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 02:01:49,484 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 02:01:49,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.09_false-unreach-call.i.cil.c [2018-01-30 02:01:49,615 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 02:01:49,616 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 02:01:49,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 02:01:49,617 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 02:01:49,621 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 02:01:49,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:01:49" (1/1) ... [2018-01-30 02:01:49,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c3ca2ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:01:49, skipping insertion in model container [2018-01-30 02:01:49,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:01:49" (1/1) ... [2018-01-30 02:01:49,634 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 02:01:49,683 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 02:01:49,836 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 02:01:49,873 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 02:01:49,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:01:49 WrapperNode [2018-01-30 02:01:49,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 02:01:49,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 02:01:49,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 02:01:49,881 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 02:01:49,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:01:49" (1/1) ... [2018-01-30 02:01:49,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:01:49" (1/1) ... [2018-01-30 02:01:49,902 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:01:49" (1/1) ... [2018-01-30 02:01:49,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:01:49" (1/1) ... [2018-01-30 02:01:49,910 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:01:49" (1/1) ... [2018-01-30 02:01:49,920 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:01:49" (1/1) ... [2018-01-30 02:01:49,923 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:01:49" (1/1) ... [2018-01-30 02:01:49,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 02:01:49,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 02:01:49,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 02:01:49,932 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 02:01:49,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:01:49" (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 02:01:49,992 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 02:01:49,992 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 02:01:49,993 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 02:01:49,993 INFO L136 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-01-30 02:01:49,993 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-30 02:01:49,993 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-30 02:01:49,993 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 02:01:49,993 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 02:01:49,993 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 02:01:49,993 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 02:01:49,993 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 02:01:49,993 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 02:01:49,993 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-30 02:01:49,993 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 02:01:49,993 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2018-01-30 02:01:49,994 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-01-30 02:01:49,994 INFO L128 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-01-30 02:01:49,994 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 02:01:49,994 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 02:01:49,994 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 02:01:50,244 WARN L490 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-01-30 02:01:50,244 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-30 02:01:51,592 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 02:01:51,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:01:51 BoogieIcfgContainer [2018-01-30 02:01:51,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 02:01:51,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 02:01:51,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 02:01:51,594 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 02:01:51,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 02:01:49" (1/3) ... [2018-01-30 02:01:51,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91cf5d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:01:51, skipping insertion in model container [2018-01-30 02:01:51,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:01:49" (2/3) ... [2018-01-30 02:01:51,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91cf5d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:01:51, skipping insertion in model container [2018-01-30 02:01:51,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:01:51" (3/3) ... [2018-01-30 02:01:51,596 INFO L107 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.09_false-unreach-call.i.cil.c [2018-01-30 02:01:51,601 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 02:01:51,606 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 02:01:51,634 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 02:01:51,634 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 02:01:51,634 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 02:01:51,634 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 02:01:51,634 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 02:01:51,634 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 02:01:51,634 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 02:01:51,634 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 02:01:51,635 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 02:01:51,650 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states. [2018-01-30 02:01:51,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-01-30 02:01:51,661 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:01:51,661 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] [2018-01-30 02:01:51,661 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:01:51,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1128997665, now seen corresponding path program 1 times [2018-01-30 02:01:51,665 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:01:51,665 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:01:51,697 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:01:51,697 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:01:51,697 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:01:51,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:01:51,753 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:01:52,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:01:52,263 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:01:52,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:01:52,265 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:01:52,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:01:52,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:01:52,273 INFO L87 Difference]: Start difference. First operand 606 states. Second operand 4 states. [2018-01-30 02:01:53,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:01:53,456 INFO L93 Difference]: Finished difference Result 1220 states and 1445 transitions. [2018-01-30 02:01:53,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 02:01:53,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2018-01-30 02:01:53,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:01:53,468 INFO L225 Difference]: With dead ends: 1220 [2018-01-30 02:01:53,468 INFO L226 Difference]: Without dead ends: 646 [2018-01-30 02:01:53,471 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:01:53,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2018-01-30 02:01:53,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 593. [2018-01-30 02:01:53,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2018-01-30 02:01:53,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 673 transitions. [2018-01-30 02:01:53,513 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 673 transitions. Word has length 164 [2018-01-30 02:01:53,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:01:53,514 INFO L432 AbstractCegarLoop]: Abstraction has 593 states and 673 transitions. [2018-01-30 02:01:53,514 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:01:53,514 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 673 transitions. [2018-01-30 02:01:53,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-01-30 02:01:53,519 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:01:53,519 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-30 02:01:53,519 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:01:53,519 INFO L82 PathProgramCache]: Analyzing trace with hash -568957419, now seen corresponding path program 1 times [2018-01-30 02:01:53,519 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:01:53,519 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:01:53,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:01:53,521 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:01:53,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:01:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:01:53,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:01:53,746 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:01:53,746 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:01:53,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:01:53,747 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:01:53,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:01:53,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:01:53,748 INFO L87 Difference]: Start difference. First operand 593 states and 673 transitions. Second operand 4 states. [2018-01-30 02:01:54,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:01:54,302 INFO L93 Difference]: Finished difference Result 1119 states and 1272 transitions. [2018-01-30 02:01:54,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:01:54,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2018-01-30 02:01:54,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:01:54,306 INFO L225 Difference]: With dead ends: 1119 [2018-01-30 02:01:54,306 INFO L226 Difference]: Without dead ends: 644 [2018-01-30 02:01:54,309 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 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 02:01:54,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2018-01-30 02:01:54,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 593. [2018-01-30 02:01:54,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2018-01-30 02:01:54,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 672 transitions. [2018-01-30 02:01:54,321 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 672 transitions. Word has length 199 [2018-01-30 02:01:54,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:01:54,322 INFO L432 AbstractCegarLoop]: Abstraction has 593 states and 672 transitions. [2018-01-30 02:01:54,322 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:01:54,322 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 672 transitions. [2018-01-30 02:01:54,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-01-30 02:01:54,324 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:01:54,324 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2018-01-30 02:01:54,324 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:01:54,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1456235709, now seen corresponding path program 1 times [2018-01-30 02:01:54,324 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:01:54,324 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:01:54,325 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:01:54,325 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:01:54,325 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:01:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:01:54,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:01:54,510 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:01:54,510 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:01:54,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:01:54,511 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:01:54,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:01:54,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:01:54,511 INFO L87 Difference]: Start difference. First operand 593 states and 672 transitions. Second operand 4 states. [2018-01-30 02:01:54,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:01:54,792 INFO L93 Difference]: Finished difference Result 1117 states and 1269 transitions. [2018-01-30 02:01:54,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:01:54,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2018-01-30 02:01:54,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:01:54,795 INFO L225 Difference]: With dead ends: 1117 [2018-01-30 02:01:54,795 INFO L226 Difference]: Without dead ends: 642 [2018-01-30 02:01:54,796 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 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 02:01:54,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2018-01-30 02:01:54,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 593. [2018-01-30 02:01:54,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2018-01-30 02:01:54,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 671 transitions. [2018-01-30 02:01:54,805 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 671 transitions. Word has length 200 [2018-01-30 02:01:54,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:01:54,805 INFO L432 AbstractCegarLoop]: Abstraction has 593 states and 671 transitions. [2018-01-30 02:01:54,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:01:54,805 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 671 transitions. [2018-01-30 02:01:54,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-01-30 02:01:54,807 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:01:54,807 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-30 02:01:54,807 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:01:54,807 INFO L82 PathProgramCache]: Analyzing trace with hash 473546052, now seen corresponding path program 1 times [2018-01-30 02:01:54,807 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:01:54,807 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:01:54,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:01:54,808 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:01:54,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:01:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:01:54,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:01:55,066 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:01:55,066 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:01:55,067 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 02:01:55,067 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 02:01:55,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 02:01:55,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:01:55,067 INFO L87 Difference]: Start difference. First operand 593 states and 671 transitions. Second operand 5 states. [2018-01-30 02:01:56,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:01:56,969 INFO L93 Difference]: Finished difference Result 1123 states and 1279 transitions. [2018-01-30 02:01:56,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 02:01:56,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 201 [2018-01-30 02:01:56,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:01:56,971 INFO L225 Difference]: With dead ends: 1123 [2018-01-30 02:01:56,971 INFO L226 Difference]: Without dead ends: 648 [2018-01-30 02:01:56,972 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-30 02:01:56,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2018-01-30 02:01:56,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 640. [2018-01-30 02:01:56,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-01-30 02:01:56,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 725 transitions. [2018-01-30 02:01:56,979 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 725 transitions. Word has length 201 [2018-01-30 02:01:56,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:01:56,980 INFO L432 AbstractCegarLoop]: Abstraction has 640 states and 725 transitions. [2018-01-30 02:01:56,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 02:01:56,980 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 725 transitions. [2018-01-30 02:01:56,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-01-30 02:01:56,981 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:01:56,981 INFO L350 BasicCegarLoop]: trace histogram [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 02:01:56,981 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:01:56,982 INFO L82 PathProgramCache]: Analyzing trace with hash 380316373, now seen corresponding path program 1 times [2018-01-30 02:01:56,982 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:01:56,982 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:01:56,983 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:01:56,983 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:01:56,983 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:01:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:01:56,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:01:57,148 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:01:57,148 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:01:57,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:01:57,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:01:57,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:01:57,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:01:57,149 INFO L87 Difference]: Start difference. First operand 640 states and 725 transitions. Second operand 4 states. [2018-01-30 02:01:57,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:01:57,421 INFO L93 Difference]: Finished difference Result 1206 states and 1370 transitions. [2018-01-30 02:01:57,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:01:57,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 202 [2018-01-30 02:01:57,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:01:57,423 INFO L225 Difference]: With dead ends: 1206 [2018-01-30 02:01:57,423 INFO L226 Difference]: Without dead ends: 684 [2018-01-30 02:01:57,423 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 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 02:01:57,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2018-01-30 02:01:57,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 640. [2018-01-30 02:01:57,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-01-30 02:01:57,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 724 transitions. [2018-01-30 02:01:57,430 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 724 transitions. Word has length 202 [2018-01-30 02:01:57,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:01:57,430 INFO L432 AbstractCegarLoop]: Abstraction has 640 states and 724 transitions. [2018-01-30 02:01:57,430 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:01:57,430 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 724 transitions. [2018-01-30 02:01:57,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-01-30 02:01:57,432 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:01:57,432 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-30 02:01:57,432 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:01:57,432 INFO L82 PathProgramCache]: Analyzing trace with hash 49668206, now seen corresponding path program 1 times [2018-01-30 02:01:57,432 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:01:57,432 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:01:57,433 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:01:57,433 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:01:57,433 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:01:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:01:57,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:01:57,544 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:01:57,544 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:01:57,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:01:57,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:01:57,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:01:57,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:01:57,545 INFO L87 Difference]: Start difference. First operand 640 states and 724 transitions. Second operand 4 states. [2018-01-30 02:01:57,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:01:57,725 INFO L93 Difference]: Finished difference Result 1205 states and 1368 transitions. [2018-01-30 02:01:57,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:01:57,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2018-01-30 02:01:57,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:01:57,727 INFO L225 Difference]: With dead ends: 1205 [2018-01-30 02:01:57,727 INFO L226 Difference]: Without dead ends: 683 [2018-01-30 02:01:57,728 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 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 02:01:57,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-01-30 02:01:57,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 640. [2018-01-30 02:01:57,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-01-30 02:01:57,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 723 transitions. [2018-01-30 02:01:57,734 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 723 transitions. Word has length 203 [2018-01-30 02:01:57,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:01:57,735 INFO L432 AbstractCegarLoop]: Abstraction has 640 states and 723 transitions. [2018-01-30 02:01:57,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:01:57,735 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 723 transitions. [2018-01-30 02:01:57,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-01-30 02:01:57,736 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:01:57,736 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-30 02:01:57,736 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:01:57,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1799356136, now seen corresponding path program 1 times [2018-01-30 02:01:57,736 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:01:57,736 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:01:57,737 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:01:57,737 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:01:57,737 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:01:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:01:57,746 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:01:57,967 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:01:57,967 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:01:57,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:01:57,968 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:01:57,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:01:57,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:01:57,968 INFO L87 Difference]: Start difference. First operand 640 states and 723 transitions. Second operand 4 states. [2018-01-30 02:01:58,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:01:58,177 INFO L93 Difference]: Finished difference Result 1204 states and 1366 transitions. [2018-01-30 02:01:58,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:01:58,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 205 [2018-01-30 02:01:58,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:01:58,179 INFO L225 Difference]: With dead ends: 1204 [2018-01-30 02:01:58,179 INFO L226 Difference]: Without dead ends: 682 [2018-01-30 02:01:58,180 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 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 02:01:58,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2018-01-30 02:01:58,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 640. [2018-01-30 02:01:58,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-01-30 02:01:58,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 722 transitions. [2018-01-30 02:01:58,192 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 722 transitions. Word has length 205 [2018-01-30 02:01:58,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:01:58,193 INFO L432 AbstractCegarLoop]: Abstraction has 640 states and 722 transitions. [2018-01-30 02:01:58,193 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:01:58,193 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 722 transitions. [2018-01-30 02:01:58,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-01-30 02:01:58,194 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:01:58,194 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-30 02:01:58,194 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:01:58,194 INFO L82 PathProgramCache]: Analyzing trace with hash 842176651, now seen corresponding path program 1 times [2018-01-30 02:01:58,194 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:01:58,194 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:01:58,195 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:01:58,195 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:01:58,195 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:01:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:01:58,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:01:58,377 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:01:58,377 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:01:58,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:01:58,377 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:01:58,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:01:58,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:01:58,378 INFO L87 Difference]: Start difference. First operand 640 states and 722 transitions. Second operand 4 states. [2018-01-30 02:01:58,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:01:58,559 INFO L93 Difference]: Finished difference Result 1196 states and 1357 transitions. [2018-01-30 02:01:58,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:01:58,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2018-01-30 02:01:58,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:01:58,561 INFO L225 Difference]: With dead ends: 1196 [2018-01-30 02:01:58,561 INFO L226 Difference]: Without dead ends: 674 [2018-01-30 02:01:58,562 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 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 02:01:58,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-01-30 02:01:58,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 640. [2018-01-30 02:01:58,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-01-30 02:01:58,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 721 transitions. [2018-01-30 02:01:58,582 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 721 transitions. Word has length 206 [2018-01-30 02:01:58,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:01:58,582 INFO L432 AbstractCegarLoop]: Abstraction has 640 states and 721 transitions. [2018-01-30 02:01:58,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:01:58,582 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 721 transitions. [2018-01-30 02:01:58,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-01-30 02:01:58,583 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:01:58,583 INFO L350 BasicCegarLoop]: trace histogram [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 02:01:58,583 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:01:58,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1157050899, now seen corresponding path program 1 times [2018-01-30 02:01:58,583 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:01:58,583 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:01:58,584 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:01:58,584 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:01:58,584 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:01:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:01:58,604 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:01:58,900 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:01:58,900 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:01:58,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:01:58,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:01:58,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:01:58,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:01:58,901 INFO L87 Difference]: Start difference. First operand 640 states and 721 transitions. Second operand 4 states. [2018-01-30 02:01:59,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:01:59,263 INFO L93 Difference]: Finished difference Result 1195 states and 1355 transitions. [2018-01-30 02:01:59,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:01:59,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2018-01-30 02:01:59,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:01:59,265 INFO L225 Difference]: With dead ends: 1195 [2018-01-30 02:01:59,265 INFO L226 Difference]: Without dead ends: 673 [2018-01-30 02:01:59,266 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:01:59,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-01-30 02:01:59,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 640. [2018-01-30 02:01:59,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-01-30 02:01:59,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 720 transitions. [2018-01-30 02:01:59,288 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 720 transitions. Word has length 208 [2018-01-30 02:01:59,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:01:59,288 INFO L432 AbstractCegarLoop]: Abstraction has 640 states and 720 transitions. [2018-01-30 02:01:59,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:01:59,288 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 720 transitions. [2018-01-30 02:01:59,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-01-30 02:01:59,289 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:01:59,289 INFO L350 BasicCegarLoop]: trace histogram [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 02:01:59,289 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:01:59,290 INFO L82 PathProgramCache]: Analyzing trace with hash -665566480, now seen corresponding path program 1 times [2018-01-30 02:01:59,290 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:01:59,290 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:01:59,290 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:01:59,291 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:01:59,291 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:01:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:01:59,317 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:01:59,475 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:01:59,475 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:01:59,475 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:01:59,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:01:59,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:01:59,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:01:59,476 INFO L87 Difference]: Start difference. First operand 640 states and 720 transitions. Second operand 4 states. [2018-01-30 02:01:59,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:01:59,651 INFO L93 Difference]: Finished difference Result 1172 states and 1329 transitions. [2018-01-30 02:01:59,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:01:59,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2018-01-30 02:01:59,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:01:59,652 INFO L225 Difference]: With dead ends: 1172 [2018-01-30 02:01:59,653 INFO L226 Difference]: Without dead ends: 650 [2018-01-30 02:01:59,653 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 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 02:01:59,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-01-30 02:01:59,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 640. [2018-01-30 02:01:59,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-01-30 02:01:59,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 719 transitions. [2018-01-30 02:01:59,669 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 719 transitions. Word has length 211 [2018-01-30 02:01:59,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:01:59,669 INFO L432 AbstractCegarLoop]: Abstraction has 640 states and 719 transitions. [2018-01-30 02:01:59,669 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:01:59,669 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 719 transitions. [2018-01-30 02:01:59,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-01-30 02:01:59,670 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:01:59,670 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2018-01-30 02:01:59,671 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:01:59,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1488459823, now seen corresponding path program 1 times [2018-01-30 02:01:59,671 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:01:59,671 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:01:59,672 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:01:59,682 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:01:59,682 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:01:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:01:59,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:01:59,770 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:01:59,770 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:01:59,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:01:59,770 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:01:59,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:01:59,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:01:59,771 INFO L87 Difference]: Start difference. First operand 640 states and 719 transitions. Second operand 3 states. [2018-01-30 02:02:00,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:00,062 INFO L93 Difference]: Finished difference Result 1168 states and 1324 transitions. [2018-01-30 02:02:00,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:02:00,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-01-30 02:02:00,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:00,064 INFO L225 Difference]: With dead ends: 1168 [2018-01-30 02:02:00,064 INFO L226 Difference]: Without dead ends: 646 [2018-01-30 02:02:00,065 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 02:02:00,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2018-01-30 02:02:00,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2018-01-30 02:02:00,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2018-01-30 02:02:00,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 725 transitions. [2018-01-30 02:02:00,071 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 725 transitions. Word has length 211 [2018-01-30 02:02:00,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:00,071 INFO L432 AbstractCegarLoop]: Abstraction has 646 states and 725 transitions. [2018-01-30 02:02:00,071 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:02:00,071 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 725 transitions. [2018-01-30 02:02:00,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-01-30 02:02:00,073 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:00,073 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2018-01-30 02:02:00,073 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:00,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1664192173, now seen corresponding path program 1 times [2018-01-30 02:02:00,073 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:00,073 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:00,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:00,074 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:00,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:00,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:00,189 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:02:00,189 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:00,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:02:00,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:02:00,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:02:00,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:02:00,190 INFO L87 Difference]: Start difference. First operand 646 states and 725 transitions. Second operand 3 states. [2018-01-30 02:02:00,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:00,339 INFO L93 Difference]: Finished difference Result 1672 states and 1903 transitions. [2018-01-30 02:02:00,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:02:00,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2018-01-30 02:02:00,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:00,342 INFO L225 Difference]: With dead ends: 1672 [2018-01-30 02:02:00,342 INFO L226 Difference]: Without dead ends: 1150 [2018-01-30 02:02:00,343 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 02:02:00,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2018-01-30 02:02:00,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1150. [2018-01-30 02:02:00,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1150 states. [2018-01-30 02:02:00,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1295 transitions. [2018-01-30 02:02:00,354 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1295 transitions. Word has length 212 [2018-01-30 02:02:00,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:00,354 INFO L432 AbstractCegarLoop]: Abstraction has 1150 states and 1295 transitions. [2018-01-30 02:02:00,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:02:00,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1295 transitions. [2018-01-30 02:02:00,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-01-30 02:02:00,355 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:00,356 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-01-30 02:02:00,356 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:00,356 INFO L82 PathProgramCache]: Analyzing trace with hash -698891003, now seen corresponding path program 1 times [2018-01-30 02:02:00,356 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:00,356 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:00,356 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:00,357 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:00,357 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:00,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:00,725 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:00,725 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:00,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:02:00,726 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:02:00,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:02:00,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:02:00,726 INFO L87 Difference]: Start difference. First operand 1150 states and 1295 transitions. Second operand 4 states. [2018-01-30 02:02:01,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:01,030 INFO L93 Difference]: Finished difference Result 2868 states and 3260 transitions. [2018-01-30 02:02:01,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:02:01,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 270 [2018-01-30 02:02:01,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:01,033 INFO L225 Difference]: With dead ends: 2868 [2018-01-30 02:02:01,034 INFO L226 Difference]: Without dead ends: 1842 [2018-01-30 02:02:01,035 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:02:01,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2018-01-30 02:02:01,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1311. [2018-01-30 02:02:01,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1311 states. [2018-01-30 02:02:01,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1498 transitions. [2018-01-30 02:02:01,051 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1498 transitions. Word has length 270 [2018-01-30 02:02:01,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:01,052 INFO L432 AbstractCegarLoop]: Abstraction has 1311 states and 1498 transitions. [2018-01-30 02:02:01,052 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:02:01,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1498 transitions. [2018-01-30 02:02:01,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-01-30 02:02:01,053 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:01,054 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-01-30 02:02:01,054 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:01,054 INFO L82 PathProgramCache]: Analyzing trace with hash -882929151, now seen corresponding path program 1 times [2018-01-30 02:02:01,054 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:01,054 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:01,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:01,055 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:01,055 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:01,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:01,366 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:01,366 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:01,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:02:01,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:02:01,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:02:01,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:02:01,367 INFO L87 Difference]: Start difference. First operand 1311 states and 1498 transitions. Second operand 4 states. [2018-01-30 02:02:01,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:01,586 INFO L93 Difference]: Finished difference Result 2655 states and 3051 transitions. [2018-01-30 02:02:01,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 02:02:01,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 270 [2018-01-30 02:02:01,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:01,588 INFO L225 Difference]: With dead ends: 2655 [2018-01-30 02:02:01,589 INFO L226 Difference]: Without dead ends: 1468 [2018-01-30 02:02:01,590 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 02:02:01,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2018-01-30 02:02:01,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1378. [2018-01-30 02:02:01,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1378 states. [2018-01-30 02:02:01,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1582 transitions. [2018-01-30 02:02:01,603 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1582 transitions. Word has length 270 [2018-01-30 02:02:01,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:01,603 INFO L432 AbstractCegarLoop]: Abstraction has 1378 states and 1582 transitions. [2018-01-30 02:02:01,603 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:02:01,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1582 transitions. [2018-01-30 02:02:01,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-01-30 02:02:01,605 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:01,605 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-01-30 02:02:01,605 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:01,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1604501312, now seen corresponding path program 1 times [2018-01-30 02:02:01,605 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:01,605 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:01,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:01,606 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:01,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:01,617 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:01,957 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:01,957 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:01,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:02:01,958 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:02:01,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:02:01,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:02:01,958 INFO L87 Difference]: Start difference. First operand 1378 states and 1582 transitions. Second operand 4 states. [2018-01-30 02:02:02,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:02,248 INFO L93 Difference]: Finished difference Result 3081 states and 3537 transitions. [2018-01-30 02:02:02,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:02:02,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 273 [2018-01-30 02:02:02,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:02,251 INFO L225 Difference]: With dead ends: 3081 [2018-01-30 02:02:02,251 INFO L226 Difference]: Without dead ends: 1827 [2018-01-30 02:02:02,252 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:02:02,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2018-01-30 02:02:02,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1384. [2018-01-30 02:02:02,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1384 states. [2018-01-30 02:02:02,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1588 transitions. [2018-01-30 02:02:02,266 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1588 transitions. Word has length 273 [2018-01-30 02:02:02,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:02,266 INFO L432 AbstractCegarLoop]: Abstraction has 1384 states and 1588 transitions. [2018-01-30 02:02:02,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:02:02,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1588 transitions. [2018-01-30 02:02:02,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-01-30 02:02:02,268 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:02,268 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:02,268 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:02,268 INFO L82 PathProgramCache]: Analyzing trace with hash -910658047, now seen corresponding path program 1 times [2018-01-30 02:02:02,268 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:02,268 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:02,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:02,269 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:02,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:02,281 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:02,555 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:02,555 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:02,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:02:02,555 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:02:02,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:02:02,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:02:02,556 INFO L87 Difference]: Start difference. First operand 1384 states and 1588 transitions. Second operand 6 states. [2018-01-30 02:02:03,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:03,299 INFO L93 Difference]: Finished difference Result 5038 states and 5796 transitions. [2018-01-30 02:02:03,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:02:03,299 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 283 [2018-01-30 02:02:03,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:03,305 INFO L225 Difference]: With dead ends: 5038 [2018-01-30 02:02:03,305 INFO L226 Difference]: Without dead ends: 3778 [2018-01-30 02:02:03,307 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-30 02:02:03,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3778 states. [2018-01-30 02:02:03,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3778 to 1514. [2018-01-30 02:02:03,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1514 states. [2018-01-30 02:02:03,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 1752 transitions. [2018-01-30 02:02:03,329 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 1752 transitions. Word has length 283 [2018-01-30 02:02:03,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:03,329 INFO L432 AbstractCegarLoop]: Abstraction has 1514 states and 1752 transitions. [2018-01-30 02:02:03,329 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:02:03,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1752 transitions. [2018-01-30 02:02:03,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-01-30 02:02:03,330 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:03,331 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:03,331 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:03,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1961975163, now seen corresponding path program 1 times [2018-01-30 02:02:03,331 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:03,331 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:03,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:03,332 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:03,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:03,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:03,546 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:03,546 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:03,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:02:03,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:02:03,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:02:03,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:02:03,547 INFO L87 Difference]: Start difference. First operand 1514 states and 1752 transitions. Second operand 6 states. [2018-01-30 02:02:04,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:04,125 INFO L93 Difference]: Finished difference Result 4415 states and 5120 transitions. [2018-01-30 02:02:04,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 02:02:04,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 283 [2018-01-30 02:02:04,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:04,130 INFO L225 Difference]: With dead ends: 4415 [2018-01-30 02:02:04,130 INFO L226 Difference]: Without dead ends: 3025 [2018-01-30 02:02:04,131 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-01-30 02:02:04,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3025 states. [2018-01-30 02:02:04,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3025 to 1528. [2018-01-30 02:02:04,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2018-01-30 02:02:04,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 1767 transitions. [2018-01-30 02:02:04,151 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 1767 transitions. Word has length 283 [2018-01-30 02:02:04,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:04,151 INFO L432 AbstractCegarLoop]: Abstraction has 1528 states and 1767 transitions. [2018-01-30 02:02:04,151 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:02:04,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 1767 transitions. [2018-01-30 02:02:04,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-01-30 02:02:04,153 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:04,153 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-01-30 02:02:04,153 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:04,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1291606260, now seen corresponding path program 1 times [2018-01-30 02:02:04,153 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:04,153 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:04,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:04,154 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:04,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:04,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:04,335 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:04,335 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:04,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:02:04,336 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:02:04,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:02:04,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:02:04,336 INFO L87 Difference]: Start difference. First operand 1528 states and 1767 transitions. Second operand 4 states. [2018-01-30 02:02:05,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:05,171 INFO L93 Difference]: Finished difference Result 3363 states and 3887 transitions. [2018-01-30 02:02:05,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:02:05,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 285 [2018-01-30 02:02:05,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:05,175 INFO L225 Difference]: With dead ends: 3363 [2018-01-30 02:02:05,175 INFO L226 Difference]: Without dead ends: 1959 [2018-01-30 02:02:05,176 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 02:02:05,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1959 states. [2018-01-30 02:02:05,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1959 to 1588. [2018-01-30 02:02:05,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2018-01-30 02:02:05,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 1845 transitions. [2018-01-30 02:02:05,193 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 1845 transitions. Word has length 285 [2018-01-30 02:02:05,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:05,193 INFO L432 AbstractCegarLoop]: Abstraction has 1588 states and 1845 transitions. [2018-01-30 02:02:05,193 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:02:05,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 1845 transitions. [2018-01-30 02:02:05,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-01-30 02:02:05,195 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:05,195 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:05,195 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:05,195 INFO L82 PathProgramCache]: Analyzing trace with hash -2135515964, now seen corresponding path program 1 times [2018-01-30 02:02:05,195 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:05,195 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:05,196 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:05,196 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:05,196 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:05,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:05,637 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:05,638 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:05,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:02:05,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:02:05,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:02:05,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:02:05,638 INFO L87 Difference]: Start difference. First operand 1588 states and 1845 transitions. Second operand 6 states. [2018-01-30 02:02:06,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:06,534 INFO L93 Difference]: Finished difference Result 5235 states and 6051 transitions. [2018-01-30 02:02:06,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:02:06,540 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 286 [2018-01-30 02:02:06,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:06,546 INFO L225 Difference]: With dead ends: 5235 [2018-01-30 02:02:06,546 INFO L226 Difference]: Without dead ends: 3771 [2018-01-30 02:02:06,548 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-30 02:02:06,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3771 states. [2018-01-30 02:02:06,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3771 to 1594. [2018-01-30 02:02:06,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1594 states. [2018-01-30 02:02:06,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 1851 transitions. [2018-01-30 02:02:06,568 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 1851 transitions. Word has length 286 [2018-01-30 02:02:06,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:06,569 INFO L432 AbstractCegarLoop]: Abstraction has 1594 states and 1851 transitions. [2018-01-30 02:02:06,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:02:06,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 1851 transitions. [2018-01-30 02:02:06,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-01-30 02:02:06,570 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:06,570 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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 02:02:06,570 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:06,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1214276713, now seen corresponding path program 1 times [2018-01-30 02:02:06,571 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:06,571 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:06,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:06,571 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:06,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:06,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:06,902 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:06,903 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:06,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:02:06,903 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:02:06,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:02:06,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:02:06,903 INFO L87 Difference]: Start difference. First operand 1594 states and 1851 transitions. Second operand 4 states. [2018-01-30 02:02:07,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:07,146 INFO L93 Difference]: Finished difference Result 3409 states and 3947 transitions. [2018-01-30 02:02:07,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:02:07,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 288 [2018-01-30 02:02:07,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:07,153 INFO L225 Difference]: With dead ends: 3409 [2018-01-30 02:02:07,153 INFO L226 Difference]: Without dead ends: 1939 [2018-01-30 02:02:07,154 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 02:02:07,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2018-01-30 02:02:07,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1600. [2018-01-30 02:02:07,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2018-01-30 02:02:07,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 1857 transitions. [2018-01-30 02:02:07,172 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 1857 transitions. Word has length 288 [2018-01-30 02:02:07,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:07,172 INFO L432 AbstractCegarLoop]: Abstraction has 1600 states and 1857 transitions. [2018-01-30 02:02:07,172 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:02:07,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 1857 transitions. [2018-01-30 02:02:07,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-01-30 02:02:07,174 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:07,174 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:07,174 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:07,174 INFO L82 PathProgramCache]: Analyzing trace with hash -406626672, now seen corresponding path program 1 times [2018-01-30 02:02:07,174 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:07,174 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:07,175 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:07,175 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:07,175 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:07,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:07,446 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:07,446 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:07,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:02:07,447 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:02:07,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:02:07,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:02:07,447 INFO L87 Difference]: Start difference. First operand 1600 states and 1857 transitions. Second operand 6 states. [2018-01-30 02:02:08,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:08,046 INFO L93 Difference]: Finished difference Result 5225 states and 6035 transitions. [2018-01-30 02:02:08,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:02:08,046 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 298 [2018-01-30 02:02:08,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:08,052 INFO L225 Difference]: With dead ends: 5225 [2018-01-30 02:02:08,052 INFO L226 Difference]: Without dead ends: 3749 [2018-01-30 02:02:08,054 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-30 02:02:08,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3749 states. [2018-01-30 02:02:08,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3749 to 1660. [2018-01-30 02:02:08,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1660 states. [2018-01-30 02:02:08,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 1935 transitions. [2018-01-30 02:02:08,075 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 1935 transitions. Word has length 298 [2018-01-30 02:02:08,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:08,075 INFO L432 AbstractCegarLoop]: Abstraction has 1660 states and 1935 transitions. [2018-01-30 02:02:08,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:02:08,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 1935 transitions. [2018-01-30 02:02:08,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-01-30 02:02:08,077 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:08,077 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:08,077 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:08,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1163047323, now seen corresponding path program 1 times [2018-01-30 02:02:08,077 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:08,077 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:08,078 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:08,078 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:08,078 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:08,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:08,589 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:08,589 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:08,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:02:08,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:02:08,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:02:08,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:02:08,590 INFO L87 Difference]: Start difference. First operand 1660 states and 1935 transitions. Second operand 6 states. [2018-01-30 02:02:09,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:09,220 INFO L93 Difference]: Finished difference Result 5259 states and 6083 transitions. [2018-01-30 02:02:09,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:02:09,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 301 [2018-01-30 02:02:09,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:09,225 INFO L225 Difference]: With dead ends: 5259 [2018-01-30 02:02:09,225 INFO L226 Difference]: Without dead ends: 3723 [2018-01-30 02:02:09,233 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-30 02:02:09,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2018-01-30 02:02:09,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 1492. [2018-01-30 02:02:09,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1492 states. [2018-01-30 02:02:09,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1717 transitions. [2018-01-30 02:02:09,258 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1717 transitions. Word has length 301 [2018-01-30 02:02:09,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:09,259 INFO L432 AbstractCegarLoop]: Abstraction has 1492 states and 1717 transitions. [2018-01-30 02:02:09,259 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:02:09,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1717 transitions. [2018-01-30 02:02:09,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-01-30 02:02:09,260 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:09,260 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:09,260 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:09,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1279517913, now seen corresponding path program 1 times [2018-01-30 02:02:09,261 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:09,261 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:09,261 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:09,261 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:09,261 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:09,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:09,451 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:09,451 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:09,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:02:09,452 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:02:09,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:02:09,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:02:09,452 INFO L87 Difference]: Start difference. First operand 1492 states and 1717 transitions. Second operand 4 states. [2018-01-30 02:02:09,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:09,677 INFO L93 Difference]: Finished difference Result 3369 states and 3891 transitions. [2018-01-30 02:02:09,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:02:09,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2018-01-30 02:02:09,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:09,680 INFO L225 Difference]: With dead ends: 3369 [2018-01-30 02:02:09,680 INFO L226 Difference]: Without dead ends: 2001 [2018-01-30 02:02:09,681 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 02:02:09,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2018-01-30 02:02:09,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 1534. [2018-01-30 02:02:09,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1534 states. [2018-01-30 02:02:09,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1534 states and 1771 transitions. [2018-01-30 02:02:09,700 INFO L78 Accepts]: Start accepts. Automaton has 1534 states and 1771 transitions. Word has length 306 [2018-01-30 02:02:09,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:09,700 INFO L432 AbstractCegarLoop]: Abstraction has 1534 states and 1771 transitions. [2018-01-30 02:02:09,700 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:02:09,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 1771 transitions. [2018-01-30 02:02:09,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-01-30 02:02:09,702 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:09,702 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:09,702 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:09,702 INFO L82 PathProgramCache]: Analyzing trace with hash 117578275, now seen corresponding path program 1 times [2018-01-30 02:02:09,702 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:09,702 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:09,703 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:09,703 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:09,703 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:09,711 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:09,988 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:09,988 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:09,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:02:09,988 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:02:09,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:02:09,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:02:09,989 INFO L87 Difference]: Start difference. First operand 1534 states and 1771 transitions. Second operand 4 states. [2018-01-30 02:02:10,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:10,172 INFO L93 Difference]: Finished difference Result 3066 states and 3556 transitions. [2018-01-30 02:02:10,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:02:10,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2018-01-30 02:02:10,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:10,174 INFO L225 Difference]: With dead ends: 3066 [2018-01-30 02:02:10,174 INFO L226 Difference]: Without dead ends: 1656 [2018-01-30 02:02:10,175 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 02:02:10,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2018-01-30 02:02:10,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1555. [2018-01-30 02:02:10,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 02:02:10,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1798 transitions. [2018-01-30 02:02:10,194 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1798 transitions. Word has length 306 [2018-01-30 02:02:10,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:10,194 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1798 transitions. [2018-01-30 02:02:10,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:02:10,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1798 transitions. [2018-01-30 02:02:10,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-01-30 02:02:10,195 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:10,195 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:10,196 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:10,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1592573511, now seen corresponding path program 1 times [2018-01-30 02:02:10,196 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:10,196 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:10,196 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:10,196 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:10,196 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:10,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:10,429 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:10,430 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:10,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:02:10,430 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:02:10,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:02:10,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:02:10,430 INFO L87 Difference]: Start difference. First operand 1555 states and 1798 transitions. Second operand 4 states. [2018-01-30 02:02:10,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:10,697 INFO L93 Difference]: Finished difference Result 3451 states and 3995 transitions. [2018-01-30 02:02:10,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:02:10,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2018-01-30 02:02:10,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:10,699 INFO L225 Difference]: With dead ends: 3451 [2018-01-30 02:02:10,699 INFO L226 Difference]: Without dead ends: 2020 [2018-01-30 02:02:10,701 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 02:02:10,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states. [2018-01-30 02:02:10,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 1555. [2018-01-30 02:02:10,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 02:02:10,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1796 transitions. [2018-01-30 02:02:10,744 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1796 transitions. Word has length 308 [2018-01-30 02:02:10,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:10,744 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1796 transitions. [2018-01-30 02:02:10,744 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:02:10,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1796 transitions. [2018-01-30 02:02:10,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-01-30 02:02:10,752 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:10,752 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:10,752 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:10,752 INFO L82 PathProgramCache]: Analyzing trace with hash 987066805, now seen corresponding path program 1 times [2018-01-30 02:02:10,752 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:10,753 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:10,753 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:10,753 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:10,753 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:10,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:11,083 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:11,084 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:11,084 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:02:11,084 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:02:11,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:02:11,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:02:11,084 INFO L87 Difference]: Start difference. First operand 1555 states and 1796 transitions. Second operand 4 states. [2018-01-30 02:02:11,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:11,516 INFO L93 Difference]: Finished difference Result 3086 states and 3577 transitions. [2018-01-30 02:02:11,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:02:11,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2018-01-30 02:02:11,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:11,518 INFO L225 Difference]: With dead ends: 3086 [2018-01-30 02:02:11,518 INFO L226 Difference]: Without dead ends: 1655 [2018-01-30 02:02:11,519 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:02:11,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2018-01-30 02:02:11,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1555. [2018-01-30 02:02:11,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 02:02:11,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1795 transitions. [2018-01-30 02:02:11,540 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1795 transitions. Word has length 308 [2018-01-30 02:02:11,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:11,540 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1795 transitions. [2018-01-30 02:02:11,540 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:02:11,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1795 transitions. [2018-01-30 02:02:11,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-01-30 02:02:11,541 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:11,542 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-30 02:02:11,542 INFO L371 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:11,542 INFO L82 PathProgramCache]: Analyzing trace with hash -980376054, now seen corresponding path program 1 times [2018-01-30 02:02:11,542 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:11,542 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:11,542 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:11,543 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:11,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:11,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:11,918 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:11,918 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:11,919 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:02:11,919 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:02:11,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:02:11,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:02:11,919 INFO L87 Difference]: Start difference. First operand 1555 states and 1795 transitions. Second operand 4 states. [2018-01-30 02:02:12,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:12,302 INFO L93 Difference]: Finished difference Result 3449 states and 3987 transitions. [2018-01-30 02:02:12,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:02:12,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 309 [2018-01-30 02:02:12,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:12,305 INFO L225 Difference]: With dead ends: 3449 [2018-01-30 02:02:12,305 INFO L226 Difference]: Without dead ends: 2018 [2018-01-30 02:02:12,306 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:02:12,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2018-01-30 02:02:12,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 1555. [2018-01-30 02:02:12,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 02:02:12,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1793 transitions. [2018-01-30 02:02:12,327 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1793 transitions. Word has length 309 [2018-01-30 02:02:12,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:12,327 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1793 transitions. [2018-01-30 02:02:12,327 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:02:12,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1793 transitions. [2018-01-30 02:02:12,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-01-30 02:02:12,328 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:12,329 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-30 02:02:12,329 INFO L371 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:12,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1679062414, now seen corresponding path program 1 times [2018-01-30 02:02:12,329 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:12,329 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:12,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:12,329 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:12,330 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:12,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:12,531 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:12,531 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:02:12,531 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:02:12,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:02:12,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:02:12,531 INFO L87 Difference]: Start difference. First operand 1555 states and 1793 transitions. Second operand 4 states. [2018-01-30 02:02:12,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:12,714 INFO L93 Difference]: Finished difference Result 3085 states and 3570 transitions. [2018-01-30 02:02:12,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:02:12,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 309 [2018-01-30 02:02:12,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:12,715 INFO L225 Difference]: With dead ends: 3085 [2018-01-30 02:02:12,715 INFO L226 Difference]: Without dead ends: 1654 [2018-01-30 02:02:12,716 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 02:02:12,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2018-01-30 02:02:12,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1555. [2018-01-30 02:02:12,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 02:02:12,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1792 transitions. [2018-01-30 02:02:12,743 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1792 transitions. Word has length 309 [2018-01-30 02:02:12,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:12,743 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1792 transitions. [2018-01-30 02:02:12,743 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:02:12,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1792 transitions. [2018-01-30 02:02:12,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-01-30 02:02:12,744 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:12,745 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:12,745 INFO L371 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:12,745 INFO L82 PathProgramCache]: Analyzing trace with hash 465555380, now seen corresponding path program 1 times [2018-01-30 02:02:12,745 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:12,745 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:12,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:12,746 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:12,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:12,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:12,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:12,933 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:12,933 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:12,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:02:12,933 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:02:12,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:02:12,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:02:12,934 INFO L87 Difference]: Start difference. First operand 1555 states and 1792 transitions. Second operand 4 states. [2018-01-30 02:02:13,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:13,190 INFO L93 Difference]: Finished difference Result 3447 states and 3979 transitions. [2018-01-30 02:02:13,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:02:13,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 311 [2018-01-30 02:02:13,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:13,192 INFO L225 Difference]: With dead ends: 3447 [2018-01-30 02:02:13,192 INFO L226 Difference]: Without dead ends: 2016 [2018-01-30 02:02:13,193 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 02:02:13,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2016 states. [2018-01-30 02:02:13,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2016 to 1555. [2018-01-30 02:02:13,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 02:02:13,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1790 transitions. [2018-01-30 02:02:13,215 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1790 transitions. Word has length 311 [2018-01-30 02:02:13,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:13,215 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1790 transitions. [2018-01-30 02:02:13,215 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:02:13,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1790 transitions. [2018-01-30 02:02:13,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-01-30 02:02:13,217 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:13,217 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:13,217 INFO L371 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:13,217 INFO L82 PathProgramCache]: Analyzing trace with hash 680382008, now seen corresponding path program 1 times [2018-01-30 02:02:13,217 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:13,217 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:13,218 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:13,218 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:13,218 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:13,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:13,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:13,361 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:13,361 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:13,361 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:02:13,362 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:02:13,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:02:13,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:02:13,362 INFO L87 Difference]: Start difference. First operand 1555 states and 1790 transitions. Second operand 4 states. [2018-01-30 02:02:13,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:13,553 INFO L93 Difference]: Finished difference Result 3084 states and 3563 transitions. [2018-01-30 02:02:13,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:02:13,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 311 [2018-01-30 02:02:13,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:13,554 INFO L225 Difference]: With dead ends: 3084 [2018-01-30 02:02:13,554 INFO L226 Difference]: Without dead ends: 1653 [2018-01-30 02:02:13,555 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 02:02:13,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2018-01-30 02:02:13,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1555. [2018-01-30 02:02:13,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 02:02:13,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1789 transitions. [2018-01-30 02:02:13,575 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1789 transitions. Word has length 311 [2018-01-30 02:02:13,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:13,575 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1789 transitions. [2018-01-30 02:02:13,575 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:02:13,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1789 transitions. [2018-01-30 02:02:13,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-01-30 02:02:13,577 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:13,577 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-30 02:02:13,577 INFO L371 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:13,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1960010385, now seen corresponding path program 1 times [2018-01-30 02:02:13,577 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:13,577 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:13,578 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:13,578 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:13,578 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:13,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:13,761 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:13,761 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:13,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:02:13,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:02:13,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:02:13,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:02:13,762 INFO L87 Difference]: Start difference. First operand 1555 states and 1789 transitions. Second operand 4 states. [2018-01-30 02:02:14,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:14,000 INFO L93 Difference]: Finished difference Result 3431 states and 3957 transitions. [2018-01-30 02:02:14,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:02:14,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 312 [2018-01-30 02:02:14,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:14,001 INFO L225 Difference]: With dead ends: 3431 [2018-01-30 02:02:14,001 INFO L226 Difference]: Without dead ends: 2000 [2018-01-30 02:02:14,003 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 02:02:14,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2018-01-30 02:02:14,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1555. [2018-01-30 02:02:14,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 02:02:14,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1787 transitions. [2018-01-30 02:02:14,024 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1787 transitions. Word has length 312 [2018-01-30 02:02:14,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:14,025 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1787 transitions. [2018-01-30 02:02:14,025 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:02:14,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1787 transitions. [2018-01-30 02:02:14,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-01-30 02:02:14,026 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:14,026 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-30 02:02:14,026 INFO L371 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:14,027 INFO L82 PathProgramCache]: Analyzing trace with hash 404647787, now seen corresponding path program 1 times [2018-01-30 02:02:14,027 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:14,027 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:14,027 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:14,027 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:14,027 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:14,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:14,253 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:14,253 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:14,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:02:14,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:02:14,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:02:14,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:02:14,253 INFO L87 Difference]: Start difference. First operand 1555 states and 1787 transitions. Second operand 4 states. [2018-01-30 02:02:14,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:14,446 INFO L93 Difference]: Finished difference Result 3076 states and 3549 transitions. [2018-01-30 02:02:14,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:02:14,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 312 [2018-01-30 02:02:14,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:14,448 INFO L225 Difference]: With dead ends: 3076 [2018-01-30 02:02:14,448 INFO L226 Difference]: Without dead ends: 1645 [2018-01-30 02:02:14,449 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 02:02:14,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2018-01-30 02:02:14,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1555. [2018-01-30 02:02:14,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 02:02:14,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1786 transitions. [2018-01-30 02:02:14,469 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1786 transitions. Word has length 312 [2018-01-30 02:02:14,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:14,470 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1786 transitions. [2018-01-30 02:02:14,470 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:02:14,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1786 transitions. [2018-01-30 02:02:14,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-01-30 02:02:14,471 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:14,471 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:14,471 INFO L371 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:14,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1114297903, now seen corresponding path program 1 times [2018-01-30 02:02:14,471 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:14,471 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:14,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:14,472 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:14,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:14,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:14,656 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:14,656 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:14,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:02:14,656 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:02:14,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:02:14,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:02:14,656 INFO L87 Difference]: Start difference. First operand 1555 states and 1786 transitions. Second operand 4 states. [2018-01-30 02:02:14,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:14,888 INFO L93 Difference]: Finished difference Result 3429 states and 3949 transitions. [2018-01-30 02:02:14,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:02:14,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 314 [2018-01-30 02:02:14,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:14,889 INFO L225 Difference]: With dead ends: 3429 [2018-01-30 02:02:14,889 INFO L226 Difference]: Without dead ends: 1998 [2018-01-30 02:02:14,891 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 02:02:14,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2018-01-30 02:02:14,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1555. [2018-01-30 02:02:14,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 02:02:14,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1784 transitions. [2018-01-30 02:02:14,912 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1784 transitions. Word has length 314 [2018-01-30 02:02:14,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:14,912 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1784 transitions. [2018-01-30 02:02:14,912 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:02:14,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1784 transitions. [2018-01-30 02:02:14,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-01-30 02:02:14,913 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:14,913 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:14,913 INFO L371 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:14,914 INFO L82 PathProgramCache]: Analyzing trace with hash -715494195, now seen corresponding path program 1 times [2018-01-30 02:02:14,914 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:14,914 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:14,914 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:14,914 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:14,914 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:14,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:15,033 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:15,033 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:15,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:02:15,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:02:15,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:02:15,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:02:15,034 INFO L87 Difference]: Start difference. First operand 1555 states and 1784 transitions. Second operand 4 states. [2018-01-30 02:02:15,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:15,204 INFO L93 Difference]: Finished difference Result 3075 states and 3542 transitions. [2018-01-30 02:02:15,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:02:15,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 314 [2018-01-30 02:02:15,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:15,205 INFO L225 Difference]: With dead ends: 3075 [2018-01-30 02:02:15,206 INFO L226 Difference]: Without dead ends: 1644 [2018-01-30 02:02:15,206 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 02:02:15,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2018-01-30 02:02:15,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1555. [2018-01-30 02:02:15,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 02:02:15,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1783 transitions. [2018-01-30 02:02:15,227 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1783 transitions. Word has length 314 [2018-01-30 02:02:15,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:15,227 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1783 transitions. [2018-01-30 02:02:15,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:02:15,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1783 transitions. [2018-01-30 02:02:15,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-01-30 02:02:15,229 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:15,229 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:15,229 INFO L371 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:15,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1678617740, now seen corresponding path program 1 times [2018-01-30 02:02:15,229 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:15,229 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:15,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:15,230 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:15,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:15,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:15,429 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:15,429 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:15,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:02:15,429 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:02:15,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:02:15,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:02:15,429 INFO L87 Difference]: Start difference. First operand 1555 states and 1783 transitions. Second operand 4 states. [2018-01-30 02:02:15,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:15,651 INFO L93 Difference]: Finished difference Result 3383 states and 3893 transitions. [2018-01-30 02:02:15,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:02:15,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 317 [2018-01-30 02:02:15,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:15,652 INFO L225 Difference]: With dead ends: 3383 [2018-01-30 02:02:15,653 INFO L226 Difference]: Without dead ends: 1952 [2018-01-30 02:02:15,654 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 02:02:15,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1952 states. [2018-01-30 02:02:15,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1952 to 1555. [2018-01-30 02:02:15,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 02:02:15,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1781 transitions. [2018-01-30 02:02:15,676 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1781 transitions. Word has length 317 [2018-01-30 02:02:15,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:15,676 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1781 transitions. [2018-01-30 02:02:15,676 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:02:15,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1781 transitions. [2018-01-30 02:02:15,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-01-30 02:02:15,677 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:15,677 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2018-01-30 02:02:15,677 INFO L371 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:15,677 INFO L82 PathProgramCache]: Analyzing trace with hash 855724397, now seen corresponding path program 1 times [2018-01-30 02:02:15,678 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:15,678 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:15,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:15,678 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:15,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:15,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:16,012 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:16,013 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:16,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:02:16,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:02:16,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:02:16,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:02:16,013 INFO L87 Difference]: Start difference. First operand 1555 states and 1781 transitions. Second operand 4 states. [2018-01-30 02:02:16,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:16,234 INFO L93 Difference]: Finished difference Result 3381 states and 3887 transitions. [2018-01-30 02:02:16,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:02:16,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 317 [2018-01-30 02:02:16,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:16,235 INFO L225 Difference]: With dead ends: 3381 [2018-01-30 02:02:16,235 INFO L226 Difference]: Without dead ends: 1950 [2018-01-30 02:02:16,236 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:02:16,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2018-01-30 02:02:16,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1561. [2018-01-30 02:02:16,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2018-01-30 02:02:16,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 1787 transitions. [2018-01-30 02:02:16,258 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 1787 transitions. Word has length 317 [2018-01-30 02:02:16,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:16,258 INFO L432 AbstractCegarLoop]: Abstraction has 1561 states and 1787 transitions. [2018-01-30 02:02:16,258 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:02:16,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1787 transitions. [2018-01-30 02:02:16,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-01-30 02:02:16,260 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:16,260 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:16,260 INFO L371 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:16,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1734625264, now seen corresponding path program 1 times [2018-01-30 02:02:16,260 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:16,260 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:16,261 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:16,261 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:16,261 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:16,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:16,401 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:16,401 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:16,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:02:16,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:02:16,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:02:16,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:02:16,402 INFO L87 Difference]: Start difference. First operand 1561 states and 1787 transitions. Second operand 4 states. [2018-01-30 02:02:16,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:16,578 INFO L93 Difference]: Finished difference Result 3064 states and 3523 transitions. [2018-01-30 02:02:16,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:02:16,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 317 [2018-01-30 02:02:16,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:16,580 INFO L225 Difference]: With dead ends: 3064 [2018-01-30 02:02:16,580 INFO L226 Difference]: Without dead ends: 1627 [2018-01-30 02:02:16,581 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 02:02:16,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2018-01-30 02:02:16,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1561. [2018-01-30 02:02:16,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2018-01-30 02:02:16,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 1786 transitions. [2018-01-30 02:02:16,605 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 1786 transitions. Word has length 317 [2018-01-30 02:02:16,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:16,605 INFO L432 AbstractCegarLoop]: Abstraction has 1561 states and 1786 transitions. [2018-01-30 02:02:16,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:02:16,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1786 transitions. [2018-01-30 02:02:16,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-01-30 02:02:16,607 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:16,607 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2018-01-30 02:02:16,607 INFO L371 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:16,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1737448689, now seen corresponding path program 1 times [2018-01-30 02:02:16,607 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:16,607 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:16,608 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:16,608 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:16,608 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:16,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:16,732 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:16,732 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:16,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:02:16,732 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:02:16,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:02:16,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:02:16,733 INFO L87 Difference]: Start difference. First operand 1561 states and 1786 transitions. Second operand 4 states. [2018-01-30 02:02:16,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:16,906 INFO L93 Difference]: Finished difference Result 3063 states and 3520 transitions. [2018-01-30 02:02:16,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:02:16,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 317 [2018-01-30 02:02:16,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:16,907 INFO L225 Difference]: With dead ends: 3063 [2018-01-30 02:02:16,907 INFO L226 Difference]: Without dead ends: 1626 [2018-01-30 02:02:16,908 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 02:02:16,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2018-01-30 02:02:16,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1564. [2018-01-30 02:02:16,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2018-01-30 02:02:16,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 1789 transitions. [2018-01-30 02:02:16,930 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 1789 transitions. Word has length 317 [2018-01-30 02:02:16,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:16,930 INFO L432 AbstractCegarLoop]: Abstraction has 1564 states and 1789 transitions. [2018-01-30 02:02:16,930 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:02:16,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 1789 transitions. [2018-01-30 02:02:16,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-01-30 02:02:16,932 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:16,932 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:16,932 INFO L371 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:16,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1880545483, now seen corresponding path program 1 times [2018-01-30 02:02:16,932 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:16,932 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:16,933 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:16,933 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:16,933 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:16,942 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:17,154 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:17,154 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:17,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:02:17,155 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:02:17,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:02:17,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:02:17,155 INFO L87 Difference]: Start difference. First operand 1564 states and 1789 transitions. Second operand 6 states. [2018-01-30 02:02:17,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:17,862 INFO L93 Difference]: Finished difference Result 4935 states and 5623 transitions. [2018-01-30 02:02:17,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:02:17,862 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 318 [2018-01-30 02:02:17,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:17,864 INFO L225 Difference]: With dead ends: 4935 [2018-01-30 02:02:17,864 INFO L226 Difference]: Without dead ends: 3495 [2018-01-30 02:02:17,866 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:02:17,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3495 states. [2018-01-30 02:02:17,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3495 to 1564. [2018-01-30 02:02:17,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2018-01-30 02:02:17,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 1787 transitions. [2018-01-30 02:02:17,893 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 1787 transitions. Word has length 318 [2018-01-30 02:02:17,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:17,893 INFO L432 AbstractCegarLoop]: Abstraction has 1564 states and 1787 transitions. [2018-01-30 02:02:17,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:02:17,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 1787 transitions. [2018-01-30 02:02:17,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-01-30 02:02:17,895 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:17,895 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:17,895 INFO L371 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:17,895 INFO L82 PathProgramCache]: Analyzing trace with hash -316896207, now seen corresponding path program 1 times [2018-01-30 02:02:17,895 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:17,895 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:17,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:17,896 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:17,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:17,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:17,905 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:18,052 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:18,053 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:18,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:02:18,053 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:02:18,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:02:18,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:02:18,053 INFO L87 Difference]: Start difference. First operand 1564 states and 1787 transitions. Second operand 6 states. [2018-01-30 02:02:18,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:18,450 INFO L93 Difference]: Finished difference Result 4465 states and 5115 transitions. [2018-01-30 02:02:18,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:02:18,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 318 [2018-01-30 02:02:18,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:18,452 INFO L225 Difference]: With dead ends: 4465 [2018-01-30 02:02:18,452 INFO L226 Difference]: Without dead ends: 3025 [2018-01-30 02:02:18,453 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:02:18,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3025 states. [2018-01-30 02:02:18,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3025 to 1564. [2018-01-30 02:02:18,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2018-01-30 02:02:18,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 1786 transitions. [2018-01-30 02:02:18,482 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 1786 transitions. Word has length 318 [2018-01-30 02:02:18,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:18,482 INFO L432 AbstractCegarLoop]: Abstraction has 1564 states and 1786 transitions. [2018-01-30 02:02:18,483 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:02:18,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 1786 transitions. [2018-01-30 02:02:18,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-01-30 02:02:18,484 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:18,484 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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 02:02:18,484 INFO L371 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:18,484 INFO L82 PathProgramCache]: Analyzing trace with hash 834207267, now seen corresponding path program 1 times [2018-01-30 02:02:18,484 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:18,484 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:18,485 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:18,485 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:18,485 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:18,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:18,750 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:18,750 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:18,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:02:18,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:02:18,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:02:18,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:02:18,751 INFO L87 Difference]: Start difference. First operand 1564 states and 1786 transitions. Second operand 6 states. [2018-01-30 02:02:19,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:19,395 INFO L93 Difference]: Finished difference Result 4931 states and 5613 transitions. [2018-01-30 02:02:19,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:02:19,395 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 319 [2018-01-30 02:02:19,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:19,397 INFO L225 Difference]: With dead ends: 4931 [2018-01-30 02:02:19,397 INFO L226 Difference]: Without dead ends: 3491 [2018-01-30 02:02:19,399 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:02:19,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3491 states. [2018-01-30 02:02:19,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3491 to 1564. [2018-01-30 02:02:19,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2018-01-30 02:02:19,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 1784 transitions. [2018-01-30 02:02:19,429 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 1784 transitions. Word has length 319 [2018-01-30 02:02:19,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:19,430 INFO L432 AbstractCegarLoop]: Abstraction has 1564 states and 1784 transitions. [2018-01-30 02:02:19,430 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:02:19,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 1784 transitions. [2018-01-30 02:02:19,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-01-30 02:02:19,431 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:19,431 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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 02:02:19,431 INFO L371 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:19,432 INFO L82 PathProgramCache]: Analyzing trace with hash 2062694567, now seen corresponding path program 1 times [2018-01-30 02:02:19,432 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:19,432 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:19,432 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:19,432 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:19,432 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:19,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:19,598 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:19,598 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:19,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:02:19,599 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:02:19,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:02:19,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:02:19,599 INFO L87 Difference]: Start difference. First operand 1564 states and 1784 transitions. Second operand 6 states. [2018-01-30 02:02:20,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:20,171 INFO L93 Difference]: Finished difference Result 4463 states and 5107 transitions. [2018-01-30 02:02:20,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:02:20,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 319 [2018-01-30 02:02:20,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:20,173 INFO L225 Difference]: With dead ends: 4463 [2018-01-30 02:02:20,173 INFO L226 Difference]: Without dead ends: 3023 [2018-01-30 02:02:20,175 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:02:20,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3023 states. [2018-01-30 02:02:20,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3023 to 1564. [2018-01-30 02:02:20,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2018-01-30 02:02:20,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 1783 transitions. [2018-01-30 02:02:20,205 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 1783 transitions. Word has length 319 [2018-01-30 02:02:20,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:20,205 INFO L432 AbstractCegarLoop]: Abstraction has 1564 states and 1783 transitions. [2018-01-30 02:02:20,205 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:02:20,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 1783 transitions. [2018-01-30 02:02:20,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-01-30 02:02:20,206 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:20,206 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-01-30 02:02:20,206 INFO L371 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:20,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1597638454, now seen corresponding path program 1 times [2018-01-30 02:02:20,207 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:20,207 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:20,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:20,207 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:20,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:20,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:20,421 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:20,421 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:20,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:02:20,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:02:20,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:02:20,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:02:20,422 INFO L87 Difference]: Start difference. First operand 1564 states and 1783 transitions. Second operand 4 states. [2018-01-30 02:02:20,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:20,663 INFO L93 Difference]: Finished difference Result 3391 states and 3881 transitions. [2018-01-30 02:02:20,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:02:20,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 320 [2018-01-30 02:02:20,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:20,664 INFO L225 Difference]: With dead ends: 3391 [2018-01-30 02:02:20,664 INFO L226 Difference]: Without dead ends: 1951 [2018-01-30 02:02:20,665 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 02:02:20,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2018-01-30 02:02:20,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1570. [2018-01-30 02:02:20,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2018-01-30 02:02:20,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 1789 transitions. [2018-01-30 02:02:20,695 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 1789 transitions. Word has length 320 [2018-01-30 02:02:20,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:20,695 INFO L432 AbstractCegarLoop]: Abstraction has 1570 states and 1789 transitions. [2018-01-30 02:02:20,695 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:02:20,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 1789 transitions. [2018-01-30 02:02:20,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-01-30 02:02:20,696 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:20,697 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-01-30 02:02:20,697 INFO L371 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:20,697 INFO L82 PathProgramCache]: Analyzing trace with hash 2125729478, now seen corresponding path program 1 times [2018-01-30 02:02:20,697 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:20,697 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:20,697 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:20,697 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:20,697 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:20,705 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:20,913 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:20,913 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:20,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:02:20,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:02:20,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:02:20,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:02:20,914 INFO L87 Difference]: Start difference. First operand 1570 states and 1789 transitions. Second operand 4 states. [2018-01-30 02:02:21,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:21,097 INFO L93 Difference]: Finished difference Result 3077 states and 3521 transitions. [2018-01-30 02:02:21,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:02:21,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 320 [2018-01-30 02:02:21,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:21,098 INFO L225 Difference]: With dead ends: 3077 [2018-01-30 02:02:21,098 INFO L226 Difference]: Without dead ends: 1631 [2018-01-30 02:02:21,099 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 02:02:21,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2018-01-30 02:02:21,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1573. [2018-01-30 02:02:21,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2018-01-30 02:02:21,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 1792 transitions. [2018-01-30 02:02:21,126 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 1792 transitions. Word has length 320 [2018-01-30 02:02:21,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:21,126 INFO L432 AbstractCegarLoop]: Abstraction has 1573 states and 1792 transitions. [2018-01-30 02:02:21,126 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:02:21,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1792 transitions. [2018-01-30 02:02:21,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-01-30 02:02:21,128 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:21,128 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:21,128 INFO L371 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:21,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1822206539, now seen corresponding path program 1 times [2018-01-30 02:02:21,128 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:21,128 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:21,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:21,129 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:21,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:21,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:21,329 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:21,329 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:21,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:02:21,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:02:21,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:02:21,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:02:21,330 INFO L87 Difference]: Start difference. First operand 1573 states and 1792 transitions. Second operand 6 states. [2018-01-30 02:02:22,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:22,110 INFO L93 Difference]: Finished difference Result 4945 states and 5618 transitions. [2018-01-30 02:02:22,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:02:22,110 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 321 [2018-01-30 02:02:22,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:22,112 INFO L225 Difference]: With dead ends: 4945 [2018-01-30 02:02:22,112 INFO L226 Difference]: Without dead ends: 3496 [2018-01-30 02:02:22,114 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:02:22,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3496 states. [2018-01-30 02:02:22,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3496 to 1573. [2018-01-30 02:02:22,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2018-01-30 02:02:22,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 1790 transitions. [2018-01-30 02:02:22,148 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 1790 transitions. Word has length 321 [2018-01-30 02:02:22,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:22,148 INFO L432 AbstractCegarLoop]: Abstraction has 1573 states and 1790 transitions. [2018-01-30 02:02:22,148 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:02:22,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1790 transitions. [2018-01-30 02:02:22,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-01-30 02:02:22,149 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:22,150 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:22,150 INFO L371 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:22,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1933049657, now seen corresponding path program 1 times [2018-01-30 02:02:22,150 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:22,150 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:22,150 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:22,150 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:22,150 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:22,159 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:22,382 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:22,382 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:22,382 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:02:22,382 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:02:22,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:02:22,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:02:22,383 INFO L87 Difference]: Start difference. First operand 1573 states and 1790 transitions. Second operand 6 states. [2018-01-30 02:02:22,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:22,925 INFO L93 Difference]: Finished difference Result 4479 states and 5114 transitions. [2018-01-30 02:02:22,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:02:22,926 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 321 [2018-01-30 02:02:22,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:22,927 INFO L225 Difference]: With dead ends: 4479 [2018-01-30 02:02:22,927 INFO L226 Difference]: Without dead ends: 3030 [2018-01-30 02:02:22,928 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:02:22,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2018-01-30 02:02:22,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 1573. [2018-01-30 02:02:22,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2018-01-30 02:02:22,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 1789 transitions. [2018-01-30 02:02:22,961 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 1789 transitions. Word has length 321 [2018-01-30 02:02:22,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:22,961 INFO L432 AbstractCegarLoop]: Abstraction has 1573 states and 1789 transitions. [2018-01-30 02:02:22,961 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:02:22,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1789 transitions. [2018-01-30 02:02:22,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-01-30 02:02:22,962 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:22,962 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 02:02:22,962 INFO L371 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:22,963 INFO L82 PathProgramCache]: Analyzing trace with hash 490934670, now seen corresponding path program 1 times [2018-01-30 02:02:22,963 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:22,963 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:22,963 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:22,963 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:22,963 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:22,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:23,496 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:23,496 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:23,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:02:23,496 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:02:23,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:02:23,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:02:23,497 INFO L87 Difference]: Start difference. First operand 1573 states and 1789 transitions. Second operand 6 states. [2018-01-30 02:02:24,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:24,048 INFO L93 Difference]: Finished difference Result 4943 states and 5610 transitions. [2018-01-30 02:02:24,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:02:24,048 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 322 [2018-01-30 02:02:24,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:24,051 INFO L225 Difference]: With dead ends: 4943 [2018-01-30 02:02:24,051 INFO L226 Difference]: Without dead ends: 3494 [2018-01-30 02:02:24,053 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:02:24,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states. [2018-01-30 02:02:24,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 1573. [2018-01-30 02:02:24,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2018-01-30 02:02:24,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 1787 transitions. [2018-01-30 02:02:24,091 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 1787 transitions. Word has length 322 [2018-01-30 02:02:24,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:24,091 INFO L432 AbstractCegarLoop]: Abstraction has 1573 states and 1787 transitions. [2018-01-30 02:02:24,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:02:24,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1787 transitions. [2018-01-30 02:02:24,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-01-30 02:02:24,093 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:24,093 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 02:02:24,093 INFO L371 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:24,093 INFO L82 PathProgramCache]: Analyzing trace with hash 939759754, now seen corresponding path program 1 times [2018-01-30 02:02:24,093 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:24,093 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:24,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:24,094 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:24,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:24,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:24,102 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:24,285 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:24,285 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:24,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:02:24,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:02:24,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:02:24,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:02:24,286 INFO L87 Difference]: Start difference. First operand 1573 states and 1787 transitions. Second operand 6 states. [2018-01-30 02:02:24,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:24,722 INFO L93 Difference]: Finished difference Result 4478 states and 5107 transitions. [2018-01-30 02:02:24,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:02:24,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 322 [2018-01-30 02:02:24,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:24,724 INFO L225 Difference]: With dead ends: 4478 [2018-01-30 02:02:24,724 INFO L226 Difference]: Without dead ends: 3029 [2018-01-30 02:02:24,726 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:02:24,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3029 states. [2018-01-30 02:02:24,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3029 to 1573. [2018-01-30 02:02:24,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2018-01-30 02:02:24,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 1786 transitions. [2018-01-30 02:02:24,763 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 1786 transitions. Word has length 322 [2018-01-30 02:02:24,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:24,764 INFO L432 AbstractCegarLoop]: Abstraction has 1573 states and 1786 transitions. [2018-01-30 02:02:24,764 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:02:24,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1786 transitions. [2018-01-30 02:02:24,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-01-30 02:02:24,765 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:24,765 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-30 02:02:24,765 INFO L371 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:24,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1816681029, now seen corresponding path program 1 times [2018-01-30 02:02:24,765 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:24,766 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:24,766 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:24,766 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:24,766 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:24,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:24,891 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:24,892 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:24,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:02:24,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:02:24,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:02:24,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:02:24,892 INFO L87 Difference]: Start difference. First operand 1573 states and 1786 transitions. Second operand 4 states. [2018-01-30 02:02:25,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:25,149 INFO L93 Difference]: Finished difference Result 3384 states and 3859 transitions. [2018-01-30 02:02:25,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:02:25,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 323 [2018-01-30 02:02:25,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:25,151 INFO L225 Difference]: With dead ends: 3384 [2018-01-30 02:02:25,151 INFO L226 Difference]: Without dead ends: 1935 [2018-01-30 02:02:25,152 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 02:02:25,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2018-01-30 02:02:25,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1579. [2018-01-30 02:02:25,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2018-01-30 02:02:25,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 1792 transitions. [2018-01-30 02:02:25,186 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 1792 transitions. Word has length 323 [2018-01-30 02:02:25,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:25,186 INFO L432 AbstractCegarLoop]: Abstraction has 1579 states and 1792 transitions. [2018-01-30 02:02:25,186 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:02:25,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 1792 transitions. [2018-01-30 02:02:25,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-01-30 02:02:25,187 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:25,188 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-30 02:02:25,188 INFO L371 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:25,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1449610551, now seen corresponding path program 1 times [2018-01-30 02:02:25,188 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:25,188 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:25,188 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:25,189 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:25,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:25,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:25,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:25,379 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:25,379 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:25,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:02:25,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:02:25,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:02:25,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:02:25,380 INFO L87 Difference]: Start difference. First operand 1579 states and 1792 transitions. Second operand 4 states. [2018-01-30 02:02:25,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:25,629 INFO L93 Difference]: Finished difference Result 3079 states and 3509 transitions. [2018-01-30 02:02:25,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:02:25,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 323 [2018-01-30 02:02:25,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:25,631 INFO L225 Difference]: With dead ends: 3079 [2018-01-30 02:02:25,631 INFO L226 Difference]: Without dead ends: 1624 [2018-01-30 02:02:25,632 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 02:02:25,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2018-01-30 02:02:25,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1582. [2018-01-30 02:02:25,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2018-01-30 02:02:25,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1795 transitions. [2018-01-30 02:02:25,671 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1795 transitions. Word has length 323 [2018-01-30 02:02:25,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:25,671 INFO L432 AbstractCegarLoop]: Abstraction has 1582 states and 1795 transitions. [2018-01-30 02:02:25,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:02:25,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1795 transitions. [2018-01-30 02:02:25,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-01-30 02:02:25,673 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:25,673 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:25,673 INFO L371 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:25,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1350920760, now seen corresponding path program 1 times [2018-01-30 02:02:25,673 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:25,673 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:25,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:25,674 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:25,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:25,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:25,899 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:25,899 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:25,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:02:25,899 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:02:25,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:02:25,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:02:25,900 INFO L87 Difference]: Start difference. First operand 1582 states and 1795 transitions. Second operand 6 states. [2018-01-30 02:02:26,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:26,554 INFO L93 Difference]: Finished difference Result 4940 states and 5597 transitions. [2018-01-30 02:02:26,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:02:26,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 324 [2018-01-30 02:02:26,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:26,556 INFO L225 Difference]: With dead ends: 4940 [2018-01-30 02:02:26,556 INFO L226 Difference]: Without dead ends: 3482 [2018-01-30 02:02:26,558 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:02:26,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3482 states. [2018-01-30 02:02:26,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3482 to 1582. [2018-01-30 02:02:26,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2018-01-30 02:02:26,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1793 transitions. [2018-01-30 02:02:26,596 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1793 transitions. Word has length 324 [2018-01-30 02:02:26,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:26,597 INFO L432 AbstractCegarLoop]: Abstraction has 1582 states and 1793 transitions. [2018-01-30 02:02:26,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:02:26,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1793 transitions. [2018-01-30 02:02:26,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-01-30 02:02:26,598 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:26,598 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:26,598 INFO L371 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:26,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1119870412, now seen corresponding path program 1 times [2018-01-30 02:02:26,598 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:26,598 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:26,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:26,599 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:26,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:26,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:26,789 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:26,790 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:26,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:02:26,790 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:02:26,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:02:26,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:02:26,790 INFO L87 Difference]: Start difference. First operand 1582 states and 1793 transitions. Second operand 6 states. [2018-01-30 02:02:27,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:27,302 INFO L93 Difference]: Finished difference Result 4482 states and 5101 transitions. [2018-01-30 02:02:27,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:02:27,303 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 324 [2018-01-30 02:02:27,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:27,304 INFO L225 Difference]: With dead ends: 4482 [2018-01-30 02:02:27,305 INFO L226 Difference]: Without dead ends: 3024 [2018-01-30 02:02:27,312 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:02:27,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3024 states. [2018-01-30 02:02:27,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3024 to 1582. [2018-01-30 02:02:27,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2018-01-30 02:02:27,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1792 transitions. [2018-01-30 02:02:27,352 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1792 transitions. Word has length 324 [2018-01-30 02:02:27,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:27,352 INFO L432 AbstractCegarLoop]: Abstraction has 1582 states and 1792 transitions. [2018-01-30 02:02:27,352 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:02:27,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1792 transitions. [2018-01-30 02:02:27,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-01-30 02:02:27,354 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:27,354 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:27,354 INFO L371 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:27,354 INFO L82 PathProgramCache]: Analyzing trace with hash -283487381, now seen corresponding path program 1 times [2018-01-30 02:02:27,354 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:27,354 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:27,354 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:27,355 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:27,355 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:27,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:27,576 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:27,576 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:27,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:02:27,577 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:02:27,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:02:27,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:02:27,577 INFO L87 Difference]: Start difference. First operand 1582 states and 1792 transitions. Second operand 6 states. [2018-01-30 02:02:28,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:28,142 INFO L93 Difference]: Finished difference Result 4924 states and 5575 transitions. [2018-01-30 02:02:28,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:02:28,142 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 325 [2018-01-30 02:02:28,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:28,144 INFO L225 Difference]: With dead ends: 4924 [2018-01-30 02:02:28,144 INFO L226 Difference]: Without dead ends: 3466 [2018-01-30 02:02:28,146 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:02:28,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3466 states. [2018-01-30 02:02:28,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3466 to 1582. [2018-01-30 02:02:28,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2018-01-30 02:02:28,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1790 transitions. [2018-01-30 02:02:28,195 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1790 transitions. Word has length 325 [2018-01-30 02:02:28,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:28,195 INFO L432 AbstractCegarLoop]: Abstraction has 1582 states and 1790 transitions. [2018-01-30 02:02:28,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:02:28,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1790 transitions. [2018-01-30 02:02:28,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-01-30 02:02:28,196 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:28,196 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:28,196 INFO L371 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:28,197 INFO L82 PathProgramCache]: Analyzing trace with hash 431397615, now seen corresponding path program 1 times [2018-01-30 02:02:28,197 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:28,197 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:28,197 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:28,197 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:28,197 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:28,205 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:28,396 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:28,396 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:28,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:02:28,396 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:02:28,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:02:28,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:02:28,396 INFO L87 Difference]: Start difference. First operand 1582 states and 1790 transitions. Second operand 6 states. [2018-01-30 02:02:28,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:28,794 INFO L93 Difference]: Finished difference Result 4474 states and 5087 transitions. [2018-01-30 02:02:28,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:02:28,794 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 325 [2018-01-30 02:02:28,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:28,796 INFO L225 Difference]: With dead ends: 4474 [2018-01-30 02:02:28,796 INFO L226 Difference]: Without dead ends: 3016 [2018-01-30 02:02:28,798 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:02:28,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2018-01-30 02:02:28,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 1582. [2018-01-30 02:02:28,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2018-01-30 02:02:28,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1789 transitions. [2018-01-30 02:02:28,843 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1789 transitions. Word has length 325 [2018-01-30 02:02:28,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:28,843 INFO L432 AbstractCegarLoop]: Abstraction has 1582 states and 1789 transitions. [2018-01-30 02:02:28,843 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:02:28,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1789 transitions. [2018-01-30 02:02:28,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-01-30 02:02:28,844 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:28,845 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:28,845 INFO L371 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:28,845 INFO L82 PathProgramCache]: Analyzing trace with hash -588427059, now seen corresponding path program 1 times [2018-01-30 02:02:28,845 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:28,845 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:28,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:28,845 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:28,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:28,854 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:29,041 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:29,041 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:29,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:02:29,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:02:29,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:02:29,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:02:29,041 INFO L87 Difference]: Start difference. First operand 1582 states and 1789 transitions. Second operand 6 states. [2018-01-30 02:02:29,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:29,639 INFO L93 Difference]: Finished difference Result 4922 states and 5567 transitions. [2018-01-30 02:02:29,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:02:29,639 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 327 [2018-01-30 02:02:29,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:29,641 INFO L225 Difference]: With dead ends: 4922 [2018-01-30 02:02:29,641 INFO L226 Difference]: Without dead ends: 3464 [2018-01-30 02:02:29,642 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:02:29,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3464 states. [2018-01-30 02:02:29,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3464 to 1582. [2018-01-30 02:02:29,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2018-01-30 02:02:29,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1787 transitions. [2018-01-30 02:02:29,686 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1787 transitions. Word has length 327 [2018-01-30 02:02:29,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:29,686 INFO L432 AbstractCegarLoop]: Abstraction has 1582 states and 1787 transitions. [2018-01-30 02:02:29,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:02:29,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1787 transitions. [2018-01-30 02:02:29,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-01-30 02:02:29,687 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:29,688 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:29,688 INFO L371 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:29,688 INFO L82 PathProgramCache]: Analyzing trace with hash -778713263, now seen corresponding path program 1 times [2018-01-30 02:02:29,688 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:29,688 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:29,688 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:29,689 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:29,689 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:29,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:29,859 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:29,859 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:29,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:02:29,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:02:29,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:02:29,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:02:29,860 INFO L87 Difference]: Start difference. First operand 1582 states and 1787 transitions. Second operand 6 states. [2018-01-30 02:02:30,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:30,371 INFO L93 Difference]: Finished difference Result 4473 states and 5080 transitions. [2018-01-30 02:02:30,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:02:30,371 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 327 [2018-01-30 02:02:30,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:30,373 INFO L225 Difference]: With dead ends: 4473 [2018-01-30 02:02:30,373 INFO L226 Difference]: Without dead ends: 3015 [2018-01-30 02:02:30,374 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:02:30,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3015 states. [2018-01-30 02:02:30,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3015 to 1582. [2018-01-30 02:02:30,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2018-01-30 02:02:30,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1786 transitions. [2018-01-30 02:02:30,418 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1786 transitions. Word has length 327 [2018-01-30 02:02:30,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:30,418 INFO L432 AbstractCegarLoop]: Abstraction has 1582 states and 1786 transitions. [2018-01-30 02:02:30,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:02:30,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1786 transitions. [2018-01-30 02:02:30,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-01-30 02:02:30,419 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:30,419 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:30,419 INFO L371 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:30,419 INFO L82 PathProgramCache]: Analyzing trace with hash -143764464, now seen corresponding path program 1 times [2018-01-30 02:02:30,419 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:30,419 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:30,420 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:30,420 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:30,420 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:30,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:30,611 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:30,611 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:30,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:02:30,611 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:02:30,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:02:30,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:02:30,611 INFO L87 Difference]: Start difference. First operand 1582 states and 1786 transitions. Second operand 6 states. [2018-01-30 02:02:31,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:31,171 INFO L93 Difference]: Finished difference Result 4876 states and 5511 transitions. [2018-01-30 02:02:31,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:02:31,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 330 [2018-01-30 02:02:31,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:31,173 INFO L225 Difference]: With dead ends: 4876 [2018-01-30 02:02:31,173 INFO L226 Difference]: Without dead ends: 3418 [2018-01-30 02:02:31,174 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:02:31,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3418 states. [2018-01-30 02:02:31,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3418 to 1582. [2018-01-30 02:02:31,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2018-01-30 02:02:31,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1784 transitions. [2018-01-30 02:02:31,221 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1784 transitions. Word has length 330 [2018-01-30 02:02:31,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:31,221 INFO L432 AbstractCegarLoop]: Abstraction has 1582 states and 1784 transitions. [2018-01-30 02:02:31,221 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:02:31,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1784 transitions. [2018-01-30 02:02:31,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-01-30 02:02:31,222 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:31,222 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:31,223 INFO L371 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:31,223 INFO L82 PathProgramCache]: Analyzing trace with hash -966657807, now seen corresponding path program 1 times [2018-01-30 02:02:31,223 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:31,223 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:31,223 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:31,223 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:31,223 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:31,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:31,383 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:31,383 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:31,383 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:02:31,383 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:02:31,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:02:31,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:02:31,384 INFO L87 Difference]: Start difference. First operand 1582 states and 1784 transitions. Second operand 6 states. [2018-01-30 02:02:31,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:31,963 INFO L93 Difference]: Finished difference Result 4874 states and 5505 transitions. [2018-01-30 02:02:31,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:02:31,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 330 [2018-01-30 02:02:31,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:31,965 INFO L225 Difference]: With dead ends: 4874 [2018-01-30 02:02:31,965 INFO L226 Difference]: Without dead ends: 3416 [2018-01-30 02:02:31,967 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:02:31,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3416 states. [2018-01-30 02:02:32,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3416 to 1582. [2018-01-30 02:02:32,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2018-01-30 02:02:32,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1782 transitions. [2018-01-30 02:02:32,016 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1782 transitions. Word has length 330 [2018-01-30 02:02:32,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:32,016 INFO L432 AbstractCegarLoop]: Abstraction has 1582 states and 1782 transitions. [2018-01-30 02:02:32,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:02:32,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1782 transitions. [2018-01-30 02:02:32,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-01-30 02:02:32,017 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:32,017 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:32,017 INFO L371 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:32,017 INFO L82 PathProgramCache]: Analyzing trace with hash 396762892, now seen corresponding path program 1 times [2018-01-30 02:02:32,018 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:32,018 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:32,018 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:32,018 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:32,018 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:32,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:32,202 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:32,202 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:32,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:02:32,203 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:02:32,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:02:32,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:02:32,203 INFO L87 Difference]: Start difference. First operand 1582 states and 1782 transitions. Second operand 6 states. [2018-01-30 02:02:32,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:32,712 INFO L93 Difference]: Finished difference Result 4450 states and 5045 transitions. [2018-01-30 02:02:32,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:02:32,712 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 330 [2018-01-30 02:02:32,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:32,713 INFO L225 Difference]: With dead ends: 4450 [2018-01-30 02:02:32,714 INFO L226 Difference]: Without dead ends: 2992 [2018-01-30 02:02:32,715 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:02:32,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2018-01-30 02:02:32,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 1582. [2018-01-30 02:02:32,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2018-01-30 02:02:32,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1781 transitions. [2018-01-30 02:02:32,763 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1781 transitions. Word has length 330 [2018-01-30 02:02:32,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:32,763 INFO L432 AbstractCegarLoop]: Abstraction has 1582 states and 1781 transitions. [2018-01-30 02:02:32,763 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:02:32,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1781 transitions. [2018-01-30 02:02:32,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-01-30 02:02:32,764 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:32,765 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:32,765 INFO L371 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:32,765 INFO L82 PathProgramCache]: Analyzing trace with hash -426130451, now seen corresponding path program 1 times [2018-01-30 02:02:32,765 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:32,765 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:32,765 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:32,765 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:32,765 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:32,773 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:32,925 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:32,925 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:32,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:02:32,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:02:32,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:02:32,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:02:32,926 INFO L87 Difference]: Start difference. First operand 1582 states and 1781 transitions. Second operand 6 states. [2018-01-30 02:02:33,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:33,438 INFO L93 Difference]: Finished difference Result 4449 states and 5042 transitions. [2018-01-30 02:02:33,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:02:33,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 330 [2018-01-30 02:02:33,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:33,440 INFO L225 Difference]: With dead ends: 4449 [2018-01-30 02:02:33,440 INFO L226 Difference]: Without dead ends: 2991 [2018-01-30 02:02:33,441 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:02:33,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2018-01-30 02:02:33,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 1582. [2018-01-30 02:02:33,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2018-01-30 02:02:33,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1780 transitions. [2018-01-30 02:02:33,491 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1780 transitions. Word has length 330 [2018-01-30 02:02:33,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:33,491 INFO L432 AbstractCegarLoop]: Abstraction has 1582 states and 1780 transitions. [2018-01-30 02:02:33,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:02:33,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1780 transitions. [2018-01-30 02:02:33,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-01-30 02:02:33,493 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:33,493 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-30 02:02:33,493 INFO L371 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:33,493 INFO L82 PathProgramCache]: Analyzing trace with hash 724540588, now seen corresponding path program 1 times [2018-01-30 02:02:33,493 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:33,493 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:33,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:33,494 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:33,494 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:33,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:33,624 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:33,624 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:33,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:02:33,624 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:02:33,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:02:33,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:02:33,625 INFO L87 Difference]: Start difference. First operand 1582 states and 1780 transitions. Second operand 4 states. [2018-01-30 02:02:33,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:33,875 INFO L93 Difference]: Finished difference Result 3394 states and 3837 transitions. [2018-01-30 02:02:33,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:02:33,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 333 [2018-01-30 02:02:33,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:33,877 INFO L225 Difference]: With dead ends: 3394 [2018-01-30 02:02:33,877 INFO L226 Difference]: Without dead ends: 1936 [2018-01-30 02:02:33,878 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 02:02:33,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2018-01-30 02:02:33,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1600. [2018-01-30 02:02:33,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2018-01-30 02:02:33,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 1802 transitions. [2018-01-30 02:02:33,927 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 1802 transitions. Word has length 333 [2018-01-30 02:02:33,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:33,927 INFO L432 AbstractCegarLoop]: Abstraction has 1600 states and 1802 transitions. [2018-01-30 02:02:33,927 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:02:33,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 1802 transitions. [2018-01-30 02:02:33,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-01-30 02:02:33,928 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:33,928 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-01-30 02:02:33,928 INFO L371 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:33,928 INFO L82 PathProgramCache]: Analyzing trace with hash 495710918, now seen corresponding path program 1 times [2018-01-30 02:02:33,928 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:33,928 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:33,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:33,929 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:33,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:33,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:34,133 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:02:34,133 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:34,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:02:34,133 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:02:34,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:02:34,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:02:34,134 INFO L87 Difference]: Start difference. First operand 1600 states and 1802 transitions. Second operand 6 states. [2018-01-30 02:02:34,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:34,837 INFO L93 Difference]: Finished difference Result 4906 states and 5535 transitions. [2018-01-30 02:02:34,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:02:34,837 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 333 [2018-01-30 02:02:34,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:34,839 INFO L225 Difference]: With dead ends: 4906 [2018-01-30 02:02:34,839 INFO L226 Difference]: Without dead ends: 3430 [2018-01-30 02:02:34,840 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:02:34,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3430 states. [2018-01-30 02:02:34,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3430 to 1600. [2018-01-30 02:02:34,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2018-01-30 02:02:34,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 1800 transitions. [2018-01-30 02:02:34,894 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 1800 transitions. Word has length 333 [2018-01-30 02:02:34,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:34,894 INFO L432 AbstractCegarLoop]: Abstraction has 1600 states and 1800 transitions. [2018-01-30 02:02:34,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:02:34,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 1800 transitions. [2018-01-30 02:02:34,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-01-30 02:02:34,895 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:34,896 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-30 02:02:34,896 INFO L371 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:34,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1742610480, now seen corresponding path program 1 times [2018-01-30 02:02:34,896 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:34,896 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:34,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:34,896 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:34,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:34,905 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:34,987 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-01-30 02:02:34,987 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:34,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:02:34,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:02:34,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:02:34,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:02:34,988 INFO L87 Difference]: Start difference. First operand 1600 states and 1800 transitions. Second operand 3 states. [2018-01-30 02:02:35,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:35,098 INFO L93 Difference]: Finished difference Result 3869 states and 4375 transitions. [2018-01-30 02:02:35,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:02:35,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2018-01-30 02:02:35,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:35,100 INFO L225 Difference]: With dead ends: 3869 [2018-01-30 02:02:35,100 INFO L226 Difference]: Without dead ends: 2393 [2018-01-30 02:02:35,101 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 02:02:35,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2018-01-30 02:02:35,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 2393. [2018-01-30 02:02:35,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2393 states. [2018-01-30 02:02:35,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2393 states and 2696 transitions. [2018-01-30 02:02:35,176 INFO L78 Accepts]: Start accepts. Automaton has 2393 states and 2696 transitions. Word has length 333 [2018-01-30 02:02:35,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:35,176 INFO L432 AbstractCegarLoop]: Abstraction has 2393 states and 2696 transitions. [2018-01-30 02:02:35,176 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:02:35,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 2696 transitions. [2018-01-30 02:02:35,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-01-30 02:02:35,177 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:35,178 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-30 02:02:35,178 INFO L371 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:35,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1827425741, now seen corresponding path program 1 times [2018-01-30 02:02:35,178 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:35,178 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:35,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:35,179 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:35,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:35,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:35,263 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-01-30 02:02:35,263 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:35,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:02:35,264 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:02:35,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:02:35,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:02:35,264 INFO L87 Difference]: Start difference. First operand 2393 states and 2696 transitions. Second operand 3 states. [2018-01-30 02:02:35,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:35,377 INFO L93 Difference]: Finished difference Result 5457 states and 6168 transitions. [2018-01-30 02:02:35,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:02:35,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 338 [2018-01-30 02:02:35,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:35,379 INFO L225 Difference]: With dead ends: 5457 [2018-01-30 02:02:35,379 INFO L226 Difference]: Without dead ends: 3188 [2018-01-30 02:02:35,380 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 02:02:35,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3188 states. [2018-01-30 02:02:35,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3188 to 3186. [2018-01-30 02:02:35,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3186 states. [2018-01-30 02:02:35,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3186 states to 3186 states and 3596 transitions. [2018-01-30 02:02:35,481 INFO L78 Accepts]: Start accepts. Automaton has 3186 states and 3596 transitions. Word has length 338 [2018-01-30 02:02:35,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:35,481 INFO L432 AbstractCegarLoop]: Abstraction has 3186 states and 3596 transitions. [2018-01-30 02:02:35,481 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:02:35,481 INFO L276 IsEmpty]: Start isEmpty. Operand 3186 states and 3596 transitions. [2018-01-30 02:02:35,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-01-30 02:02:35,483 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:35,483 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 02:02:35,483 INFO L371 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:35,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1505981764, now seen corresponding path program 1 times [2018-01-30 02:02:35,483 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:35,483 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:35,483 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:35,484 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:35,484 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:35,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:35,584 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-01-30 02:02:35,585 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:35,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:02:35,585 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:02:35,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:02:35,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:02:35,585 INFO L87 Difference]: Start difference. First operand 3186 states and 3596 transitions. Second operand 3 states. [2018-01-30 02:02:35,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:35,818 INFO L93 Difference]: Finished difference Result 7043 states and 7966 transitions. [2018-01-30 02:02:35,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:02:35,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 353 [2018-01-30 02:02:35,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:35,821 INFO L225 Difference]: With dead ends: 7043 [2018-01-30 02:02:35,821 INFO L226 Difference]: Without dead ends: 3981 [2018-01-30 02:02:35,823 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 02:02:35,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3981 states. [2018-01-30 02:02:35,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3981 to 3979. [2018-01-30 02:02:35,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3979 states. [2018-01-30 02:02:35,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3979 states to 3979 states and 4482 transitions. [2018-01-30 02:02:35,949 INFO L78 Accepts]: Start accepts. Automaton has 3979 states and 4482 transitions. Word has length 353 [2018-01-30 02:02:35,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:35,950 INFO L432 AbstractCegarLoop]: Abstraction has 3979 states and 4482 transitions. [2018-01-30 02:02:35,950 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:02:35,950 INFO L276 IsEmpty]: Start isEmpty. Operand 3979 states and 4482 transitions. [2018-01-30 02:02:35,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2018-01-30 02:02:35,952 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:35,952 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-01-30 02:02:35,952 INFO L371 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:35,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1750928523, now seen corresponding path program 1 times [2018-01-30 02:02:35,952 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:35,952 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:35,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:35,953 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:35,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:35,962 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:36,074 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-01-30 02:02:36,075 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:36,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:02:36,075 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:02:36,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:02:36,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:02:36,075 INFO L87 Difference]: Start difference. First operand 3979 states and 4482 transitions. Second operand 3 states. [2018-01-30 02:02:36,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:36,235 INFO L93 Difference]: Finished difference Result 8627 states and 9737 transitions. [2018-01-30 02:02:36,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:02:36,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 406 [2018-01-30 02:02:36,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:36,237 INFO L225 Difference]: With dead ends: 8627 [2018-01-30 02:02:36,237 INFO L226 Difference]: Without dead ends: 4772 [2018-01-30 02:02:36,240 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 02:02:36,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4772 states. [2018-01-30 02:02:36,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4772 to 4772. [2018-01-30 02:02:36,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4772 states. [2018-01-30 02:02:36,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4772 states to 4772 states and 5379 transitions. [2018-01-30 02:02:36,392 INFO L78 Accepts]: Start accepts. Automaton has 4772 states and 5379 transitions. Word has length 406 [2018-01-30 02:02:36,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:36,393 INFO L432 AbstractCegarLoop]: Abstraction has 4772 states and 5379 transitions. [2018-01-30 02:02:36,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:02:36,393 INFO L276 IsEmpty]: Start isEmpty. Operand 4772 states and 5379 transitions. [2018-01-30 02:02:36,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2018-01-30 02:02:36,395 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:36,395 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2018-01-30 02:02:36,395 INFO L371 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:36,395 INFO L82 PathProgramCache]: Analyzing trace with hash 823054654, now seen corresponding path program 1 times [2018-01-30 02:02:36,395 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:36,395 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:36,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:36,396 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:36,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:36,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:36,535 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-01-30 02:02:36,535 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:02:36,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:02:36,535 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:02:36,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:02:36,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:02:36,535 INFO L87 Difference]: Start difference. First operand 4772 states and 5379 transitions. Second operand 3 states. [2018-01-30 02:02:36,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:36,947 INFO L93 Difference]: Finished difference Result 5569 states and 6276 transitions. [2018-01-30 02:02:36,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:02:36,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 423 [2018-01-30 02:02:36,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:36,950 INFO L225 Difference]: With dead ends: 5569 [2018-01-30 02:02:36,950 INFO L226 Difference]: Without dead ends: 5567 [2018-01-30 02:02:36,951 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 02:02:36,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5567 states. [2018-01-30 02:02:37,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5567 to 5565. [2018-01-30 02:02:37,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5565 states. [2018-01-30 02:02:37,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5565 states to 5565 states and 6273 transitions. [2018-01-30 02:02:37,129 INFO L78 Accepts]: Start accepts. Automaton has 5565 states and 6273 transitions. Word has length 423 [2018-01-30 02:02:37,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:37,129 INFO L432 AbstractCegarLoop]: Abstraction has 5565 states and 6273 transitions. [2018-01-30 02:02:37,129 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:02:37,129 INFO L276 IsEmpty]: Start isEmpty. Operand 5565 states and 6273 transitions. [2018-01-30 02:02:37,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2018-01-30 02:02:37,132 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:37,132 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:37,132 INFO L371 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:37,133 INFO L82 PathProgramCache]: Analyzing trace with hash 930469915, now seen corresponding path program 1 times [2018-01-30 02:02:37,133 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:37,133 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:37,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:37,133 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:37,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:37,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:02:41,237 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 7 DAG size of output 6 [2018-01-30 02:02:42,262 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 42 proven. 485 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-01-30 02:02:42,262 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:02:42,262 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 02:02:42,267 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:42,360 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:02:42,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 02:02:42,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:02:42,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:42,386 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 02:02:42,471 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:42,485 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:42,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-30 02:02:42,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:02:42,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:42,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-01-30 02:02:42,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:02:42,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:02:42,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:02:42,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:42,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:42,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-01-30 02:02:42,614 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:42,615 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:42,615 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:42,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-01-30 02:02:42,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:02:42,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:42,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:46 [2018-01-30 02:02:42,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-01-30 02:02:42,672 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:42,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2018-01-30 02:02:42,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:02:42,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:42,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:42,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:64 [2018-01-30 02:02:42,713 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:42,714 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:42,714 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:42,715 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:42,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 61 [2018-01-30 02:02:42,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:02:42,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:42,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:61 [2018-01-30 02:02:42,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 55 [2018-01-30 02:02:42,758 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:42,758 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:42,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 90 [2018-01-30 02:02:42,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:02:42,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:42,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:42,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:74, output treesize:79 [2018-01-30 02:02:42,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-01-30 02:02:42,918 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:42,942 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:42,945 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:42,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-01-30 02:02:42,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:02:42,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:42,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:42,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-01-30 02:02:42,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-01-30 02:02:42,990 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:42,991 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:42,991 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:42,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-01-30 02:02:42,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,011 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-01-30 02:02:43,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-01-30 02:02:43,041 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:43,042 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:43,042 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:43,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-01-30 02:02:43,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-01-30 02:02:43,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-01-30 02:02:43,107 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:43,108 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:43,109 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:43,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-01-30 02:02:43,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-01-30 02:02:43,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-01-30 02:02:43,202 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:43,222 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:43,242 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:43,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-01-30 02:02:43,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-01-30 02:02:43,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-01-30 02:02:43,311 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:43,311 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:43,312 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:43,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-01-30 02:02:43,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,332 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-01-30 02:02:43,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-01-30 02:02:43,337 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:43,337 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:43,338 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:43,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-01-30 02:02:43,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,357 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-01-30 02:02:43,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-01-30 02:02:43,392 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:43,393 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:43,393 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:43,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-01-30 02:02:43,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-01-30 02:02:43,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-01-30 02:02:43,419 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:43,420 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:43,421 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:43,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-01-30 02:02:43,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-01-30 02:02:43,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 98 [2018-01-30 02:02:43,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-30 02:02:43,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:104, output treesize:79 [2018-01-30 02:02:43,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-01-30 02:02:43,533 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:43,534 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:43,534 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:43,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-01-30 02:02:43,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-01-30 02:02:43,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-01-30 02:02:43,558 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:43,559 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:43,559 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:43,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-01-30 02:02:43,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-01-30 02:02:43,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:02:43,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:02:43,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-01-30 02:02:43,609 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:43,610 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:43,610 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:43,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-01-30 02:02:43,613 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,624 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,632 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:111, output treesize:88 [2018-01-30 02:02:43,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 68 [2018-01-30 02:02:43,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 49 [2018-01-30 02:02:43,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:97, output treesize:14 [2018-01-30 02:02:43,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-01-30 02:02:43,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:02:43,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-30 02:02:43,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:23 [2018-01-30 02:02:43,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-01-30 02:02:43,821 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:43,821 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:43,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-01-30 02:02:43,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-30 02:02:43,832 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-01-30 02:02:43,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-01-30 02:02:43,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-30 02:02:43,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,978 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:43,979 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:02:43,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-30 02:02:43,979 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:02:43,984 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2018-01-30 02:02:45,129 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 0 proven. 271 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-01-30 02:02:45,147 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:02:45,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2018-01-30 02:02:45,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-30 02:02:45,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-30 02:02:45,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1156, Unknown=0, NotChecked=0, Total=1260 [2018-01-30 02:02:45,148 INFO L87 Difference]: Start difference. First operand 5565 states and 6273 transitions. Second operand 36 states. [2018-01-30 02:02:50,101 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 77 DAG size of output 75 [2018-01-30 02:02:52,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:02:52,205 INFO L93 Difference]: Finished difference Result 19455 states and 22062 transitions. [2018-01-30 02:02:52,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-30 02:02:52,206 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 530 [2018-01-30 02:02:52,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:02:52,226 INFO L225 Difference]: With dead ends: 19455 [2018-01-30 02:02:52,226 INFO L226 Difference]: Without dead ends: 14014 [2018-01-30 02:02:52,234 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 595 GetRequests, 519 SyntacticMatches, 15 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=442, Invalid=3464, Unknown=0, NotChecked=0, Total=3906 [2018-01-30 02:02:52,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14014 states. [2018-01-30 02:02:52,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14014 to 9443. [2018-01-30 02:02:52,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9443 states. [2018-01-30 02:02:52,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9443 states to 9443 states and 10862 transitions. [2018-01-30 02:02:52,583 INFO L78 Accepts]: Start accepts. Automaton has 9443 states and 10862 transitions. Word has length 530 [2018-01-30 02:02:52,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:02:52,583 INFO L432 AbstractCegarLoop]: Abstraction has 9443 states and 10862 transitions. [2018-01-30 02:02:52,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-30 02:02:52,583 INFO L276 IsEmpty]: Start isEmpty. Operand 9443 states and 10862 transitions. [2018-01-30 02:02:52,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2018-01-30 02:02:52,594 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:02:52,594 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:02:52,594 INFO L371 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:02:52,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1134987425, now seen corresponding path program 1 times [2018-01-30 02:02:52,595 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:02:52,595 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:02:52,595 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:52,595 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:02:52,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:02:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:02:52,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-01-30 02:02:53,023 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 02:02:53,025 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 02:02:53,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 02:02:53 BoogieIcfgContainer [2018-01-30 02:02:53,025 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 02:02:53,026 INFO L168 Benchmark]: Toolchain (without parser) took 63410.99 ms. Allocated memory was 151.0 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 113.7 MB in the beginning and 1.0 GB in the end (delta: -900.3 MB). Peak memory consumption was 991.9 MB. Max. memory is 5.3 GB. [2018-01-30 02:02:53,027 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 151.0 MB. Free memory is still 120.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 02:02:53,027 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.04 ms. Allocated memory is still 151.0 MB. Free memory was 113.7 MB in the beginning and 85.5 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 5.3 GB. [2018-01-30 02:02:53,027 INFO L168 Benchmark]: Boogie Preprocessor took 50.87 ms. Allocated memory is still 151.0 MB. Free memory was 85.5 MB in the beginning and 82.0 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 5.3 GB. [2018-01-30 02:02:53,027 INFO L168 Benchmark]: RCFGBuilder took 1660.42 ms. Allocated memory was 151.0 MB in the beginning and 168.8 MB in the end (delta: 17.8 MB). Free memory was 82.0 MB in the beginning and 105.3 MB in the end (delta: -23.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 5.3 GB. [2018-01-30 02:02:53,027 INFO L168 Benchmark]: TraceAbstraction took 61432.88 ms. Allocated memory was 168.8 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 105.3 MB in the beginning and 1.0 GB in the end (delta: -908.7 MB). Peak memory consumption was 965.7 MB. Max. memory is 5.3 GB. [2018-01-30 02:02:53,028 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 151.0 MB. Free memory is still 120.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 264.04 ms. Allocated memory is still 151.0 MB. Free memory was 113.7 MB in the beginning and 85.5 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 50.87 ms. Allocated memory is still 151.0 MB. Free memory was 85.5 MB in the beginning and 82.0 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 5.3 GB. * RCFGBuilder took 1660.42 ms. Allocated memory was 151.0 MB in the beginning and 168.8 MB in the end (delta: 17.8 MB). Free memory was 82.0 MB in the beginning and 105.3 MB in the end (delta: -23.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 61432.88 ms. Allocated memory was 168.8 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 105.3 MB in the beginning and 1.0 GB in the end (delta: -908.7 MB). Peak memory consumption was 965.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1731]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1731). Cancelled while BasicCegarLoop was analyzing trace of length 531 with TraceHistMax 5, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 608 locations, 1 error locations. TIMEOUT Result, 61.3s OverallTime, 69 OverallIterations, 5 TraceHistogramMax, 35.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 64403 SDtfs, 35271 SDslu, 159972 SDs, 0 SdLazy, 38140 SolverSat, 1342 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1242 GetRequests, 729 SyntacticMatches, 137 SemanticMatches, 376 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1113 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9443occurred in iteration=68, 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: 2.6s AutomataMinimizationTime, 68 MinimizatonAttempts, 54213 StatesRemovedByMinimization, 64 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 18.8s InterpolantComputationTime, 20944 NumberOfCodeBlocks, 20944 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 20875 ConstructedInterpolants, 98 QuantifiedInterpolants, 39370744 SizeOfPredicates, 17 NumberOfNonLiveVariables, 850 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 69 InterpolantComputations, 67 PerfectInterpolantSequences, 10504/11260 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.blast.09_false-unreach-call.i.cil.c_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_02-02-53-031.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr.blast.09_false-unreach-call.i.cil.c_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_02-02-53-031.csv Completed graceful shutdown