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.07_false-unreach-call.i.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 01:59:36,364 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 01:59:36,365 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 01:59:36,374 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 01:59:36,374 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 01:59:36,375 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 01:59:36,376 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 01:59:36,377 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 01:59:36,378 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 01:59:36,379 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 01:59:36,379 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 01:59:36,379 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 01:59:36,380 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 01:59:36,380 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 01:59:36,381 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 01:59:36,382 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 01:59:36,383 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 01:59:36,384 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 01:59:36,385 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 01:59:36,385 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 01:59:36,386 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 01:59:36,387 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 01:59:36,387 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 01:59:36,387 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 01:59:36,388 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 01:59:36,388 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 01:59:36,388 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 01:59:36,389 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 01:59:36,389 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 01:59:36,389 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 01:59:36,389 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 01:59:36,390 INFO L98 SettingsManager]: Beginning loading settings from /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 01:59:36,394 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 01:59:36,395 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 01:59:36,395 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 01:59:36,395 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 01:59:36,395 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 01:59:36,395 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 01:59:36,395 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 01:59:36,396 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 01:59:36,396 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 01:59:36,396 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 01:59:36,396 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 01:59:36,396 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 01:59:36,396 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 01:59:36,396 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 01:59:36,396 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 01:59:36,396 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 01:59:36,396 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 01:59:36,397 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 01:59:36,397 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 01:59:36,397 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 01:59:36,397 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 01:59:36,397 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 01:59:36,397 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 01:59:36,397 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 01:59:36,397 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 01:59:36,397 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 01:59:36,397 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 01:59:36,397 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 01:59:36,397 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 01:59:36,398 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 01:59:36,398 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 01:59:36,398 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 01:59:36,398 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 01:59:36,398 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 01:59:36,416 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 01:59:36,422 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 01:59:36,424 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 01:59:36,425 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 01:59:36,425 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 01:59:36,426 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.c [2018-01-30 01:59:36,549 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 01:59:36,550 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 01:59:36,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 01:59:36,551 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 01:59:36,554 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 01:59:36,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:59:36" (1/1) ... [2018-01-30 01:59:36,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76af6cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:59:36, skipping insertion in model container [2018-01-30 01:59:36,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:59:36" (1/1) ... [2018-01-30 01:59:36,565 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:59:36,602 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:59:36,723 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:59:36,761 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:59:36,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:59:36 WrapperNode [2018-01-30 01:59:36,772 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 01:59:36,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 01:59:36,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 01:59:36,772 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 01:59:36,780 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:59:36" (1/1) ... [2018-01-30 01:59:36,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:59:36" (1/1) ... [2018-01-30 01:59:36,793 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:59:36" (1/1) ... [2018-01-30 01:59:36,793 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:59:36" (1/1) ... [2018-01-30 01:59:36,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:59:36" (1/1) ... [2018-01-30 01:59:36,805 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:59:36" (1/1) ... [2018-01-30 01:59:36,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:59:36" (1/1) ... [2018-01-30 01:59:36,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 01:59:36,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 01:59:36,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 01:59:36,810 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 01:59:36,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:59:36" (1/1) ... No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 01:59:36,856 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 01:59:36,856 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 01:59:36,856 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 01:59:36,856 INFO L136 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-01-30 01:59:36,856 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-30 01:59:36,857 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-30 01:59:36,857 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 01:59:36,857 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 01:59:36,857 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 01:59:36,857 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 01:59:36,857 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 01:59:36,857 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 01:59:36,857 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-30 01:59:36,857 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 01:59:36,857 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2018-01-30 01:59:36,857 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-01-30 01:59:36,858 INFO L128 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-01-30 01:59:36,858 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 01:59:36,858 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 01:59:36,858 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 01:59:37,128 WARN L490 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-01-30 01:59:37,128 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-30 01:59:38,773 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 01:59:38,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:59:38 BoogieIcfgContainer [2018-01-30 01:59:38,773 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 01:59:38,774 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 01:59:38,774 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 01:59:38,776 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 01:59:38,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 01:59:36" (1/3) ... [2018-01-30 01:59:38,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da38c85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:59:38, skipping insertion in model container [2018-01-30 01:59:38,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:59:36" (2/3) ... [2018-01-30 01:59:38,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da38c85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:59:38, skipping insertion in model container [2018-01-30 01:59:38,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:59:38" (3/3) ... [2018-01-30 01:59:38,778 INFO L107 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.07_false-unreach-call.i.cil.c [2018-01-30 01:59:38,783 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 01:59:38,787 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 01:59:38,816 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 01:59:38,817 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 01:59:38,817 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 01:59:38,817 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 01:59:38,817 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 01:59:38,817 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 01:59:38,817 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 01:59:38,817 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 01:59:38,817 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 01:59:38,831 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states. [2018-01-30 01:59:38,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-01-30 01:59:38,840 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:59:38,841 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 01:59:38,841 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:59:38,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1128997665, now seen corresponding path program 1 times [2018-01-30 01:59:38,845 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:59:38,845 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:59:38,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:38,880 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:59:38,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:59:38,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:59:39,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:59:39,560 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:59:39,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:59:39,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:59:39,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:59:39,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:59:39,571 INFO L87 Difference]: Start difference. First operand 606 states. Second operand 4 states. [2018-01-30 01:59:40,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:59:40,290 INFO L93 Difference]: Finished difference Result 1220 states and 1445 transitions. [2018-01-30 01:59:40,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 01:59:40,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2018-01-30 01:59:40,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:59:40,302 INFO L225 Difference]: With dead ends: 1220 [2018-01-30 01:59:40,302 INFO L226 Difference]: Without dead ends: 646 [2018-01-30 01:59:40,306 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 01:59:40,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2018-01-30 01:59:40,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 593. [2018-01-30 01:59:40,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2018-01-30 01:59:40,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 673 transitions. [2018-01-30 01:59:40,349 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 673 transitions. Word has length 164 [2018-01-30 01:59:40,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:59:40,353 INFO L432 AbstractCegarLoop]: Abstraction has 593 states and 673 transitions. [2018-01-30 01:59:40,353 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:59:40,353 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 673 transitions. [2018-01-30 01:59:40,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-01-30 01:59:40,359 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:59:40,359 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 01:59:40,359 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:59:40,359 INFO L82 PathProgramCache]: Analyzing trace with hash -568957419, now seen corresponding path program 1 times [2018-01-30 01:59:40,359 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:59:40,359 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:59:40,361 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:40,361 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:59:40,361 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:59:40,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:59:40,598 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 01:59:40,599 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:59:40,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:59:40,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:59:40,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:59:40,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:59:40,601 INFO L87 Difference]: Start difference. First operand 593 states and 673 transitions. Second operand 4 states. [2018-01-30 01:59:41,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:59:41,166 INFO L93 Difference]: Finished difference Result 1119 states and 1272 transitions. [2018-01-30 01:59:41,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:59:41,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2018-01-30 01:59:41,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:59:41,169 INFO L225 Difference]: With dead ends: 1119 [2018-01-30 01:59:41,169 INFO L226 Difference]: Without dead ends: 644 [2018-01-30 01:59:41,171 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 01:59:41,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2018-01-30 01:59:41,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 593. [2018-01-30 01:59:41,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2018-01-30 01:59:41,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 672 transitions. [2018-01-30 01:59:41,189 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 672 transitions. Word has length 199 [2018-01-30 01:59:41,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:59:41,189 INFO L432 AbstractCegarLoop]: Abstraction has 593 states and 672 transitions. [2018-01-30 01:59:41,189 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:59:41,189 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 672 transitions. [2018-01-30 01:59:41,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-01-30 01:59:41,191 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:59:41,191 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 01:59:41,191 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:59:41,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1456235709, now seen corresponding path program 1 times [2018-01-30 01:59:41,191 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:59:41,191 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:59:41,192 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:41,192 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:59:41,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:59:41,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:59:41,336 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 01:59:41,336 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:59:41,336 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:59:41,336 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:59:41,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:59:41,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:59:41,337 INFO L87 Difference]: Start difference. First operand 593 states and 672 transitions. Second operand 4 states. [2018-01-30 01:59:41,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:59:41,727 INFO L93 Difference]: Finished difference Result 1117 states and 1269 transitions. [2018-01-30 01:59:41,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:59:41,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2018-01-30 01:59:41,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:59:41,729 INFO L225 Difference]: With dead ends: 1117 [2018-01-30 01:59:41,729 INFO L226 Difference]: Without dead ends: 642 [2018-01-30 01:59:41,730 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 01:59:41,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2018-01-30 01:59:41,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 593. [2018-01-30 01:59:41,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2018-01-30 01:59:41,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 671 transitions. [2018-01-30 01:59:41,739 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 671 transitions. Word has length 200 [2018-01-30 01:59:41,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:59:41,739 INFO L432 AbstractCegarLoop]: Abstraction has 593 states and 671 transitions. [2018-01-30 01:59:41,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:59:41,739 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 671 transitions. [2018-01-30 01:59:41,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-01-30 01:59:41,741 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:59:41,741 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 01:59:41,741 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:59:41,741 INFO L82 PathProgramCache]: Analyzing trace with hash 473546052, now seen corresponding path program 1 times [2018-01-30 01:59:41,741 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:59:41,741 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:59:41,742 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:41,742 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:59:41,742 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:59:41,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:59:42,034 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 01:59:42,034 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:59:42,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:59:42,035 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:59:42,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:59:42,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:59:42,035 INFO L87 Difference]: Start difference. First operand 593 states and 671 transitions. Second operand 5 states. [2018-01-30 01:59:43,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:59:43,735 INFO L93 Difference]: Finished difference Result 1123 states and 1279 transitions. [2018-01-30 01:59:43,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 01:59:43,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 201 [2018-01-30 01:59:43,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:59:43,737 INFO L225 Difference]: With dead ends: 1123 [2018-01-30 01:59:43,737 INFO L226 Difference]: Without dead ends: 648 [2018-01-30 01:59:43,738 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 01:59:43,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2018-01-30 01:59:43,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 640. [2018-01-30 01:59:43,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-01-30 01:59:43,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 725 transitions. [2018-01-30 01:59:43,745 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 725 transitions. Word has length 201 [2018-01-30 01:59:43,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:59:43,745 INFO L432 AbstractCegarLoop]: Abstraction has 640 states and 725 transitions. [2018-01-30 01:59:43,745 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:59:43,745 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 725 transitions. [2018-01-30 01:59:43,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-01-30 01:59:43,747 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:59:43,747 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 01:59:43,747 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:59:43,747 INFO L82 PathProgramCache]: Analyzing trace with hash 380316373, now seen corresponding path program 1 times [2018-01-30 01:59:43,747 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:59:43,747 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:59:43,748 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:43,748 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:59:43,748 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:59:43,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:59:43,893 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 01:59:43,893 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:59:43,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:59:43,893 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:59:43,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:59:43,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:59:43,894 INFO L87 Difference]: Start difference. First operand 640 states and 725 transitions. Second operand 4 states. [2018-01-30 01:59:44,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:59:44,236 INFO L93 Difference]: Finished difference Result 1206 states and 1370 transitions. [2018-01-30 01:59:44,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:59:44,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 202 [2018-01-30 01:59:44,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:59:44,238 INFO L225 Difference]: With dead ends: 1206 [2018-01-30 01:59:44,238 INFO L226 Difference]: Without dead ends: 684 [2018-01-30 01:59:44,239 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 01:59:44,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2018-01-30 01:59:44,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 640. [2018-01-30 01:59:44,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-01-30 01:59:44,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 724 transitions. [2018-01-30 01:59:44,245 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 724 transitions. Word has length 202 [2018-01-30 01:59:44,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:59:44,246 INFO L432 AbstractCegarLoop]: Abstraction has 640 states and 724 transitions. [2018-01-30 01:59:44,246 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:59:44,246 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 724 transitions. [2018-01-30 01:59:44,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-01-30 01:59:44,247 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:59:44,247 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 01:59:44,247 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:59:44,248 INFO L82 PathProgramCache]: Analyzing trace with hash 49668206, now seen corresponding path program 1 times [2018-01-30 01:59:44,248 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:59:44,248 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:59:44,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:44,249 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:59:44,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:59:44,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:59:44,361 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 01:59:44,362 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:59:44,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:59:44,362 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:59:44,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:59:44,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:59:44,362 INFO L87 Difference]: Start difference. First operand 640 states and 724 transitions. Second operand 4 states. [2018-01-30 01:59:44,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:59:44,547 INFO L93 Difference]: Finished difference Result 1205 states and 1368 transitions. [2018-01-30 01:59:44,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:59:44,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2018-01-30 01:59:44,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:59:44,548 INFO L225 Difference]: With dead ends: 1205 [2018-01-30 01:59:44,549 INFO L226 Difference]: Without dead ends: 683 [2018-01-30 01:59:44,549 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 01:59:44,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-01-30 01:59:44,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 640. [2018-01-30 01:59:44,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-01-30 01:59:44,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 723 transitions. [2018-01-30 01:59:44,556 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 723 transitions. Word has length 203 [2018-01-30 01:59:44,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:59:44,556 INFO L432 AbstractCegarLoop]: Abstraction has 640 states and 723 transitions. [2018-01-30 01:59:44,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:59:44,556 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 723 transitions. [2018-01-30 01:59:44,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-01-30 01:59:44,557 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:59:44,558 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 01:59:44,558 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:59:44,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1799356136, now seen corresponding path program 1 times [2018-01-30 01:59:44,558 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:59:44,558 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:59:44,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:44,559 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:59:44,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:59:44,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:59:44,760 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 01:59:44,760 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:59:44,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:59:44,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:59:44,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:59:44,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:59:44,761 INFO L87 Difference]: Start difference. First operand 640 states and 723 transitions. Second operand 4 states. [2018-01-30 01:59:44,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:59:44,990 INFO L93 Difference]: Finished difference Result 1204 states and 1366 transitions. [2018-01-30 01:59:44,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:59:44,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 205 [2018-01-30 01:59:44,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:59:44,992 INFO L225 Difference]: With dead ends: 1204 [2018-01-30 01:59:44,992 INFO L226 Difference]: Without dead ends: 682 [2018-01-30 01:59:44,993 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 01:59:44,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2018-01-30 01:59:44,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 640. [2018-01-30 01:59:44,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-01-30 01:59:44,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 722 transitions. [2018-01-30 01:59:44,999 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 722 transitions. Word has length 205 [2018-01-30 01:59:44,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:59:44,999 INFO L432 AbstractCegarLoop]: Abstraction has 640 states and 722 transitions. [2018-01-30 01:59:44,999 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:59:44,999 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 722 transitions. [2018-01-30 01:59:45,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-01-30 01:59:45,000 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:59:45,000 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 01:59:45,000 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:59:45,001 INFO L82 PathProgramCache]: Analyzing trace with hash 842176651, now seen corresponding path program 1 times [2018-01-30 01:59:45,001 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:59:45,001 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:59:45,001 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:45,001 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:59:45,001 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:59:45,010 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:59:45,258 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 01:59:45,258 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:59:45,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:59:45,259 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:59:45,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:59:45,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:59:45,259 INFO L87 Difference]: Start difference. First operand 640 states and 722 transitions. Second operand 4 states. [2018-01-30 01:59:45,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:59:45,427 INFO L93 Difference]: Finished difference Result 1196 states and 1357 transitions. [2018-01-30 01:59:45,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:59:45,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2018-01-30 01:59:45,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:59:45,429 INFO L225 Difference]: With dead ends: 1196 [2018-01-30 01:59:45,429 INFO L226 Difference]: Without dead ends: 674 [2018-01-30 01:59:45,430 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 01:59:45,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-01-30 01:59:45,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 640. [2018-01-30 01:59:45,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-01-30 01:59:45,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 721 transitions. [2018-01-30 01:59:45,436 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 721 transitions. Word has length 206 [2018-01-30 01:59:45,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:59:45,437 INFO L432 AbstractCegarLoop]: Abstraction has 640 states and 721 transitions. [2018-01-30 01:59:45,437 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:59:45,437 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 721 transitions. [2018-01-30 01:59:45,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-01-30 01:59:45,438 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:59:45,438 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 01:59:45,438 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:59:45,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1157050899, now seen corresponding path program 1 times [2018-01-30 01:59:45,438 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:59:45,438 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:59:45,439 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:45,439 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:59:45,439 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:59:45,447 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:59:45,758 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 01:59:45,759 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:59:45,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:59:45,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:59:45,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:59:45,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:59:45,759 INFO L87 Difference]: Start difference. First operand 640 states and 721 transitions. Second operand 4 states. [2018-01-30 01:59:46,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:59:46,000 INFO L93 Difference]: Finished difference Result 1195 states and 1355 transitions. [2018-01-30 01:59:46,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:59:46,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2018-01-30 01:59:46,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:59:46,002 INFO L225 Difference]: With dead ends: 1195 [2018-01-30 01:59:46,002 INFO L226 Difference]: Without dead ends: 673 [2018-01-30 01:59:46,003 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 01:59:46,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-01-30 01:59:46,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 640. [2018-01-30 01:59:46,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-01-30 01:59:46,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 720 transitions. [2018-01-30 01:59:46,009 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 720 transitions. Word has length 208 [2018-01-30 01:59:46,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:59:46,009 INFO L432 AbstractCegarLoop]: Abstraction has 640 states and 720 transitions. [2018-01-30 01:59:46,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:59:46,009 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 720 transitions. [2018-01-30 01:59:46,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-01-30 01:59:46,010 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:59:46,010 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 01:59:46,010 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:59:46,010 INFO L82 PathProgramCache]: Analyzing trace with hash -665566480, now seen corresponding path program 1 times [2018-01-30 01:59:46,010 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:59:46,010 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:59:46,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:46,011 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:59:46,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:59:46,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:59:46,123 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 01:59:46,124 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:59:46,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:59:46,124 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:59:46,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:59:46,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:59:46,124 INFO L87 Difference]: Start difference. First operand 640 states and 720 transitions. Second operand 4 states. [2018-01-30 01:59:46,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:59:46,263 INFO L93 Difference]: Finished difference Result 1172 states and 1329 transitions. [2018-01-30 01:59:46,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:59:46,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2018-01-30 01:59:46,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:59:46,265 INFO L225 Difference]: With dead ends: 1172 [2018-01-30 01:59:46,265 INFO L226 Difference]: Without dead ends: 650 [2018-01-30 01:59:46,266 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 01:59:46,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-01-30 01:59:46,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 640. [2018-01-30 01:59:46,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-01-30 01:59:46,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 719 transitions. [2018-01-30 01:59:46,271 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 719 transitions. Word has length 211 [2018-01-30 01:59:46,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:59:46,271 INFO L432 AbstractCegarLoop]: Abstraction has 640 states and 719 transitions. [2018-01-30 01:59:46,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:59:46,271 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 719 transitions. [2018-01-30 01:59:46,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-01-30 01:59:46,272 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:59:46,272 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 01:59:46,273 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:59:46,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1488459823, now seen corresponding path program 1 times [2018-01-30 01:59:46,273 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:59:46,273 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:59:46,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:46,273 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:59:46,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:59:46,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:59:46,329 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 01:59:46,329 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:59:46,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:59:46,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:59:46,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:59:46,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:59:46,330 INFO L87 Difference]: Start difference. First operand 640 states and 719 transitions. Second operand 3 states. [2018-01-30 01:59:46,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:59:46,606 INFO L93 Difference]: Finished difference Result 1168 states and 1324 transitions. [2018-01-30 01:59:46,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:59:46,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-01-30 01:59:46,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:59:46,607 INFO L225 Difference]: With dead ends: 1168 [2018-01-30 01:59:46,607 INFO L226 Difference]: Without dead ends: 646 [2018-01-30 01:59:46,608 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:59:46,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2018-01-30 01:59:46,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2018-01-30 01:59:46,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2018-01-30 01:59:46,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 725 transitions. [2018-01-30 01:59:46,614 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 725 transitions. Word has length 211 [2018-01-30 01:59:46,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:59:46,615 INFO L432 AbstractCegarLoop]: Abstraction has 646 states and 725 transitions. [2018-01-30 01:59:46,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:59:46,615 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 725 transitions. [2018-01-30 01:59:46,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-01-30 01:59:46,616 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:59:46,616 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 01:59:46,616 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:59:46,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1664192173, now seen corresponding path program 1 times [2018-01-30 01:59:46,616 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:59:46,616 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:59:46,617 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:46,617 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:59:46,617 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:59:46,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:59:46,702 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 01:59:46,702 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:59:46,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:59:46,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:59:46,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:59:46,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:59:46,703 INFO L87 Difference]: Start difference. First operand 646 states and 725 transitions. Second operand 3 states. [2018-01-30 01:59:46,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:59:46,845 INFO L93 Difference]: Finished difference Result 1672 states and 1903 transitions. [2018-01-30 01:59:46,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:59:46,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2018-01-30 01:59:46,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:59:46,847 INFO L225 Difference]: With dead ends: 1672 [2018-01-30 01:59:46,847 INFO L226 Difference]: Without dead ends: 1150 [2018-01-30 01:59:46,848 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:59:46,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2018-01-30 01:59:46,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1150. [2018-01-30 01:59:46,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1150 states. [2018-01-30 01:59:46,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1295 transitions. [2018-01-30 01:59:46,860 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1295 transitions. Word has length 212 [2018-01-30 01:59:46,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:59:46,860 INFO L432 AbstractCegarLoop]: Abstraction has 1150 states and 1295 transitions. [2018-01-30 01:59:46,860 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:59:46,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1295 transitions. [2018-01-30 01:59:46,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-01-30 01:59:46,862 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:59:46,862 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 01:59:46,862 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:59:46,862 INFO L82 PathProgramCache]: Analyzing trace with hash -698891003, now seen corresponding path program 1 times [2018-01-30 01:59:46,862 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:59:46,862 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:59:46,863 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:46,863 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:59:46,863 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:59:46,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:59:47,081 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 01:59:47,081 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:59:47,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:59:47,081 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:59:47,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:59:47,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:59:47,082 INFO L87 Difference]: Start difference. First operand 1150 states and 1295 transitions. Second operand 4 states. [2018-01-30 01:59:47,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:59:47,845 INFO L93 Difference]: Finished difference Result 2862 states and 3252 transitions. [2018-01-30 01:59:47,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:59:47,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 270 [2018-01-30 01:59:47,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:59:47,848 INFO L225 Difference]: With dead ends: 2862 [2018-01-30 01:59:47,848 INFO L226 Difference]: Without dead ends: 1836 [2018-01-30 01:59:47,849 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 01:59:47,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2018-01-30 01:59:47,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1311. [2018-01-30 01:59:47,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1311 states. [2018-01-30 01:59:47,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1498 transitions. [2018-01-30 01:59:47,863 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1498 transitions. Word has length 270 [2018-01-30 01:59:47,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:59:47,863 INFO L432 AbstractCegarLoop]: Abstraction has 1311 states and 1498 transitions. [2018-01-30 01:59:47,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:59:47,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1498 transitions. [2018-01-30 01:59:47,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-01-30 01:59:47,865 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:59:47,865 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 01:59:47,865 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:59:47,865 INFO L82 PathProgramCache]: Analyzing trace with hash -882929151, now seen corresponding path program 1 times [2018-01-30 01:59:47,865 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:59:47,865 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:59:47,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:47,866 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:59:47,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:59:47,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:59:48,181 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 01:59:48,181 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:59:48,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:59:48,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:59:48,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:59:48,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:59:48,182 INFO L87 Difference]: Start difference. First operand 1311 states and 1498 transitions. Second operand 4 states. [2018-01-30 01:59:48,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:59:48,383 INFO L93 Difference]: Finished difference Result 2655 states and 3051 transitions. [2018-01-30 01:59:48,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 01:59:48,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 270 [2018-01-30 01:59:48,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:59:48,385 INFO L225 Difference]: With dead ends: 2655 [2018-01-30 01:59:48,385 INFO L226 Difference]: Without dead ends: 1468 [2018-01-30 01:59:48,387 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 01:59:48,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2018-01-30 01:59:48,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1378. [2018-01-30 01:59:48,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1378 states. [2018-01-30 01:59:48,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1582 transitions. [2018-01-30 01:59:48,400 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1582 transitions. Word has length 270 [2018-01-30 01:59:48,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:59:48,400 INFO L432 AbstractCegarLoop]: Abstraction has 1378 states and 1582 transitions. [2018-01-30 01:59:48,400 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:59:48,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1582 transitions. [2018-01-30 01:59:48,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-01-30 01:59:48,402 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:59:48,402 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 01:59:48,402 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:59:48,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1604501312, now seen corresponding path program 1 times [2018-01-30 01:59:48,402 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:59:48,402 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:59:48,403 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:48,403 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:59:48,403 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:59:48,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:59:48,591 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 01:59:48,591 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:59:48,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:59:48,591 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:59:48,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:59:48,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:59:48,592 INFO L87 Difference]: Start difference. First operand 1378 states and 1582 transitions. Second operand 4 states. [2018-01-30 01:59:48,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:59:48,911 INFO L93 Difference]: Finished difference Result 3075 states and 3529 transitions. [2018-01-30 01:59:48,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:59:48,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 273 [2018-01-30 01:59:48,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:59:48,915 INFO L225 Difference]: With dead ends: 3075 [2018-01-30 01:59:48,915 INFO L226 Difference]: Without dead ends: 1821 [2018-01-30 01:59:48,916 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 01:59:48,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2018-01-30 01:59:48,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1384. [2018-01-30 01:59:48,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1384 states. [2018-01-30 01:59:48,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1588 transitions. [2018-01-30 01:59:48,931 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1588 transitions. Word has length 273 [2018-01-30 01:59:48,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:59:48,932 INFO L432 AbstractCegarLoop]: Abstraction has 1384 states and 1588 transitions. [2018-01-30 01:59:48,932 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:59:48,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1588 transitions. [2018-01-30 01:59:48,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-01-30 01:59:48,933 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:59:48,934 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 01:59:48,934 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:59:48,934 INFO L82 PathProgramCache]: Analyzing trace with hash -910658047, now seen corresponding path program 1 times [2018-01-30 01:59:48,934 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:59:48,934 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:59:48,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:48,935 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:59:48,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:59:48,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:59:49,307 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 01:59:49,307 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:59:49,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 01:59:49,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:59:49,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:59:49,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:59:49,308 INFO L87 Difference]: Start difference. First operand 1384 states and 1588 transitions. Second operand 6 states. [2018-01-30 01:59:50,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:59:50,095 INFO L93 Difference]: Finished difference Result 5026 states and 5780 transitions. [2018-01-30 01:59:50,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 01:59:50,095 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 283 [2018-01-30 01:59:50,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:59:50,102 INFO L225 Difference]: With dead ends: 5026 [2018-01-30 01:59:50,102 INFO L226 Difference]: Without dead ends: 3766 [2018-01-30 01:59:50,103 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 01:59:50,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3766 states. [2018-01-30 01:59:50,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3766 to 1514. [2018-01-30 01:59:50,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1514 states. [2018-01-30 01:59:50,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 1752 transitions. [2018-01-30 01:59:50,125 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 1752 transitions. Word has length 283 [2018-01-30 01:59:50,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:59:50,125 INFO L432 AbstractCegarLoop]: Abstraction has 1514 states and 1752 transitions. [2018-01-30 01:59:50,125 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:59:50,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1752 transitions. [2018-01-30 01:59:50,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-01-30 01:59:50,127 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:59:50,127 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 01:59:50,127 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:59:50,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1961975163, now seen corresponding path program 1 times [2018-01-30 01:59:50,127 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:59:50,128 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:59:50,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:50,128 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:59:50,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:50,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:59:50,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:59:50,401 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 01:59:50,401 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:59:50,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 01:59:50,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:59:50,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:59:50,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:59:50,402 INFO L87 Difference]: Start difference. First operand 1514 states and 1752 transitions. Second operand 6 states. [2018-01-30 01:59:51,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:59:51,117 INFO L93 Difference]: Finished difference Result 4415 states and 5120 transitions. [2018-01-30 01:59:51,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 01:59:51,117 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 283 [2018-01-30 01:59:51,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:59:51,123 INFO L225 Difference]: With dead ends: 4415 [2018-01-30 01:59:51,123 INFO L226 Difference]: Without dead ends: 3025 [2018-01-30 01:59:51,125 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-01-30 01:59:51,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3025 states. [2018-01-30 01:59:51,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3025 to 1528. [2018-01-30 01:59:51,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2018-01-30 01:59:51,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 1767 transitions. [2018-01-30 01:59:51,166 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 1767 transitions. Word has length 283 [2018-01-30 01:59:51,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:59:51,166 INFO L432 AbstractCegarLoop]: Abstraction has 1528 states and 1767 transitions. [2018-01-30 01:59:51,166 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:59:51,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 1767 transitions. [2018-01-30 01:59:51,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-01-30 01:59:51,168 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:59:51,168 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 01:59:51,168 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:59:51,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1291606260, now seen corresponding path program 1 times [2018-01-30 01:59:51,168 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:59:51,168 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:59:51,169 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:51,169 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:59:51,169 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:59:51,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:59:51,385 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 01:59:51,386 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:59:51,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:59:51,386 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:59:51,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:59:51,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:59:51,386 INFO L87 Difference]: Start difference. First operand 1528 states and 1767 transitions. Second operand 4 states. [2018-01-30 01:59:51,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:59:51,909 INFO L93 Difference]: Finished difference Result 3357 states and 3879 transitions. [2018-01-30 01:59:51,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:59:51,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 285 [2018-01-30 01:59:51,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:59:51,913 INFO L225 Difference]: With dead ends: 3357 [2018-01-30 01:59:51,913 INFO L226 Difference]: Without dead ends: 1953 [2018-01-30 01:59:51,914 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 01:59:51,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2018-01-30 01:59:51,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1588. [2018-01-30 01:59:51,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2018-01-30 01:59:51,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 1845 transitions. [2018-01-30 01:59:51,931 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 1845 transitions. Word has length 285 [2018-01-30 01:59:51,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:59:51,932 INFO L432 AbstractCegarLoop]: Abstraction has 1588 states and 1845 transitions. [2018-01-30 01:59:51,932 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:59:51,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 1845 transitions. [2018-01-30 01:59:51,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-01-30 01:59:51,934 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:59:51,934 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 01:59:51,934 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:59:51,934 INFO L82 PathProgramCache]: Analyzing trace with hash -2135515964, now seen corresponding path program 1 times [2018-01-30 01:59:51,934 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:59:51,934 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:59:51,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:51,935 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:59:51,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:59:51,945 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:59:52,197 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 01:59:52,198 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:59:52,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 01:59:52,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:59:52,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:59:52,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:59:52,198 INFO L87 Difference]: Start difference. First operand 1588 states and 1845 transitions. Second operand 6 states. [2018-01-30 01:59:52,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:59:52,918 INFO L93 Difference]: Finished difference Result 5223 states and 6035 transitions. [2018-01-30 01:59:52,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 01:59:52,922 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 286 [2018-01-30 01:59:52,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:59:52,928 INFO L225 Difference]: With dead ends: 5223 [2018-01-30 01:59:52,928 INFO L226 Difference]: Without dead ends: 3759 [2018-01-30 01:59:52,930 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 01:59:52,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3759 states. [2018-01-30 01:59:52,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3759 to 1594. [2018-01-30 01:59:52,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1594 states. [2018-01-30 01:59:52,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 1851 transitions. [2018-01-30 01:59:52,952 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 1851 transitions. Word has length 286 [2018-01-30 01:59:52,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:59:52,952 INFO L432 AbstractCegarLoop]: Abstraction has 1594 states and 1851 transitions. [2018-01-30 01:59:52,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:59:52,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 1851 transitions. [2018-01-30 01:59:52,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-01-30 01:59:52,954 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:59:52,954 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 01:59:52,954 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:59:52,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1214276713, now seen corresponding path program 1 times [2018-01-30 01:59:52,954 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:59:52,954 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:59:52,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:52,955 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:59:52,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:59:52,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:59:53,212 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 01:59:53,212 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:59:53,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:59:53,212 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:59:53,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:59:53,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:59:53,213 INFO L87 Difference]: Start difference. First operand 1594 states and 1851 transitions. Second operand 4 states. [2018-01-30 01:59:53,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:59:53,484 INFO L93 Difference]: Finished difference Result 3403 states and 3939 transitions. [2018-01-30 01:59:53,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:59:53,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 288 [2018-01-30 01:59:53,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:59:53,487 INFO L225 Difference]: With dead ends: 3403 [2018-01-30 01:59:53,487 INFO L226 Difference]: Without dead ends: 1933 [2018-01-30 01:59:53,488 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 01:59:53,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2018-01-30 01:59:53,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1600. [2018-01-30 01:59:53,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2018-01-30 01:59:53,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 1857 transitions. [2018-01-30 01:59:53,516 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 1857 transitions. Word has length 288 [2018-01-30 01:59:53,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:59:53,516 INFO L432 AbstractCegarLoop]: Abstraction has 1600 states and 1857 transitions. [2018-01-30 01:59:53,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:59:53,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 1857 transitions. [2018-01-30 01:59:53,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-01-30 01:59:53,518 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:59:53,518 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 01:59:53,518 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:59:53,519 INFO L82 PathProgramCache]: Analyzing trace with hash -406626672, now seen corresponding path program 1 times [2018-01-30 01:59:53,519 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:59:53,519 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:59:53,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:53,519 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:59:53,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:59:53,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:59:53,775 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 01:59:53,775 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:59:53,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 01:59:53,776 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:59:53,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:59:53,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:59:53,776 INFO L87 Difference]: Start difference. First operand 1600 states and 1857 transitions. Second operand 6 states. [2018-01-30 01:59:54,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:59:54,401 INFO L93 Difference]: Finished difference Result 5213 states and 6019 transitions. [2018-01-30 01:59:54,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 01:59:54,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 298 [2018-01-30 01:59:54,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:59:54,413 INFO L225 Difference]: With dead ends: 5213 [2018-01-30 01:59:54,413 INFO L226 Difference]: Without dead ends: 3737 [2018-01-30 01:59:54,414 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 01:59:54,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3737 states. [2018-01-30 01:59:54,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3737 to 1660. [2018-01-30 01:59:54,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1660 states. [2018-01-30 01:59:54,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 1935 transitions. [2018-01-30 01:59:54,439 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 1935 transitions. Word has length 298 [2018-01-30 01:59:54,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:59:54,439 INFO L432 AbstractCegarLoop]: Abstraction has 1660 states and 1935 transitions. [2018-01-30 01:59:54,439 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:59:54,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 1935 transitions. [2018-01-30 01:59:54,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-01-30 01:59:54,441 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:59:54,441 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 01:59:54,441 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:59:54,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1163047323, now seen corresponding path program 1 times [2018-01-30 01:59:54,441 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:59:54,442 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:59:54,452 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:54,452 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:59:54,452 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:59:54,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:59:54,922 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 01:59:54,922 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:59:54,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 01:59:54,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:59:54,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:59:54,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:59:54,923 INFO L87 Difference]: Start difference. First operand 1660 states and 1935 transitions. Second operand 6 states. [2018-01-30 01:59:55,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:59:55,531 INFO L93 Difference]: Finished difference Result 5247 states and 6067 transitions. [2018-01-30 01:59:55,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 01:59:55,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 301 [2018-01-30 01:59:55,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:59:55,537 INFO L225 Difference]: With dead ends: 5247 [2018-01-30 01:59:55,537 INFO L226 Difference]: Without dead ends: 3711 [2018-01-30 01:59:55,539 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 01:59:55,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3711 states. [2018-01-30 01:59:55,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3711 to 1492. [2018-01-30 01:59:55,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1492 states. [2018-01-30 01:59:55,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1717 transitions. [2018-01-30 01:59:55,563 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1717 transitions. Word has length 301 [2018-01-30 01:59:55,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:59:55,563 INFO L432 AbstractCegarLoop]: Abstraction has 1492 states and 1717 transitions. [2018-01-30 01:59:55,563 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:59:55,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1717 transitions. [2018-01-30 01:59:55,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-01-30 01:59:55,565 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:59:55,565 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 01:59:55,565 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:59:55,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1279517913, now seen corresponding path program 1 times [2018-01-30 01:59:55,565 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:59:55,565 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:59:55,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:55,566 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:59:55,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:55,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:59:55,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:59:55,765 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 01:59:55,765 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:59:55,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:59:55,766 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:59:55,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:59:55,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:59:55,766 INFO L87 Difference]: Start difference. First operand 1492 states and 1717 transitions. Second operand 4 states. [2018-01-30 01:59:56,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:59:56,026 INFO L93 Difference]: Finished difference Result 3363 states and 3883 transitions. [2018-01-30 01:59:56,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:59:56,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2018-01-30 01:59:56,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:59:56,028 INFO L225 Difference]: With dead ends: 3363 [2018-01-30 01:59:56,028 INFO L226 Difference]: Without dead ends: 1995 [2018-01-30 01:59:56,029 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 01:59:56,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2018-01-30 01:59:56,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1534. [2018-01-30 01:59:56,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1534 states. [2018-01-30 01:59:56,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1534 states and 1771 transitions. [2018-01-30 01:59:56,053 INFO L78 Accepts]: Start accepts. Automaton has 1534 states and 1771 transitions. Word has length 306 [2018-01-30 01:59:56,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:59:56,053 INFO L432 AbstractCegarLoop]: Abstraction has 1534 states and 1771 transitions. [2018-01-30 01:59:56,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:59:56,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 1771 transitions. [2018-01-30 01:59:56,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-01-30 01:59:56,055 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:59:56,055 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 01:59:56,055 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:59:56,055 INFO L82 PathProgramCache]: Analyzing trace with hash 117578275, now seen corresponding path program 1 times [2018-01-30 01:59:56,055 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:59:56,055 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:59:56,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:56,056 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:59:56,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:59:56,076 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:59:56,416 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 01:59:56,416 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:59:56,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:59:56,416 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:59:56,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:59:56,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:59:56,417 INFO L87 Difference]: Start difference. First operand 1534 states and 1771 transitions. Second operand 4 states. [2018-01-30 01:59:56,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:59:56,743 INFO L93 Difference]: Finished difference Result 3066 states and 3556 transitions. [2018-01-30 01:59:56,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:59:56,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2018-01-30 01:59:56,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:59:56,746 INFO L225 Difference]: With dead ends: 3066 [2018-01-30 01:59:56,746 INFO L226 Difference]: Without dead ends: 1656 [2018-01-30 01:59:56,747 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 01:59:56,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2018-01-30 01:59:56,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1555. [2018-01-30 01:59:56,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 01:59:56,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1798 transitions. [2018-01-30 01:59:56,766 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1798 transitions. Word has length 306 [2018-01-30 01:59:56,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:59:56,766 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1798 transitions. [2018-01-30 01:59:56,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:59:56,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1798 transitions. [2018-01-30 01:59:56,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-01-30 01:59:56,768 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:59:56,768 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 01:59:56,768 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:59:56,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1592573511, now seen corresponding path program 1 times [2018-01-30 01:59:56,768 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:59:56,768 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:59:56,769 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:56,769 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:59:56,769 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:59:56,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:59:56,928 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 01:59:56,928 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:59:56,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:59:56,928 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:59:56,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:59:56,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:59:56,929 INFO L87 Difference]: Start difference. First operand 1555 states and 1798 transitions. Second operand 4 states. [2018-01-30 01:59:57,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:59:57,158 INFO L93 Difference]: Finished difference Result 3445 states and 3987 transitions. [2018-01-30 01:59:57,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:59:57,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2018-01-30 01:59:57,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:59:57,160 INFO L225 Difference]: With dead ends: 3445 [2018-01-30 01:59:57,160 INFO L226 Difference]: Without dead ends: 2014 [2018-01-30 01:59:57,161 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 01:59:57,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2018-01-30 01:59:57,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 1555. [2018-01-30 01:59:57,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 01:59:57,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1796 transitions. [2018-01-30 01:59:57,181 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1796 transitions. Word has length 308 [2018-01-30 01:59:57,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:59:57,181 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1796 transitions. [2018-01-30 01:59:57,181 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:59:57,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1796 transitions. [2018-01-30 01:59:57,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-01-30 01:59:57,182 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:59:57,182 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 01:59:57,182 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:59:57,183 INFO L82 PathProgramCache]: Analyzing trace with hash 987066805, now seen corresponding path program 1 times [2018-01-30 01:59:57,183 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:59:57,183 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:59:57,183 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:57,183 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:59:57,183 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:59:57,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:59:57,410 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 01:59:57,410 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:59:57,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:59:57,411 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:59:57,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:59:57,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:59:57,411 INFO L87 Difference]: Start difference. First operand 1555 states and 1796 transitions. Second operand 4 states. [2018-01-30 01:59:57,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:59:57,583 INFO L93 Difference]: Finished difference Result 3086 states and 3577 transitions. [2018-01-30 01:59:57,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:59:57,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2018-01-30 01:59:57,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:59:57,590 INFO L225 Difference]: With dead ends: 3086 [2018-01-30 01:59:57,590 INFO L226 Difference]: Without dead ends: 1655 [2018-01-30 01:59:57,592 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 01:59:57,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2018-01-30 01:59:57,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1555. [2018-01-30 01:59:57,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 01:59:57,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1795 transitions. [2018-01-30 01:59:57,612 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1795 transitions. Word has length 308 [2018-01-30 01:59:57,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:59:57,612 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1795 transitions. [2018-01-30 01:59:57,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:59:57,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1795 transitions. [2018-01-30 01:59:57,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-01-30 01:59:57,614 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:59:57,614 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 01:59:57,614 INFO L371 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:59:57,614 INFO L82 PathProgramCache]: Analyzing trace with hash -980376054, now seen corresponding path program 1 times [2018-01-30 01:59:57,614 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:59:57,614 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:59:57,615 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:57,615 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:59:57,615 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:59:57,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:59:57,843 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 01:59:57,844 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:59:57,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:59:57,844 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:59:57,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:59:57,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:59:57,844 INFO L87 Difference]: Start difference. First operand 1555 states and 1795 transitions. Second operand 4 states. [2018-01-30 01:59:58,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:59:58,104 INFO L93 Difference]: Finished difference Result 3443 states and 3979 transitions. [2018-01-30 01:59:58,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:59:58,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 309 [2018-01-30 01:59:58,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:59:58,105 INFO L225 Difference]: With dead ends: 3443 [2018-01-30 01:59:58,105 INFO L226 Difference]: Without dead ends: 2012 [2018-01-30 01:59:58,106 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 01:59:58,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2012 states. [2018-01-30 01:59:58,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2012 to 1555. [2018-01-30 01:59:58,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 01:59:58,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1793 transitions. [2018-01-30 01:59:58,126 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1793 transitions. Word has length 309 [2018-01-30 01:59:58,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:59:58,126 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1793 transitions. [2018-01-30 01:59:58,126 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:59:58,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1793 transitions. [2018-01-30 01:59:58,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-01-30 01:59:58,128 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:59:58,128 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 01:59:58,128 INFO L371 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:59:58,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1679062414, now seen corresponding path program 1 times [2018-01-30 01:59:58,128 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:59:58,128 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:59:58,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:58,129 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:59:58,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:59:58,139 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:59:58,275 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 01:59:58,275 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:59:58,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:59:58,276 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:59:58,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:59:58,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:59:58,276 INFO L87 Difference]: Start difference. First operand 1555 states and 1793 transitions. Second operand 4 states. [2018-01-30 01:59:58,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:59:58,465 INFO L93 Difference]: Finished difference Result 3085 states and 3570 transitions. [2018-01-30 01:59:58,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:59:58,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 309 [2018-01-30 01:59:58,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:59:58,466 INFO L225 Difference]: With dead ends: 3085 [2018-01-30 01:59:58,466 INFO L226 Difference]: Without dead ends: 1654 [2018-01-30 01:59:58,467 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 01:59:58,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2018-01-30 01:59:58,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1555. [2018-01-30 01:59:58,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 01:59:58,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1792 transitions. [2018-01-30 01:59:58,486 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1792 transitions. Word has length 309 [2018-01-30 01:59:58,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:59:58,486 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1792 transitions. [2018-01-30 01:59:58,486 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:59:58,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1792 transitions. [2018-01-30 01:59:58,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-01-30 01:59:58,487 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:59:58,488 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 01:59:58,488 INFO L371 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:59:58,488 INFO L82 PathProgramCache]: Analyzing trace with hash 465555380, now seen corresponding path program 1 times [2018-01-30 01:59:58,488 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:59:58,488 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:59:58,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:58,489 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:59:58,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:59:58,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:59:58,649 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 01:59:58,649 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:59:58,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:59:58,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:59:58,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:59:58,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:59:58,650 INFO L87 Difference]: Start difference. First operand 1555 states and 1792 transitions. Second operand 4 states. [2018-01-30 01:59:58,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:59:58,889 INFO L93 Difference]: Finished difference Result 3441 states and 3971 transitions. [2018-01-30 01:59:58,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:59:58,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 311 [2018-01-30 01:59:58,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:59:58,890 INFO L225 Difference]: With dead ends: 3441 [2018-01-30 01:59:58,890 INFO L226 Difference]: Without dead ends: 2010 [2018-01-30 01:59:58,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 01:59:58,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2010 states. [2018-01-30 01:59:58,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2010 to 1555. [2018-01-30 01:59:58,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 01:59:58,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1790 transitions. [2018-01-30 01:59:58,915 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1790 transitions. Word has length 311 [2018-01-30 01:59:58,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:59:58,915 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1790 transitions. [2018-01-30 01:59:58,915 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:59:58,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1790 transitions. [2018-01-30 01:59:58,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-01-30 01:59:58,917 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:59:58,917 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 01:59:58,917 INFO L371 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:59:58,917 INFO L82 PathProgramCache]: Analyzing trace with hash 680382008, now seen corresponding path program 1 times [2018-01-30 01:59:58,917 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:59:58,917 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:59:58,918 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:58,918 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:59:58,918 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:59:58,927 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:59:59,093 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 01:59:59,093 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:59:59,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:59:59,093 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:59:59,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:59:59,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:59:59,093 INFO L87 Difference]: Start difference. First operand 1555 states and 1790 transitions. Second operand 4 states. [2018-01-30 01:59:59,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:59:59,301 INFO L93 Difference]: Finished difference Result 3084 states and 3563 transitions. [2018-01-30 01:59:59,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:59:59,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 311 [2018-01-30 01:59:59,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:59:59,303 INFO L225 Difference]: With dead ends: 3084 [2018-01-30 01:59:59,303 INFO L226 Difference]: Without dead ends: 1653 [2018-01-30 01:59:59,304 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 01:59:59,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2018-01-30 01:59:59,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1555. [2018-01-30 01:59:59,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 01:59:59,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1789 transitions. [2018-01-30 01:59:59,348 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1789 transitions. Word has length 311 [2018-01-30 01:59:59,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:59:59,355 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1789 transitions. [2018-01-30 01:59:59,355 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:59:59,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1789 transitions. [2018-01-30 01:59:59,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-01-30 01:59:59,357 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:59:59,357 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 01:59:59,357 INFO L371 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:59:59,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1960010385, now seen corresponding path program 1 times [2018-01-30 01:59:59,357 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:59:59,357 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:59:59,358 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:59,358 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:59:59,358 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:59:59,370 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:59:59,637 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 01:59:59,637 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:59:59,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:59:59,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:59:59,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:59:59,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:59:59,638 INFO L87 Difference]: Start difference. First operand 1555 states and 1789 transitions. Second operand 4 states. [2018-01-30 01:59:59,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:59:59,902 INFO L93 Difference]: Finished difference Result 3425 states and 3949 transitions. [2018-01-30 01:59:59,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:59:59,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 312 [2018-01-30 01:59:59,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:59:59,904 INFO L225 Difference]: With dead ends: 3425 [2018-01-30 01:59:59,904 INFO L226 Difference]: Without dead ends: 1994 [2018-01-30 01:59:59,905 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 01:59:59,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2018-01-30 01:59:59,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1555. [2018-01-30 01:59:59,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 01:59:59,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1787 transitions. [2018-01-30 01:59:59,927 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1787 transitions. Word has length 312 [2018-01-30 01:59:59,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:59:59,928 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1787 transitions. [2018-01-30 01:59:59,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:59:59,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1787 transitions. [2018-01-30 01:59:59,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-01-30 01:59:59,929 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:59:59,929 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 01:59:59,929 INFO L371 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 01:59:59,930 INFO L82 PathProgramCache]: Analyzing trace with hash 404647787, now seen corresponding path program 1 times [2018-01-30 01:59:59,930 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:59:59,930 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:59:59,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:59,930 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:59:59,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:59:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:59:59,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:00,103 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:00:00,103 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:00,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:00:00,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:00:00,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:00:00,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:00:00,104 INFO L87 Difference]: Start difference. First operand 1555 states and 1787 transitions. Second operand 4 states. [2018-01-30 02:00:00,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:00,300 INFO L93 Difference]: Finished difference Result 3076 states and 3549 transitions. [2018-01-30 02:00:00,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:00:00,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 312 [2018-01-30 02:00:00,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:00,310 INFO L225 Difference]: With dead ends: 3076 [2018-01-30 02:00:00,310 INFO L226 Difference]: Without dead ends: 1645 [2018-01-30 02:00:00,311 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:00:00,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2018-01-30 02:00:00,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1555. [2018-01-30 02:00:00,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 02:00:00,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1786 transitions. [2018-01-30 02:00:00,332 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1786 transitions. Word has length 312 [2018-01-30 02:00:00,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:00,332 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1786 transitions. [2018-01-30 02:00:00,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:00:00,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1786 transitions. [2018-01-30 02:00:00,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-01-30 02:00:00,334 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:00,334 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:00:00,334 INFO L371 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:00,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1114297903, now seen corresponding path program 1 times [2018-01-30 02:00:00,334 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:00,334 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:00,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:00,335 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:00,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:00,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:00,494 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:00:00,494 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:00,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:00:00,494 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:00:00,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:00:00,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:00:00,495 INFO L87 Difference]: Start difference. First operand 1555 states and 1786 transitions. Second operand 4 states. [2018-01-30 02:00:00,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:00,733 INFO L93 Difference]: Finished difference Result 3423 states and 3941 transitions. [2018-01-30 02:00:00,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:00:00,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 314 [2018-01-30 02:00:00,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:00,735 INFO L225 Difference]: With dead ends: 3423 [2018-01-30 02:00:00,735 INFO L226 Difference]: Without dead ends: 1992 [2018-01-30 02:00:00,736 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:00:00,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2018-01-30 02:00:00,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1555. [2018-01-30 02:00:00,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 02:00:00,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1784 transitions. [2018-01-30 02:00:00,758 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1784 transitions. Word has length 314 [2018-01-30 02:00:00,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:00,758 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1784 transitions. [2018-01-30 02:00:00,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:00:00,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1784 transitions. [2018-01-30 02:00:00,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-01-30 02:00:00,760 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:00,760 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:00:00,760 INFO L371 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:00,760 INFO L82 PathProgramCache]: Analyzing trace with hash -715494195, now seen corresponding path program 1 times [2018-01-30 02:00:00,760 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:00,760 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:00,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:00,761 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:00,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:00,770 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:00,922 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:00:00,923 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:00,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:00:00,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:00:00,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:00:00,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:00:00,923 INFO L87 Difference]: Start difference. First operand 1555 states and 1784 transitions. Second operand 4 states. [2018-01-30 02:00:01,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:01,124 INFO L93 Difference]: Finished difference Result 3075 states and 3542 transitions. [2018-01-30 02:00:01,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:00:01,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 314 [2018-01-30 02:00:01,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:01,126 INFO L225 Difference]: With dead ends: 3075 [2018-01-30 02:00:01,126 INFO L226 Difference]: Without dead ends: 1644 [2018-01-30 02:00:01,127 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:00:01,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2018-01-30 02:00:01,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1555. [2018-01-30 02:00:01,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 02:00:01,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1783 transitions. [2018-01-30 02:00:01,147 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1783 transitions. Word has length 314 [2018-01-30 02:00:01,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:01,147 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1783 transitions. [2018-01-30 02:00:01,147 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:00:01,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1783 transitions. [2018-01-30 02:00:01,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-01-30 02:00:01,149 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:01,149 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:00:01,149 INFO L371 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:01,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1678617740, now seen corresponding path program 1 times [2018-01-30 02:00:01,149 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:01,149 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:01,150 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:01,150 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:01,150 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:01,158 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:01,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:00:01,429 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:01,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:00:01,429 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:00:01,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:00:01,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:00:01,430 INFO L87 Difference]: Start difference. First operand 1555 states and 1783 transitions. Second operand 4 states. [2018-01-30 02:00:01,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:01,642 INFO L93 Difference]: Finished difference Result 3377 states and 3885 transitions. [2018-01-30 02:00:01,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:00:01,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 317 [2018-01-30 02:00:01,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:01,643 INFO L225 Difference]: With dead ends: 3377 [2018-01-30 02:00:01,643 INFO L226 Difference]: Without dead ends: 1946 [2018-01-30 02:00:01,644 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:00:01,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2018-01-30 02:00:01,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1555. [2018-01-30 02:00:01,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-01-30 02:00:01,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1781 transitions. [2018-01-30 02:00:01,666 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1781 transitions. Word has length 317 [2018-01-30 02:00:01,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:01,666 INFO L432 AbstractCegarLoop]: Abstraction has 1555 states and 1781 transitions. [2018-01-30 02:00:01,666 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:00:01,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1781 transitions. [2018-01-30 02:00:01,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-01-30 02:00:01,667 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:01,668 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:00:01,668 INFO L371 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:01,668 INFO L82 PathProgramCache]: Analyzing trace with hash 855724397, now seen corresponding path program 1 times [2018-01-30 02:00:01,668 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:01,668 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:01,668 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:01,668 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:01,669 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:01,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:01,866 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:00:01,866 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:01,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:00:01,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:00:01,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:00:01,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:00:01,867 INFO L87 Difference]: Start difference. First operand 1555 states and 1781 transitions. Second operand 4 states. [2018-01-30 02:00:02,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:02,119 INFO L93 Difference]: Finished difference Result 3375 states and 3879 transitions. [2018-01-30 02:00:02,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:00:02,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 317 [2018-01-30 02:00:02,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:02,120 INFO L225 Difference]: With dead ends: 3375 [2018-01-30 02:00:02,120 INFO L226 Difference]: Without dead ends: 1944 [2018-01-30 02:00:02,121 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:00:02,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2018-01-30 02:00:02,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1561. [2018-01-30 02:00:02,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2018-01-30 02:00:02,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 1787 transitions. [2018-01-30 02:00:02,143 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 1787 transitions. Word has length 317 [2018-01-30 02:00:02,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:02,143 INFO L432 AbstractCegarLoop]: Abstraction has 1561 states and 1787 transitions. [2018-01-30 02:00:02,143 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:00:02,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1787 transitions. [2018-01-30 02:00:02,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-01-30 02:00:02,144 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:02,144 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:00:02,144 INFO L371 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:02,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1734625264, now seen corresponding path program 1 times [2018-01-30 02:00:02,145 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:02,145 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:02,146 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:02,146 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:02,146 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:02,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:02,291 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:00:02,291 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:02,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:00:02,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:00:02,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:00:02,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:00:02,292 INFO L87 Difference]: Start difference. First operand 1561 states and 1787 transitions. Second operand 4 states. [2018-01-30 02:00:02,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:02,460 INFO L93 Difference]: Finished difference Result 3064 states and 3523 transitions. [2018-01-30 02:00:02,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:00:02,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 317 [2018-01-30 02:00:02,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:02,462 INFO L225 Difference]: With dead ends: 3064 [2018-01-30 02:00:02,462 INFO L226 Difference]: Without dead ends: 1627 [2018-01-30 02:00:02,463 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:00:02,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2018-01-30 02:00:02,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1561. [2018-01-30 02:00:02,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2018-01-30 02:00:02,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 1786 transitions. [2018-01-30 02:00:02,484 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 1786 transitions. Word has length 317 [2018-01-30 02:00:02,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:02,484 INFO L432 AbstractCegarLoop]: Abstraction has 1561 states and 1786 transitions. [2018-01-30 02:00:02,484 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:00:02,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1786 transitions. [2018-01-30 02:00:02,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-01-30 02:00:02,486 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:02,486 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:00:02,486 INFO L371 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:02,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1737448689, now seen corresponding path program 1 times [2018-01-30 02:00:02,486 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:02,486 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:02,487 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:02,487 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:02,487 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:02,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:02,630 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:00:02,630 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:02,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:00:02,630 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:00:02,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:00:02,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:00:02,631 INFO L87 Difference]: Start difference. First operand 1561 states and 1786 transitions. Second operand 4 states. [2018-01-30 02:00:02,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:02,823 INFO L93 Difference]: Finished difference Result 3063 states and 3520 transitions. [2018-01-30 02:00:02,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:00:02,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 317 [2018-01-30 02:00:02,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:02,824 INFO L225 Difference]: With dead ends: 3063 [2018-01-30 02:00:02,824 INFO L226 Difference]: Without dead ends: 1626 [2018-01-30 02:00:02,825 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:00:02,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2018-01-30 02:00:02,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1564. [2018-01-30 02:00:02,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2018-01-30 02:00:02,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 1789 transitions. [2018-01-30 02:00:02,846 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 1789 transitions. Word has length 317 [2018-01-30 02:00:02,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:02,847 INFO L432 AbstractCegarLoop]: Abstraction has 1564 states and 1789 transitions. [2018-01-30 02:00:02,847 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:00:02,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 1789 transitions. [2018-01-30 02:00:02,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-01-30 02:00:02,848 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:02,848 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:00:02,848 INFO L371 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:02,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1880545483, now seen corresponding path program 1 times [2018-01-30 02:00:02,849 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:02,849 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:02,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:02,849 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:02,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:02,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:03,043 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:00:03,043 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:03,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:00:03,043 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:00:03,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:00:03,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:00:03,044 INFO L87 Difference]: Start difference. First operand 1564 states and 1789 transitions. Second operand 6 states. [2018-01-30 02:00:03,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:03,797 INFO L93 Difference]: Finished difference Result 4923 states and 5607 transitions. [2018-01-30 02:00:03,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:00:03,797 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 318 [2018-01-30 02:00:03,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:03,799 INFO L225 Difference]: With dead ends: 4923 [2018-01-30 02:00:03,799 INFO L226 Difference]: Without dead ends: 3483 [2018-01-30 02:00:03,800 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:00:03,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3483 states. [2018-01-30 02:00:03,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3483 to 1564. [2018-01-30 02:00:03,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2018-01-30 02:00:03,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 1787 transitions. [2018-01-30 02:00:03,827 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 1787 transitions. Word has length 318 [2018-01-30 02:00:03,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:03,827 INFO L432 AbstractCegarLoop]: Abstraction has 1564 states and 1787 transitions. [2018-01-30 02:00:03,827 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:00:03,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 1787 transitions. [2018-01-30 02:00:03,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-01-30 02:00:03,829 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:03,829 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:00:03,829 INFO L371 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:03,829 INFO L82 PathProgramCache]: Analyzing trace with hash -316896207, now seen corresponding path program 1 times [2018-01-30 02:00:03,829 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:03,829 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:03,830 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:03,830 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:03,830 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:03,839 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:03,980 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:00:03,980 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:03,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:00:03,981 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:00:03,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:00:03,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:00:03,981 INFO L87 Difference]: Start difference. First operand 1564 states and 1787 transitions. Second operand 6 states. [2018-01-30 02:00:04,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:04,386 INFO L93 Difference]: Finished difference Result 4465 states and 5115 transitions. [2018-01-30 02:00:04,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:00:04,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 318 [2018-01-30 02:00:04,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:04,388 INFO L225 Difference]: With dead ends: 4465 [2018-01-30 02:00:04,389 INFO L226 Difference]: Without dead ends: 3025 [2018-01-30 02:00:04,390 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:00:04,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3025 states. [2018-01-30 02:00:04,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3025 to 1564. [2018-01-30 02:00:04,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2018-01-30 02:00:04,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 1786 transitions. [2018-01-30 02:00:04,419 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 1786 transitions. Word has length 318 [2018-01-30 02:00:04,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:04,420 INFO L432 AbstractCegarLoop]: Abstraction has 1564 states and 1786 transitions. [2018-01-30 02:00:04,420 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:00:04,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 1786 transitions. [2018-01-30 02:00:04,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-01-30 02:00:04,421 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:04,421 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:00:04,421 INFO L371 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:04,421 INFO L82 PathProgramCache]: Analyzing trace with hash 834207267, now seen corresponding path program 1 times [2018-01-30 02:00:04,421 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:04,421 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:04,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:04,422 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:04,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:04,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:04,796 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:00:04,797 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:04,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:00:04,797 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:00:04,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:00:04,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:00:04,797 INFO L87 Difference]: Start difference. First operand 1564 states and 1786 transitions. Second operand 6 states. [2018-01-30 02:00:05,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:05,430 INFO L93 Difference]: Finished difference Result 4919 states and 5597 transitions. [2018-01-30 02:00:05,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:00:05,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 319 [2018-01-30 02:00:05,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:05,433 INFO L225 Difference]: With dead ends: 4919 [2018-01-30 02:00:05,433 INFO L226 Difference]: Without dead ends: 3479 [2018-01-30 02:00:05,434 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:00:05,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3479 states. [2018-01-30 02:00:05,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3479 to 1564. [2018-01-30 02:00:05,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2018-01-30 02:00:05,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 1784 transitions. [2018-01-30 02:00:05,465 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 1784 transitions. Word has length 319 [2018-01-30 02:00:05,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:05,465 INFO L432 AbstractCegarLoop]: Abstraction has 1564 states and 1784 transitions. [2018-01-30 02:00:05,465 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:00:05,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 1784 transitions. [2018-01-30 02:00:05,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-01-30 02:00:05,466 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:05,467 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:00:05,467 INFO L371 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:05,467 INFO L82 PathProgramCache]: Analyzing trace with hash 2062694567, now seen corresponding path program 1 times [2018-01-30 02:00:05,467 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:05,467 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:05,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:05,468 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:05,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:05,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:05,650 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:00:05,650 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:05,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:00:05,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:00:05,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:00:05,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:00:05,650 INFO L87 Difference]: Start difference. First operand 1564 states and 1784 transitions. Second operand 6 states. [2018-01-30 02:00:06,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:06,193 INFO L93 Difference]: Finished difference Result 4463 states and 5107 transitions. [2018-01-30 02:00:06,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:00:06,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 319 [2018-01-30 02:00:06,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:06,195 INFO L225 Difference]: With dead ends: 4463 [2018-01-30 02:00:06,195 INFO L226 Difference]: Without dead ends: 3023 [2018-01-30 02:00:06,196 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:00:06,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3023 states. [2018-01-30 02:00:06,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3023 to 1564. [2018-01-30 02:00:06,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2018-01-30 02:00:06,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 1783 transitions. [2018-01-30 02:00:06,226 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 1783 transitions. Word has length 319 [2018-01-30 02:00:06,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:06,227 INFO L432 AbstractCegarLoop]: Abstraction has 1564 states and 1783 transitions. [2018-01-30 02:00:06,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:00:06,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 1783 transitions. [2018-01-30 02:00:06,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-01-30 02:00:06,228 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:06,228 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:00:06,228 INFO L371 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:06,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1597638454, now seen corresponding path program 1 times [2018-01-30 02:00:06,228 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:06,229 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:06,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:06,229 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:06,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:06,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:06,358 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:00:06,358 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:06,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:00:06,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:00:06,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:00:06,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:00:06,358 INFO L87 Difference]: Start difference. First operand 1564 states and 1783 transitions. Second operand 4 states. [2018-01-30 02:00:06,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:06,580 INFO L93 Difference]: Finished difference Result 3385 states and 3873 transitions. [2018-01-30 02:00:06,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:00:06,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 320 [2018-01-30 02:00:06,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:06,581 INFO L225 Difference]: With dead ends: 3385 [2018-01-30 02:00:06,581 INFO L226 Difference]: Without dead ends: 1945 [2018-01-30 02:00:06,582 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:00:06,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1945 states. [2018-01-30 02:00:06,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1945 to 1570. [2018-01-30 02:00:06,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2018-01-30 02:00:06,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 1789 transitions. [2018-01-30 02:00:06,611 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 1789 transitions. Word has length 320 [2018-01-30 02:00:06,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:06,611 INFO L432 AbstractCegarLoop]: Abstraction has 1570 states and 1789 transitions. [2018-01-30 02:00:06,611 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:00:06,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 1789 transitions. [2018-01-30 02:00:06,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-01-30 02:00:06,613 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:06,613 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:00:06,613 INFO L371 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:06,613 INFO L82 PathProgramCache]: Analyzing trace with hash 2125729478, now seen corresponding path program 1 times [2018-01-30 02:00:06,613 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:06,613 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:06,613 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:06,614 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:06,614 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:06,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:06,770 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:00:06,770 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:06,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:00:06,770 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:00:06,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:00:06,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:00:06,770 INFO L87 Difference]: Start difference. First operand 1570 states and 1789 transitions. Second operand 4 states. [2018-01-30 02:00:06,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:06,947 INFO L93 Difference]: Finished difference Result 3077 states and 3521 transitions. [2018-01-30 02:00:06,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:00:06,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 320 [2018-01-30 02:00:06,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:06,948 INFO L225 Difference]: With dead ends: 3077 [2018-01-30 02:00:06,948 INFO L226 Difference]: Without dead ends: 1631 [2018-01-30 02:00:06,949 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:00:06,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2018-01-30 02:00:06,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1573. [2018-01-30 02:00:06,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2018-01-30 02:00:06,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 1792 transitions. [2018-01-30 02:00:06,976 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 1792 transitions. Word has length 320 [2018-01-30 02:00:06,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:06,976 INFO L432 AbstractCegarLoop]: Abstraction has 1573 states and 1792 transitions. [2018-01-30 02:00:06,976 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:00:06,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1792 transitions. [2018-01-30 02:00:06,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-01-30 02:00:06,978 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:06,978 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:00:06,978 INFO L371 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:06,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1822206539, now seen corresponding path program 1 times [2018-01-30 02:00:06,978 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:06,978 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:06,979 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:06,979 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:06,979 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:06,988 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:07,350 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:00:07,351 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:07,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:00:07,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:00:07,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:00:07,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:00:07,351 INFO L87 Difference]: Start difference. First operand 1573 states and 1792 transitions. Second operand 6 states. [2018-01-30 02:00:08,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:08,026 INFO L93 Difference]: Finished difference Result 4933 states and 5602 transitions. [2018-01-30 02:00:08,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:00:08,027 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 321 [2018-01-30 02:00:08,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:08,029 INFO L225 Difference]: With dead ends: 4933 [2018-01-30 02:00:08,029 INFO L226 Difference]: Without dead ends: 3484 [2018-01-30 02:00:08,031 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:00:08,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3484 states. [2018-01-30 02:00:08,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3484 to 1573. [2018-01-30 02:00:08,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2018-01-30 02:00:08,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 1790 transitions. [2018-01-30 02:00:08,069 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 1790 transitions. Word has length 321 [2018-01-30 02:00:08,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:08,069 INFO L432 AbstractCegarLoop]: Abstraction has 1573 states and 1790 transitions. [2018-01-30 02:00:08,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:00:08,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1790 transitions. [2018-01-30 02:00:08,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-01-30 02:00:08,070 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:08,070 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:00:08,071 INFO L371 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:08,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1933049657, now seen corresponding path program 1 times [2018-01-30 02:00:08,071 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:08,071 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:08,071 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:08,071 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:08,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:08,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:08,246 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:00:08,246 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:08,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:00:08,246 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:00:08,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:00:08,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:00:08,247 INFO L87 Difference]: Start difference. First operand 1573 states and 1790 transitions. Second operand 6 states. [2018-01-30 02:00:08,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:08,821 INFO L93 Difference]: Finished difference Result 4479 states and 5114 transitions. [2018-01-30 02:00:08,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:00:08,821 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 321 [2018-01-30 02:00:08,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:08,823 INFO L225 Difference]: With dead ends: 4479 [2018-01-30 02:00:08,824 INFO L226 Difference]: Without dead ends: 3030 [2018-01-30 02:00:08,825 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:00:08,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2018-01-30 02:00:08,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 1573. [2018-01-30 02:00:08,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2018-01-30 02:00:08,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 1789 transitions. [2018-01-30 02:00:08,859 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 1789 transitions. Word has length 321 [2018-01-30 02:00:08,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:08,859 INFO L432 AbstractCegarLoop]: Abstraction has 1573 states and 1789 transitions. [2018-01-30 02:00:08,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:00:08,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1789 transitions. [2018-01-30 02:00:08,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-01-30 02:00:08,861 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:08,861 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:00:08,861 INFO L371 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:08,861 INFO L82 PathProgramCache]: Analyzing trace with hash 490934670, now seen corresponding path program 1 times [2018-01-30 02:00:08,861 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:08,861 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:08,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:08,862 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:08,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:08,870 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:09,057 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:00:09,058 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:09,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:00:09,058 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:00:09,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:00:09,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:00:09,058 INFO L87 Difference]: Start difference. First operand 1573 states and 1789 transitions. Second operand 6 states. [2018-01-30 02:00:09,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:09,594 INFO L93 Difference]: Finished difference Result 4931 states and 5594 transitions. [2018-01-30 02:00:09,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:00:09,595 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 322 [2018-01-30 02:00:09,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:09,597 INFO L225 Difference]: With dead ends: 4931 [2018-01-30 02:00:09,597 INFO L226 Difference]: Without dead ends: 3482 [2018-01-30 02:00:09,599 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:00:09,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3482 states. [2018-01-30 02:00:09,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3482 to 1573. [2018-01-30 02:00:09,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2018-01-30 02:00:09,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 1787 transitions. [2018-01-30 02:00:09,636 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 1787 transitions. Word has length 322 [2018-01-30 02:00:09,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:09,636 INFO L432 AbstractCegarLoop]: Abstraction has 1573 states and 1787 transitions. [2018-01-30 02:00:09,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:00:09,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1787 transitions. [2018-01-30 02:00:09,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-01-30 02:00:09,637 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:09,637 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:00:09,637 INFO L371 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:09,638 INFO L82 PathProgramCache]: Analyzing trace with hash 939759754, now seen corresponding path program 1 times [2018-01-30 02:00:09,638 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:09,638 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:09,638 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:09,638 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:09,638 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:09,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:09,974 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:00:09,974 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:09,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:00:09,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:00:09,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:00:09,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:00:09,975 INFO L87 Difference]: Start difference. First operand 1573 states and 1787 transitions. Second operand 6 states. [2018-01-30 02:00:10,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:10,374 INFO L93 Difference]: Finished difference Result 4478 states and 5107 transitions. [2018-01-30 02:00:10,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:00:10,374 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 322 [2018-01-30 02:00:10,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:10,376 INFO L225 Difference]: With dead ends: 4478 [2018-01-30 02:00:10,376 INFO L226 Difference]: Without dead ends: 3029 [2018-01-30 02:00:10,378 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:00:10,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3029 states. [2018-01-30 02:00:10,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3029 to 1573. [2018-01-30 02:00:10,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2018-01-30 02:00:10,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 1786 transitions. [2018-01-30 02:00:10,418 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 1786 transitions. Word has length 322 [2018-01-30 02:00:10,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:10,418 INFO L432 AbstractCegarLoop]: Abstraction has 1573 states and 1786 transitions. [2018-01-30 02:00:10,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:00:10,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1786 transitions. [2018-01-30 02:00:10,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-01-30 02:00:10,419 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:10,420 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:00:10,420 INFO L371 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:10,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1816681029, now seen corresponding path program 1 times [2018-01-30 02:00:10,420 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:10,420 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:10,420 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:10,421 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:10,421 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:10,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:10,579 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:00:10,579 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:10,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:00:10,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:00:10,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:00:10,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:00:10,580 INFO L87 Difference]: Start difference. First operand 1573 states and 1786 transitions. Second operand 4 states. [2018-01-30 02:00:10,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:10,837 INFO L93 Difference]: Finished difference Result 3378 states and 3851 transitions. [2018-01-30 02:00:10,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:00:10,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 323 [2018-01-30 02:00:10,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:10,839 INFO L225 Difference]: With dead ends: 3378 [2018-01-30 02:00:10,839 INFO L226 Difference]: Without dead ends: 1929 [2018-01-30 02:00:10,840 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:00:10,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2018-01-30 02:00:10,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1579. [2018-01-30 02:00:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2018-01-30 02:00:10,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 1792 transitions. [2018-01-30 02:00:10,874 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 1792 transitions. Word has length 323 [2018-01-30 02:00:10,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:10,875 INFO L432 AbstractCegarLoop]: Abstraction has 1579 states and 1792 transitions. [2018-01-30 02:00:10,875 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:00:10,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 1792 transitions. [2018-01-30 02:00:10,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-01-30 02:00:10,876 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:10,877 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:00:10,877 INFO L371 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:10,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1449610551, now seen corresponding path program 1 times [2018-01-30 02:00:10,877 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:10,877 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:10,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:10,877 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:10,878 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:10,886 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:11,033 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:00:11,033 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:11,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:00:11,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:00:11,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:00:11,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:00:11,034 INFO L87 Difference]: Start difference. First operand 1579 states and 1792 transitions. Second operand 4 states. [2018-01-30 02:00:11,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:11,234 INFO L93 Difference]: Finished difference Result 3079 states and 3509 transitions. [2018-01-30 02:00:11,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:00:11,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 323 [2018-01-30 02:00:11,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:11,235 INFO L225 Difference]: With dead ends: 3079 [2018-01-30 02:00:11,235 INFO L226 Difference]: Without dead ends: 1624 [2018-01-30 02:00:11,236 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:00:11,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2018-01-30 02:00:11,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1582. [2018-01-30 02:00:11,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2018-01-30 02:00:11,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1795 transitions. [2018-01-30 02:00:11,269 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1795 transitions. Word has length 323 [2018-01-30 02:00:11,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:11,269 INFO L432 AbstractCegarLoop]: Abstraction has 1582 states and 1795 transitions. [2018-01-30 02:00:11,269 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:00:11,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1795 transitions. [2018-01-30 02:00:11,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-01-30 02:00:11,271 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:11,271 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:00:11,271 INFO L371 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:11,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1350920760, now seen corresponding path program 1 times [2018-01-30 02:00:11,271 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:11,271 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:11,272 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:11,272 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:11,272 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:11,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:11,419 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:00:11,420 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:11,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:00:11,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:00:11,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:00:11,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:00:11,420 INFO L87 Difference]: Start difference. First operand 1582 states and 1795 transitions. Second operand 6 states. [2018-01-30 02:00:12,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:12,068 INFO L93 Difference]: Finished difference Result 4928 states and 5581 transitions. [2018-01-30 02:00:12,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:00:12,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 324 [2018-01-30 02:00:12,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:12,071 INFO L225 Difference]: With dead ends: 4928 [2018-01-30 02:00:12,071 INFO L226 Difference]: Without dead ends: 3470 [2018-01-30 02:00:12,072 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:00:12,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3470 states. [2018-01-30 02:00:12,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3470 to 1582. [2018-01-30 02:00:12,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2018-01-30 02:00:12,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1793 transitions. [2018-01-30 02:00:12,110 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1793 transitions. Word has length 324 [2018-01-30 02:00:12,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:12,111 INFO L432 AbstractCegarLoop]: Abstraction has 1582 states and 1793 transitions. [2018-01-30 02:00:12,111 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:00:12,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1793 transitions. [2018-01-30 02:00:12,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-01-30 02:00:12,112 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:12,112 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:00:12,112 INFO L371 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:12,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1119870412, now seen corresponding path program 1 times [2018-01-30 02:00:12,112 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:12,112 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:12,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:12,113 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:12,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:12,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:12,307 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:00:12,307 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:12,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:00:12,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:00:12,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:00:12,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:00:12,307 INFO L87 Difference]: Start difference. First operand 1582 states and 1793 transitions. Second operand 6 states. [2018-01-30 02:00:12,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:12,890 INFO L93 Difference]: Finished difference Result 4482 states and 5101 transitions. [2018-01-30 02:00:12,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:00:12,890 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 324 [2018-01-30 02:00:12,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:12,891 INFO L225 Difference]: With dead ends: 4482 [2018-01-30 02:00:12,892 INFO L226 Difference]: Without dead ends: 3024 [2018-01-30 02:00:12,893 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:00:12,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3024 states. [2018-01-30 02:00:12,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3024 to 1582. [2018-01-30 02:00:12,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2018-01-30 02:00:12,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1792 transitions. [2018-01-30 02:00:12,933 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1792 transitions. Word has length 324 [2018-01-30 02:00:12,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:12,934 INFO L432 AbstractCegarLoop]: Abstraction has 1582 states and 1792 transitions. [2018-01-30 02:00:12,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:00:12,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1792 transitions. [2018-01-30 02:00:12,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-01-30 02:00:12,935 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:12,935 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:00:12,935 INFO L371 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:12,935 INFO L82 PathProgramCache]: Analyzing trace with hash -283487381, now seen corresponding path program 1 times [2018-01-30 02:00:12,935 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:12,935 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:12,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:12,936 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:12,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:12,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:13,167 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:00:13,167 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:13,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:00:13,168 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:00:13,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:00:13,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:00:13,168 INFO L87 Difference]: Start difference. First operand 1582 states and 1792 transitions. Second operand 6 states. [2018-01-30 02:00:13,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:13,719 INFO L93 Difference]: Finished difference Result 4912 states and 5559 transitions. [2018-01-30 02:00:13,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:00:13,719 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 325 [2018-01-30 02:00:13,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:13,721 INFO L225 Difference]: With dead ends: 4912 [2018-01-30 02:00:13,721 INFO L226 Difference]: Without dead ends: 3454 [2018-01-30 02:00:13,723 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:00:13,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3454 states. [2018-01-30 02:00:13,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3454 to 1582. [2018-01-30 02:00:13,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2018-01-30 02:00:13,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1790 transitions. [2018-01-30 02:00:13,765 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1790 transitions. Word has length 325 [2018-01-30 02:00:13,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:13,765 INFO L432 AbstractCegarLoop]: Abstraction has 1582 states and 1790 transitions. [2018-01-30 02:00:13,765 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:00:13,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1790 transitions. [2018-01-30 02:00:13,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-01-30 02:00:13,767 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:13,767 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:00:13,767 INFO L371 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:13,767 INFO L82 PathProgramCache]: Analyzing trace with hash 431397615, now seen corresponding path program 1 times [2018-01-30 02:00:13,767 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:13,767 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:13,767 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:13,768 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:13,768 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:13,775 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:14,018 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:00:14,019 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:14,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:00:14,019 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:00:14,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:00:14,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:00:14,019 INFO L87 Difference]: Start difference. First operand 1582 states and 1790 transitions. Second operand 6 states. [2018-01-30 02:00:14,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:14,534 INFO L93 Difference]: Finished difference Result 4474 states and 5087 transitions. [2018-01-30 02:00:14,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:00:14,534 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 325 [2018-01-30 02:00:14,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:14,536 INFO L225 Difference]: With dead ends: 4474 [2018-01-30 02:00:14,536 INFO L226 Difference]: Without dead ends: 3016 [2018-01-30 02:00:14,537 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:00:14,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2018-01-30 02:00:14,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 1582. [2018-01-30 02:00:14,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2018-01-30 02:00:14,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1789 transitions. [2018-01-30 02:00:14,578 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1789 transitions. Word has length 325 [2018-01-30 02:00:14,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:14,578 INFO L432 AbstractCegarLoop]: Abstraction has 1582 states and 1789 transitions. [2018-01-30 02:00:14,579 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:00:14,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1789 transitions. [2018-01-30 02:00:14,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-01-30 02:00:14,580 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:14,580 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:00:14,580 INFO L371 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:14,580 INFO L82 PathProgramCache]: Analyzing trace with hash -588427059, now seen corresponding path program 1 times [2018-01-30 02:00:14,580 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:14,580 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:14,581 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:14,581 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:14,581 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:14,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:14,735 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:00:14,736 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:14,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:00:14,736 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:00:14,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:00:14,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:00:14,736 INFO L87 Difference]: Start difference. First operand 1582 states and 1789 transitions. Second operand 6 states. [2018-01-30 02:00:15,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:15,296 INFO L93 Difference]: Finished difference Result 4910 states and 5551 transitions. [2018-01-30 02:00:15,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:00:15,296 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 327 [2018-01-30 02:00:15,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:15,298 INFO L225 Difference]: With dead ends: 4910 [2018-01-30 02:00:15,299 INFO L226 Difference]: Without dead ends: 3452 [2018-01-30 02:00:15,300 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:00:15,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3452 states. [2018-01-30 02:00:15,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3452 to 1582. [2018-01-30 02:00:15,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2018-01-30 02:00:15,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1787 transitions. [2018-01-30 02:00:15,345 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1787 transitions. Word has length 327 [2018-01-30 02:00:15,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:15,346 INFO L432 AbstractCegarLoop]: Abstraction has 1582 states and 1787 transitions. [2018-01-30 02:00:15,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:00:15,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1787 transitions. [2018-01-30 02:00:15,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-01-30 02:00:15,347 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:15,347 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:00:15,347 INFO L371 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:15,347 INFO L82 PathProgramCache]: Analyzing trace with hash -778713263, now seen corresponding path program 1 times [2018-01-30 02:00:15,347 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:15,347 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:15,348 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:15,348 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:15,348 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:15,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:15,564 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:00:15,564 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:15,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:00:15,564 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:00:15,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:00:15,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:00:15,565 INFO L87 Difference]: Start difference. First operand 1582 states and 1787 transitions. Second operand 6 states. [2018-01-30 02:00:16,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:16,084 INFO L93 Difference]: Finished difference Result 4473 states and 5080 transitions. [2018-01-30 02:00:16,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:00:16,084 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 327 [2018-01-30 02:00:16,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:16,086 INFO L225 Difference]: With dead ends: 4473 [2018-01-30 02:00:16,086 INFO L226 Difference]: Without dead ends: 3015 [2018-01-30 02:00:16,087 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:00:16,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3015 states. [2018-01-30 02:00:16,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3015 to 1582. [2018-01-30 02:00:16,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2018-01-30 02:00:16,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1786 transitions. [2018-01-30 02:00:16,133 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1786 transitions. Word has length 327 [2018-01-30 02:00:16,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:16,133 INFO L432 AbstractCegarLoop]: Abstraction has 1582 states and 1786 transitions. [2018-01-30 02:00:16,133 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:00:16,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1786 transitions. [2018-01-30 02:00:16,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-01-30 02:00:16,134 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:16,134 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:00:16,134 INFO L371 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:16,135 INFO L82 PathProgramCache]: Analyzing trace with hash -143764464, now seen corresponding path program 1 times [2018-01-30 02:00:16,135 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:16,135 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:16,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:16,135 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:16,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:16,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:16,290 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:00:16,290 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:16,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:00:16,290 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:00:16,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:00:16,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:00:16,291 INFO L87 Difference]: Start difference. First operand 1582 states and 1786 transitions. Second operand 6 states. [2018-01-30 02:00:16,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:16,852 INFO L93 Difference]: Finished difference Result 4864 states and 5495 transitions. [2018-01-30 02:00:16,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:00:16,852 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 330 [2018-01-30 02:00:16,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:16,855 INFO L225 Difference]: With dead ends: 4864 [2018-01-30 02:00:16,855 INFO L226 Difference]: Without dead ends: 3406 [2018-01-30 02:00:16,856 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:00:16,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3406 states. [2018-01-30 02:00:16,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3406 to 1582. [2018-01-30 02:00:16,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2018-01-30 02:00:16,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1784 transitions. [2018-01-30 02:00:16,905 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1784 transitions. Word has length 330 [2018-01-30 02:00:16,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:16,905 INFO L432 AbstractCegarLoop]: Abstraction has 1582 states and 1784 transitions. [2018-01-30 02:00:16,905 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:00:16,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1784 transitions. [2018-01-30 02:00:16,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-01-30 02:00:16,906 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:16,906 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:00:16,906 INFO L371 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:16,907 INFO L82 PathProgramCache]: Analyzing trace with hash -966657807, now seen corresponding path program 1 times [2018-01-30 02:00:16,907 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:16,907 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:16,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:16,907 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:16,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:16,915 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:17,101 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:00:17,101 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:17,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:00:17,101 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:00:17,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:00:17,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:00:17,102 INFO L87 Difference]: Start difference. First operand 1582 states and 1784 transitions. Second operand 6 states. [2018-01-30 02:00:17,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:17,680 INFO L93 Difference]: Finished difference Result 4862 states and 5489 transitions. [2018-01-30 02:00:17,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:00:17,681 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 330 [2018-01-30 02:00:17,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:17,682 INFO L225 Difference]: With dead ends: 4862 [2018-01-30 02:00:17,682 INFO L226 Difference]: Without dead ends: 3404 [2018-01-30 02:00:17,684 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:00:17,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3404 states. [2018-01-30 02:00:17,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3404 to 1582. [2018-01-30 02:00:17,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2018-01-30 02:00:17,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1782 transitions. [2018-01-30 02:00:17,733 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1782 transitions. Word has length 330 [2018-01-30 02:00:17,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:17,733 INFO L432 AbstractCegarLoop]: Abstraction has 1582 states and 1782 transitions. [2018-01-30 02:00:17,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:00:17,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1782 transitions. [2018-01-30 02:00:17,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-01-30 02:00:17,734 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:17,734 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:00:17,734 INFO L371 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:17,734 INFO L82 PathProgramCache]: Analyzing trace with hash 396762892, now seen corresponding path program 1 times [2018-01-30 02:00:17,734 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:17,734 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:17,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:17,735 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:17,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:17,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:17,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:17,889 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:00:17,889 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:17,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:00:17,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:00:17,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:00:17,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:00:17,889 INFO L87 Difference]: Start difference. First operand 1582 states and 1782 transitions. Second operand 6 states. [2018-01-30 02:00:18,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:18,401 INFO L93 Difference]: Finished difference Result 4450 states and 5045 transitions. [2018-01-30 02:00:18,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:00:18,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 330 [2018-01-30 02:00:18,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:18,403 INFO L225 Difference]: With dead ends: 4450 [2018-01-30 02:00:18,403 INFO L226 Difference]: Without dead ends: 2992 [2018-01-30 02:00:18,405 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:00:18,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2018-01-30 02:00:18,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 1582. [2018-01-30 02:00:18,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2018-01-30 02:00:18,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1781 transitions. [2018-01-30 02:00:18,454 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1781 transitions. Word has length 330 [2018-01-30 02:00:18,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:18,454 INFO L432 AbstractCegarLoop]: Abstraction has 1582 states and 1781 transitions. [2018-01-30 02:00:18,454 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:00:18,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1781 transitions. [2018-01-30 02:00:18,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-01-30 02:00:18,455 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:18,455 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:00:18,456 INFO L371 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:18,456 INFO L82 PathProgramCache]: Analyzing trace with hash -426130451, now seen corresponding path program 1 times [2018-01-30 02:00:18,456 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:18,456 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:18,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:18,456 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:18,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:18,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:18,683 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:00:18,684 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:18,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:00:18,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:00:18,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:00:18,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:00:18,684 INFO L87 Difference]: Start difference. First operand 1582 states and 1781 transitions. Second operand 6 states. [2018-01-30 02:00:19,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:19,198 INFO L93 Difference]: Finished difference Result 4449 states and 5042 transitions. [2018-01-30 02:00:19,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:00:19,198 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 330 [2018-01-30 02:00:19,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:19,200 INFO L225 Difference]: With dead ends: 4449 [2018-01-30 02:00:19,200 INFO L226 Difference]: Without dead ends: 2991 [2018-01-30 02:00:19,202 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:00:19,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2018-01-30 02:00:19,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 1582. [2018-01-30 02:00:19,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2018-01-30 02:00:19,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 1780 transitions. [2018-01-30 02:00:19,252 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 1780 transitions. Word has length 330 [2018-01-30 02:00:19,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:19,252 INFO L432 AbstractCegarLoop]: Abstraction has 1582 states and 1780 transitions. [2018-01-30 02:00:19,252 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:00:19,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1780 transitions. [2018-01-30 02:00:19,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-01-30 02:00:19,253 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:19,253 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:00:19,253 INFO L371 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:19,254 INFO L82 PathProgramCache]: Analyzing trace with hash 724540588, now seen corresponding path program 1 times [2018-01-30 02:00:19,254 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:19,254 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:19,254 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:19,254 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:19,254 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:19,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:19,387 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:00:19,388 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:19,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:00:19,388 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:00:19,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:00:19,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:00:19,388 INFO L87 Difference]: Start difference. First operand 1582 states and 1780 transitions. Second operand 4 states. [2018-01-30 02:00:19,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:19,639 INFO L93 Difference]: Finished difference Result 3388 states and 3829 transitions. [2018-01-30 02:00:19,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:00:19,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 333 [2018-01-30 02:00:19,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:19,641 INFO L225 Difference]: With dead ends: 3388 [2018-01-30 02:00:19,641 INFO L226 Difference]: Without dead ends: 1930 [2018-01-30 02:00:19,642 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:00:19,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2018-01-30 02:00:19,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1600. [2018-01-30 02:00:19,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2018-01-30 02:00:19,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 1802 transitions. [2018-01-30 02:00:19,690 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 1802 transitions. Word has length 333 [2018-01-30 02:00:19,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:19,690 INFO L432 AbstractCegarLoop]: Abstraction has 1600 states and 1802 transitions. [2018-01-30 02:00:19,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:00:19,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 1802 transitions. [2018-01-30 02:00:19,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-01-30 02:00:19,692 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:19,692 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:00:19,692 INFO L371 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:19,692 INFO L82 PathProgramCache]: Analyzing trace with hash 495710918, now seen corresponding path program 1 times [2018-01-30 02:00:19,692 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:19,692 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:19,693 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:19,693 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:19,693 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:19,700 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:20,011 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:00:20,011 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:20,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:00:20,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:00:20,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:00:20,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:00:20,012 INFO L87 Difference]: Start difference. First operand 1600 states and 1802 transitions. Second operand 6 states. [2018-01-30 02:00:20,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:20,629 INFO L93 Difference]: Finished difference Result 4894 states and 5519 transitions. [2018-01-30 02:00:20,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:00:20,629 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 333 [2018-01-30 02:00:20,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:20,631 INFO L225 Difference]: With dead ends: 4894 [2018-01-30 02:00:20,631 INFO L226 Difference]: Without dead ends: 3418 [2018-01-30 02:00:20,632 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:00:20,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3418 states. [2018-01-30 02:00:20,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3418 to 1600. [2018-01-30 02:00:20,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2018-01-30 02:00:20,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 1800 transitions. [2018-01-30 02:00:20,686 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 1800 transitions. Word has length 333 [2018-01-30 02:00:20,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:20,686 INFO L432 AbstractCegarLoop]: Abstraction has 1600 states and 1800 transitions. [2018-01-30 02:00:20,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:00:20,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 1800 transitions. [2018-01-30 02:00:20,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-01-30 02:00:20,687 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:20,687 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:00:20,687 INFO L371 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:20,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1742610480, now seen corresponding path program 1 times [2018-01-30 02:00:20,687 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:20,687 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:20,688 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:20,688 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:20,688 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:20,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:00:20,791 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:00:20,791 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:20,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:00:20,792 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:00:20,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:00:20,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:00:20,792 INFO L87 Difference]: Start difference. First operand 1600 states and 1800 transitions. Second operand 3 states. [2018-01-30 02:00:20,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:20,903 INFO L93 Difference]: Finished difference Result 3869 states and 4375 transitions. [2018-01-30 02:00:20,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:00:20,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2018-01-30 02:00:20,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:20,905 INFO L225 Difference]: With dead ends: 3869 [2018-01-30 02:00:20,905 INFO L226 Difference]: Without dead ends: 2393 [2018-01-30 02:00:20,906 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:00:20,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2018-01-30 02:00:20,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 2393. [2018-01-30 02:00:20,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2393 states. [2018-01-30 02:00:20,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2393 states and 2696 transitions. [2018-01-30 02:00:20,982 INFO L78 Accepts]: Start accepts. Automaton has 2393 states and 2696 transitions. Word has length 333 [2018-01-30 02:00:20,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:20,983 INFO L432 AbstractCegarLoop]: Abstraction has 2393 states and 2696 transitions. [2018-01-30 02:00:20,983 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:00:20,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 2696 transitions. [2018-01-30 02:00:20,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-01-30 02:00:20,984 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:20,984 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:00:20,984 INFO L371 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:20,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1827425741, now seen corresponding path program 1 times [2018-01-30 02:00:20,984 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:20,984 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:20,985 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:20,985 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:20,985 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:20,995 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:21,096 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:00:21,096 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:21,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:00:21,097 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:00:21,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:00:21,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:00:21,097 INFO L87 Difference]: Start difference. First operand 2393 states and 2696 transitions. Second operand 3 states. [2018-01-30 02:00:21,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:21,213 INFO L93 Difference]: Finished difference Result 5457 states and 6168 transitions. [2018-01-30 02:00:21,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:00:21,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 338 [2018-01-30 02:00:21,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:21,215 INFO L225 Difference]: With dead ends: 5457 [2018-01-30 02:00:21,216 INFO L226 Difference]: Without dead ends: 3188 [2018-01-30 02:00:21,217 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:00:21,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3188 states. [2018-01-30 02:00:21,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3188 to 3186. [2018-01-30 02:00:21,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3186 states. [2018-01-30 02:00:21,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3186 states to 3186 states and 3596 transitions. [2018-01-30 02:00:21,319 INFO L78 Accepts]: Start accepts. Automaton has 3186 states and 3596 transitions. Word has length 338 [2018-01-30 02:00:21,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:21,319 INFO L432 AbstractCegarLoop]: Abstraction has 3186 states and 3596 transitions. [2018-01-30 02:00:21,319 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:00:21,319 INFO L276 IsEmpty]: Start isEmpty. Operand 3186 states and 3596 transitions. [2018-01-30 02:00:21,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-01-30 02:00:21,321 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:21,321 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:00:21,321 INFO L371 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:21,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1505981764, now seen corresponding path program 1 times [2018-01-30 02:00:21,321 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:21,321 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:21,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:21,322 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:21,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:21,330 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:21,437 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:00:21,437 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:21,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:00:21,437 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:00:21,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:00:21,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:00:21,437 INFO L87 Difference]: Start difference. First operand 3186 states and 3596 transitions. Second operand 3 states. [2018-01-30 02:00:21,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:21,664 INFO L93 Difference]: Finished difference Result 7043 states and 7966 transitions. [2018-01-30 02:00:21,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:00:21,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 353 [2018-01-30 02:00:21,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:21,666 INFO L225 Difference]: With dead ends: 7043 [2018-01-30 02:00:21,667 INFO L226 Difference]: Without dead ends: 3981 [2018-01-30 02:00:21,669 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:00:21,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3981 states. [2018-01-30 02:00:21,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3981 to 3979. [2018-01-30 02:00:21,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3979 states. [2018-01-30 02:00:21,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3979 states to 3979 states and 4482 transitions. [2018-01-30 02:00:21,797 INFO L78 Accepts]: Start accepts. Automaton has 3979 states and 4482 transitions. Word has length 353 [2018-01-30 02:00:21,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:21,797 INFO L432 AbstractCegarLoop]: Abstraction has 3979 states and 4482 transitions. [2018-01-30 02:00:21,797 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:00:21,797 INFO L276 IsEmpty]: Start isEmpty. Operand 3979 states and 4482 transitions. [2018-01-30 02:00:21,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2018-01-30 02:00:21,799 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:21,799 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:00:21,799 INFO L371 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:21,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1498543733, now seen corresponding path program 1 times [2018-01-30 02:00:21,799 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:21,800 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:21,800 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:21,800 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:21,800 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:21,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:21,810 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:21,974 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:00:21,974 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:21,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:00:21,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:00:21,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:00:21,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:00:21,975 INFO L87 Difference]: Start difference. First operand 3979 states and 4482 transitions. Second operand 3 states. [2018-01-30 02:00:22,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:22,137 INFO L93 Difference]: Finished difference Result 8627 states and 9737 transitions. [2018-01-30 02:00:22,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:00:22,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 406 [2018-01-30 02:00:22,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:22,139 INFO L225 Difference]: With dead ends: 8627 [2018-01-30 02:00:22,140 INFO L226 Difference]: Without dead ends: 4772 [2018-01-30 02:00:22,143 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:00:22,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4772 states. [2018-01-30 02:00:22,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4772 to 4772. [2018-01-30 02:00:22,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4772 states. [2018-01-30 02:00:22,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4772 states to 4772 states and 5379 transitions. [2018-01-30 02:00:22,297 INFO L78 Accepts]: Start accepts. Automaton has 4772 states and 5379 transitions. Word has length 406 [2018-01-30 02:00:22,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:22,297 INFO L432 AbstractCegarLoop]: Abstraction has 4772 states and 5379 transitions. [2018-01-30 02:00:22,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:00:22,297 INFO L276 IsEmpty]: Start isEmpty. Operand 4772 states and 5379 transitions. [2018-01-30 02:00:22,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2018-01-30 02:00:22,299 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:22,299 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:00:22,299 INFO L371 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:22,300 INFO L82 PathProgramCache]: Analyzing trace with hash 823054654, now seen corresponding path program 1 times [2018-01-30 02:00:22,300 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:22,300 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:22,300 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:22,300 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:22,300 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:22,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:22,439 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:00:22,439 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:22,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:00:22,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:00:22,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:00:22,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:00:22,440 INFO L87 Difference]: Start difference. First operand 4772 states and 5379 transitions. Second operand 3 states. [2018-01-30 02:00:22,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:22,793 INFO L93 Difference]: Finished difference Result 5569 states and 6276 transitions. [2018-01-30 02:00:22,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:00:22,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 423 [2018-01-30 02:00:22,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:22,797 INFO L225 Difference]: With dead ends: 5569 [2018-01-30 02:00:22,797 INFO L226 Difference]: Without dead ends: 5567 [2018-01-30 02:00:22,798 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:00:22,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5567 states. [2018-01-30 02:00:22,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5567 to 5565. [2018-01-30 02:00:22,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5565 states. [2018-01-30 02:00:22,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5565 states to 5565 states and 6273 transitions. [2018-01-30 02:00:22,978 INFO L78 Accepts]: Start accepts. Automaton has 5565 states and 6273 transitions. Word has length 423 [2018-01-30 02:00:22,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:22,979 INFO L432 AbstractCegarLoop]: Abstraction has 5565 states and 6273 transitions. [2018-01-30 02:00:22,979 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:00:22,979 INFO L276 IsEmpty]: Start isEmpty. Operand 5565 states and 6273 transitions. [2018-01-30 02:00:22,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2018-01-30 02:00:22,982 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:22,982 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:00:22,982 INFO L371 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:22,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1805838887, now seen corresponding path program 1 times [2018-01-30 02:00:22,982 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:22,982 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:22,983 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:22,983 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:22,983 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:23,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:28,001 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:00:28,001 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:00:28,001 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:00:28,039 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:28,154 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:00:28,194 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:00:28,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:00:28,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:28,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 02:00:28,246 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:28,275 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:28,277 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:00:28,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:00:28,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:28,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-01-30 02:00:28,346 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:00:28,355 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:00:28,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:00:28,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:28,365 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:00:28,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-01-30 02:00:28,416 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:28,417 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:28,418 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:28,418 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:00:28,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:00:28,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:28,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:46 [2018-01-30 02:00:28,489 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:00:28,491 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:28,492 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:00:28,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:00:28,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:28,503 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:00:28,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:64 [2018-01-30 02:00:28,555 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:28,555 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:28,556 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:28,556 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:28,557 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:00:28,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:00:28,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:28,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:61 [2018-01-30 02:00:28,588 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:00:28,597 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:28,597 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:28,598 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:00:28,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:00:28,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:28,612 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:00:28,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:74, output treesize:79 [2018-01-30 02:00:28,766 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:00:28,795 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:28,800 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:28,800 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:28,804 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:00:28,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:00:28,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:28,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:28,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-01-30 02:00:28,825 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:00:28,879 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:28,898 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:28,916 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:28,970 INFO L303 Elim1Store]: Index analysis took 144 ms [2018-01-30 02:00:28,971 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:00:28,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:00:29,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:29,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:29,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-01-30 02:00:29,367 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:00:29,395 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:29,414 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:29,419 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:29,422 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:00:29,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:00:29,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:29,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:29,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-01-30 02:00:29,480 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:00:29,499 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:29,499 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:29,500 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:29,502 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:00:29,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:00:29,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:29,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:29,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-01-30 02:00:29,589 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:00:29,615 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:29,633 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:29,651 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:29,655 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:00:29,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:00:29,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:29,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:29,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-01-30 02:00:29,699 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:00:29,722 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:29,723 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:29,723 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:29,726 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:00:29,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:00:29,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:29,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:29,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-01-30 02:00:29,757 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:00:29,759 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:29,760 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:29,760 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:29,763 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:00:29,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:00:29,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:29,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:29,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-01-30 02:00:29,824 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:00:29,835 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:29,836 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:29,836 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:29,839 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:00:29,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:00:29,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:29,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:29,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-01-30 02:00:29,905 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:00:29,935 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:29,951 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:29,969 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:29,972 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:00:29,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:00:29,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:29,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:29,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-01-30 02:00:30,062 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:00:30,063 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:00:30,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:00:30,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:30,078 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:00:30,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:104, output treesize:79 [2018-01-30 02:00:30,082 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:00:30,096 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:30,096 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:30,097 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:30,099 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:00:30,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:00:30,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:30,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:30,116 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-01-30 02:00:30,119 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:00:30,121 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:30,121 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:30,122 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:30,124 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:00:30,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:00:30,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:30,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:30,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-01-30 02:00:30,184 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:00:30,185 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:00:30,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:00:30,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:30,229 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:00:30,230 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:30,232 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:30,232 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:30,235 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:00:30,235 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 02:00:30,246 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:30,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:30,253 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:111, output treesize:88 [2018-01-30 02:00:30,298 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:00:30,302 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:00:30,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:00:30,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:30,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:30,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:97, output treesize:14 [2018-01-30 02:00:30,336 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:00:30,338 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:00:30,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:00:30,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:30,344 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:00:30,344 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:23 [2018-01-30 02:00:30,442 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:00:30,445 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:30,445 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:30,446 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:00:30,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:00:30,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:30,456 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:00:30,456 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-01-30 02:00:30,576 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:00:30,589 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:00:30,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:00:30,606 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:30,606 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:00:30,606 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:00:30,607 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 02:00:30,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:00:30,611 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:00:30,611 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2018-01-30 02:00:31,772 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:00:31,790 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:00:31,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2018-01-30 02:00:31,791 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-30 02:00:31,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-30 02:00:31,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1156, Unknown=0, NotChecked=0, Total=1260 [2018-01-30 02:00:31,791 INFO L87 Difference]: Start difference. First operand 5565 states and 6273 transitions. Second operand 36 states. [2018-01-30 02:00:35,698 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 77 DAG size of output 75 [2018-01-30 02:00:37,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:00:37,812 INFO L93 Difference]: Finished difference Result 19449 states and 22056 transitions. [2018-01-30 02:00:37,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-30 02:00:37,812 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 530 [2018-01-30 02:00:37,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:00:37,827 INFO L225 Difference]: With dead ends: 19449 [2018-01-30 02:00:37,827 INFO L226 Difference]: Without dead ends: 14008 [2018-01-30 02:00:37,835 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 595 GetRequests, 519 SyntacticMatches, 15 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=442, Invalid=3464, Unknown=0, NotChecked=0, Total=3906 [2018-01-30 02:00:37,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14008 states. [2018-01-30 02:00:38,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14008 to 9443. [2018-01-30 02:00:38,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9443 states. [2018-01-30 02:00:38,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9443 states to 9443 states and 10862 transitions. [2018-01-30 02:00:38,214 INFO L78 Accepts]: Start accepts. Automaton has 9443 states and 10862 transitions. Word has length 530 [2018-01-30 02:00:38,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:00:38,215 INFO L432 AbstractCegarLoop]: Abstraction has 9443 states and 10862 transitions. [2018-01-30 02:00:38,215 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-30 02:00:38,215 INFO L276 IsEmpty]: Start isEmpty. Operand 9443 states and 10862 transitions. [2018-01-30 02:00:38,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2018-01-30 02:00:38,225 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:00:38,225 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:00:38,225 INFO L371 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:00:38,225 INFO L82 PathProgramCache]: Analyzing trace with hash 2010356397, now seen corresponding path program 1 times [2018-01-30 02:00:38,225 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:00:38,226 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:00:38,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:38,226 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:00:38,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:00:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:00:38,247 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:00:38,925 WARN L146 SmtUtils]: Spent 268ms on a formula simplification. DAG size of input: 42 DAG size of output 28 [2018-01-30 02:00:39,106 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-01-30 02:00:39,106 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:00:39,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 02:00:39,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 02:00:39,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 02:00:39,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 02:00:39,107 INFO L87 Difference]: Start difference. First operand 9443 states and 10862 transitions. Second operand 8 states. Received shutdown request... [2018-01-30 02:00:39,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:00:39,929 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 02:00:39,932 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 02:00:39,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 02:00:39 BoogieIcfgContainer [2018-01-30 02:00:39,932 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 02:00:39,933 INFO L168 Benchmark]: Toolchain (without parser) took 63383.18 ms. Allocated memory was 147.8 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 110.5 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 283.7 MB. Max. memory is 5.3 GB. [2018-01-30 02:00:39,933 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 147.8 MB. Free memory is still 117.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 02:00:39,933 INFO L168 Benchmark]: CACSL2BoogieTranslator took 221.28 ms. Allocated memory is still 147.8 MB. Free memory was 110.3 MB in the beginning and 82.4 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 5.3 GB. [2018-01-30 02:00:39,934 INFO L168 Benchmark]: Boogie Preprocessor took 37.93 ms. Allocated memory is still 147.8 MB. Free memory was 82.4 MB in the beginning and 78.8 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:00:39,934 INFO L168 Benchmark]: RCFGBuilder took 1963.03 ms. Allocated memory was 147.8 MB in the beginning and 170.9 MB in the end (delta: 23.1 MB). Free memory was 78.8 MB in the beginning and 107.7 MB in the end (delta: -28.9 MB). Peak memory consumption was 24.5 MB. Max. memory is 5.3 GB. [2018-01-30 02:00:39,934 INFO L168 Benchmark]: TraceAbstraction took 61158.45 ms. Allocated memory was 170.9 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 107.7 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 257.8 MB. Max. memory is 5.3 GB. [2018-01-30 02:00:39,935 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 147.8 MB. Free memory is still 117.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 221.28 ms. Allocated memory is still 147.8 MB. Free memory was 110.3 MB in the beginning and 82.4 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.93 ms. Allocated memory is still 147.8 MB. Free memory was 82.4 MB in the beginning and 78.8 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 5.3 GB. * RCFGBuilder took 1963.03 ms. Allocated memory was 147.8 MB in the beginning and 170.9 MB in the end (delta: 23.1 MB). Free memory was 78.8 MB in the beginning and 107.7 MB in the end (delta: -28.9 MB). Peak memory consumption was 24.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 61158.45 ms. Allocated memory was 170.9 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 107.7 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 257.8 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 constructing difference of abstraction (9443states) and interpolant automaton (currently 9 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (4970 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 608 locations, 1 error locations. TIMEOUT Result, 61.1s OverallTime, 69 OverallIterations, 5 TraceHistogramMax, 34.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 65462 SDtfs, 37359 SDslu, 160266 SDs, 0 SdLazy, 38230 SolverSat, 1484 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1255 GetRequests, 732 SyntacticMatches, 138 SemanticMatches, 385 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1125 ImplicationChecksByTransitivity, 9.0s 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, 53949 StatesRemovedByMinimization, 64 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 19.6s InterpolantComputationTime, 21474 NumberOfCodeBlocks, 21474 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 21404 ConstructedInterpolants, 98 QuantifiedInterpolants, 40924946 SizeOfPredicates, 17 NumberOfNonLiveVariables, 850 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 70 InterpolantComputations, 68 PerfectInterpolantSequences, 11063/11819 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.07_false-unreach-call.i.cil.c_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_02-00-39-939.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr.blast.07_false-unreach-call.i.cil.c_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_02-00-39-939.csv Completed graceful shutdown