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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_4_true-unreach-call_false-termination.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 05:32:14,074 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 05:32:14,075 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 05:32:14,084 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 05:32:14,085 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 05:32:14,085 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 05:32:14,086 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 05:32:14,087 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 05:32:14,088 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 05:32:14,089 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 05:32:14,089 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 05:32:14,089 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 05:32:14,090 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 05:32:14,091 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 05:32:14,091 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 05:32:14,093 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 05:32:14,094 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 05:32:14,095 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 05:32:14,095 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 05:32:14,096 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 05:32:14,097 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 05:32:14,098 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 05:32:14,098 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 05:32:14,098 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 05:32:14,099 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 05:32:14,099 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 05:32:14,099 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 05:32:14,100 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 05:32:14,100 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 05:32:14,100 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 05:32:14,101 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 05:32:14,101 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 05:32:14,106 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 05:32:14,106 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 05:32:14,106 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 05:32:14,106 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 05:32:14,107 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 05:32:14,107 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 05:32:14,107 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 05:32:14,107 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 05:32:14,107 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 05:32:14,107 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 05:32:14,108 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 05:32:14,108 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 05:32:14,108 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 05:32:14,108 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 05:32:14,108 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 05:32:14,108 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 05:32:14,108 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 05:32:14,108 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 05:32:14,109 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 05:32:14,109 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 05:32:14,109 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 05:32:14,109 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 05:32:14,109 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 05:32:14,109 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 05:32:14,109 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 05:32:14,110 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 05:32:14,110 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 05:32:14,110 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 05:32:14,110 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 05:32:14,110 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 05:32:14,110 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 05:32:14,110 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 05:32:14,111 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 05:32:14,111 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 05:32:14,129 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 05:32:14,135 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 05:32:14,137 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 05:32:14,138 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 05:32:14,138 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 05:32:14,139 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_4_true-unreach-call_false-termination.cil.c [2018-01-30 05:32:14,217 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 05:32:14,218 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 05:32:14,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 05:32:14,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 05:32:14,222 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 05:32:14,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 05:32:14" (1/1) ... [2018-01-30 05:32:14,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@415709b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:32:14, skipping insertion in model container [2018-01-30 05:32:14,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 05:32:14" (1/1) ... [2018-01-30 05:32:14,233 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 05:32:14,255 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 05:32:14,346 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 05:32:14,368 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 05:32:14,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:32:14 WrapperNode [2018-01-30 05:32:14,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 05:32:14,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 05:32:14,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 05:32:14,374 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 05:32:14,382 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:32:14" (1/1) ... [2018-01-30 05:32:14,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:32:14" (1/1) ... [2018-01-30 05:32:14,388 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:32:14" (1/1) ... [2018-01-30 05:32:14,389 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:32:14" (1/1) ... [2018-01-30 05:32:14,391 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:32:14" (1/1) ... [2018-01-30 05:32:14,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:32:14" (1/1) ... [2018-01-30 05:32:14,396 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:32:14" (1/1) ... [2018-01-30 05:32:14,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 05:32:14,398 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 05:32:14,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 05:32:14,399 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 05:32:14,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:32:14" (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 05:32:14,463 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 05:32:14,463 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 05:32:14,463 INFO L136 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-01-30 05:32:14,463 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 05:32:14,464 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 05:32:14,464 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 05:32:14,464 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2018-01-30 05:32:14,464 INFO L128 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-01-30 05:32:14,464 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 05:32:14,465 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 05:32:14,465 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 05:32:14,628 WARN L490 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-01-30 05:32:14,628 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-30 05:32:15,563 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 05:32:15,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 05:32:15 BoogieIcfgContainer [2018-01-30 05:32:15,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 05:32:15,564 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 05:32:15,564 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 05:32:15,564 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 05:32:15,566 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 05:32:15" (1/1) ... [2018-01-30 05:32:15,568 WARN L213 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-01-30 05:32:15,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 05:32:15 BasicIcfg [2018-01-30 05:32:15,584 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 05:32:15,585 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 05:32:15,585 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 05:32:15,586 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 05:32:15,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 05:32:14" (1/4) ... [2018-01-30 05:32:15,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646d9b28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 05:32:15, skipping insertion in model container [2018-01-30 05:32:15,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:32:14" (2/4) ... [2018-01-30 05:32:15,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646d9b28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 05:32:15, skipping insertion in model container [2018-01-30 05:32:15,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 05:32:15" (3/4) ... [2018-01-30 05:32:15,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646d9b28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 05:32:15, skipping insertion in model container [2018-01-30 05:32:15,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 05:32:15" (4/4) ... [2018-01-30 05:32:15,593 INFO L107 eAbstractionObserver]: Analyzing ICFG s3_srvr_4_true-unreach-call_false-termination.cil.cleft_unchanged_by_heapseparator [2018-01-30 05:32:15,598 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 05:32:15,603 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 05:32:15,629 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 05:32:15,629 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 05:32:15,629 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 05:32:15,629 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 05:32:15,629 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 05:32:15,629 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 05:32:15,629 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 05:32:15,629 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 05:32:15,630 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 05:32:15,642 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2018-01-30 05:32:15,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-01-30 05:32:15,652 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:15,652 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:32:15,652 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:15,655 INFO L82 PathProgramCache]: Analyzing trace with hash 412596661, now seen corresponding path program 1 times [2018-01-30 05:32:15,656 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:15,656 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:15,684 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:15,684 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:15,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:15,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:15,873 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 05:32:15,874 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:32:15,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:32:15,876 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:32:15,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:32:15,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:32:15,950 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 3 states. [2018-01-30 05:32:16,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:16,102 INFO L93 Difference]: Finished difference Result 929 states and 1217 transitions. [2018-01-30 05:32:16,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:32:16,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2018-01-30 05:32:16,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:16,113 INFO L225 Difference]: With dead ends: 929 [2018-01-30 05:32:16,113 INFO L226 Difference]: Without dead ends: 600 [2018-01-30 05:32:16,116 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 05:32:16,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-01-30 05:32:16,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2018-01-30 05:32:16,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-01-30 05:32:16,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 729 transitions. [2018-01-30 05:32:16,155 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 729 transitions. Word has length 180 [2018-01-30 05:32:16,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:16,155 INFO L432 AbstractCegarLoop]: Abstraction has 600 states and 729 transitions. [2018-01-30 05:32:16,155 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:32:16,156 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 729 transitions. [2018-01-30 05:32:16,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-01-30 05:32:16,158 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:16,159 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:32:16,159 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:16,159 INFO L82 PathProgramCache]: Analyzing trace with hash 502017021, now seen corresponding path program 1 times [2018-01-30 05:32:16,159 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:16,159 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:16,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:16,160 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:16,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:16,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:16,257 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 05:32:16,257 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:32:16,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:32:16,258 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:32:16,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:32:16,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:32:16,259 INFO L87 Difference]: Start difference. First operand 600 states and 729 transitions. Second operand 3 states. [2018-01-30 05:32:16,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:16,484 INFO L93 Difference]: Finished difference Result 1129 states and 1420 transitions. [2018-01-30 05:32:16,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:32:16,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2018-01-30 05:32:16,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:16,486 INFO L225 Difference]: With dead ends: 1129 [2018-01-30 05:32:16,486 INFO L226 Difference]: Without dead ends: 671 [2018-01-30 05:32:16,488 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 05:32:16,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2018-01-30 05:32:16,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 650. [2018-01-30 05:32:16,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2018-01-30 05:32:16,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 789 transitions. [2018-01-30 05:32:16,503 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 789 transitions. Word has length 204 [2018-01-30 05:32:16,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:16,504 INFO L432 AbstractCegarLoop]: Abstraction has 650 states and 789 transitions. [2018-01-30 05:32:16,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:32:16,504 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 789 transitions. [2018-01-30 05:32:16,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-01-30 05:32:16,506 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:16,506 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:32:16,506 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:16,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1398967355, now seen corresponding path program 1 times [2018-01-30 05:32:16,506 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:16,506 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:16,507 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:16,507 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:16,507 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:16,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:16,614 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 05:32:16,615 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:32:16,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:32:16,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:32:16,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:32:16,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:32:16,616 INFO L87 Difference]: Start difference. First operand 650 states and 789 transitions. Second operand 3 states. [2018-01-30 05:32:16,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:16,731 INFO L93 Difference]: Finished difference Result 1158 states and 1436 transitions. [2018-01-30 05:32:16,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:32:16,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-01-30 05:32:16,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:16,734 INFO L225 Difference]: With dead ends: 1158 [2018-01-30 05:32:16,734 INFO L226 Difference]: Without dead ends: 901 [2018-01-30 05:32:16,735 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 05:32:16,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2018-01-30 05:32:16,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 901. [2018-01-30 05:32:16,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-01-30 05:32:16,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1107 transitions. [2018-01-30 05:32:16,749 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1107 transitions. Word has length 211 [2018-01-30 05:32:16,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:16,749 INFO L432 AbstractCegarLoop]: Abstraction has 901 states and 1107 transitions. [2018-01-30 05:32:16,749 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:32:16,749 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1107 transitions. [2018-01-30 05:32:16,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-01-30 05:32:16,751 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:16,752 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:32:16,752 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:16,752 INFO L82 PathProgramCache]: Analyzing trace with hash 2135768764, now seen corresponding path program 1 times [2018-01-30 05:32:16,752 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:16,752 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:16,753 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:16,753 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:16,753 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:16,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:16,858 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-30 05:32:16,858 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:32:16,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:32:16,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:32:16,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:32:16,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:32:16,859 INFO L87 Difference]: Start difference. First operand 901 states and 1107 transitions. Second operand 3 states. [2018-01-30 05:32:17,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:17,454 INFO L93 Difference]: Finished difference Result 1833 states and 2351 transitions. [2018-01-30 05:32:17,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:32:17,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-01-30 05:32:17,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:17,457 INFO L225 Difference]: With dead ends: 1833 [2018-01-30 05:32:17,457 INFO L226 Difference]: Without dead ends: 1074 [2018-01-30 05:32:17,458 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 05:32:17,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2018-01-30 05:32:17,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1039. [2018-01-30 05:32:17,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1039 states. [2018-01-30 05:32:17,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1260 transitions. [2018-01-30 05:32:17,471 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1260 transitions. Word has length 230 [2018-01-30 05:32:17,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:17,472 INFO L432 AbstractCegarLoop]: Abstraction has 1039 states and 1260 transitions. [2018-01-30 05:32:17,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:32:17,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1260 transitions. [2018-01-30 05:32:17,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-01-30 05:32:17,474 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:17,474 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:32:17,475 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:17,475 INFO L82 PathProgramCache]: Analyzing trace with hash -748319012, now seen corresponding path program 1 times [2018-01-30 05:32:17,475 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:17,475 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:17,476 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:17,476 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:17,476 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:17,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:17,585 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-30 05:32:17,585 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:32:17,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:32:17,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:32:17,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:32:17,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:32:17,586 INFO L87 Difference]: Start difference. First operand 1039 states and 1260 transitions. Second operand 3 states. [2018-01-30 05:32:18,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:18,150 INFO L93 Difference]: Finished difference Result 2047 states and 2545 transitions. [2018-01-30 05:32:18,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:32:18,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-01-30 05:32:18,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:18,157 INFO L225 Difference]: With dead ends: 2047 [2018-01-30 05:32:18,157 INFO L226 Difference]: Without dead ends: 1150 [2018-01-30 05:32:18,158 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 05:32:18,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2018-01-30 05:32:18,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1120. [2018-01-30 05:32:18,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1120 states. [2018-01-30 05:32:18,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1356 transitions. [2018-01-30 05:32:18,172 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1356 transitions. Word has length 230 [2018-01-30 05:32:18,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:18,172 INFO L432 AbstractCegarLoop]: Abstraction has 1120 states and 1356 transitions. [2018-01-30 05:32:18,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:32:18,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1356 transitions. [2018-01-30 05:32:18,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-01-30 05:32:18,175 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:18,175 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:32:18,175 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:18,175 INFO L82 PathProgramCache]: Analyzing trace with hash 688501916, now seen corresponding path program 1 times [2018-01-30 05:32:18,175 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:18,175 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:18,176 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:18,176 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:18,176 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:18,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:18,261 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 05:32:18,261 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:32:18,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:32:18,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:32:18,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:32:18,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:32:18,262 INFO L87 Difference]: Start difference. First operand 1120 states and 1356 transitions. Second operand 3 states. [2018-01-30 05:32:18,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:18,319 INFO L93 Difference]: Finished difference Result 2971 states and 3623 transitions. [2018-01-30 05:32:18,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:32:18,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2018-01-30 05:32:18,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:18,323 INFO L225 Difference]: With dead ends: 2971 [2018-01-30 05:32:18,323 INFO L226 Difference]: Without dead ends: 1993 [2018-01-30 05:32:18,325 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 05:32:18,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2018-01-30 05:32:18,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1991. [2018-01-30 05:32:18,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1991 states. [2018-01-30 05:32:18,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1991 states and 2400 transitions. [2018-01-30 05:32:18,346 INFO L78 Accepts]: Start accepts. Automaton has 1991 states and 2400 transitions. Word has length 237 [2018-01-30 05:32:18,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:18,346 INFO L432 AbstractCegarLoop]: Abstraction has 1991 states and 2400 transitions. [2018-01-30 05:32:18,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:32:18,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 2400 transitions. [2018-01-30 05:32:18,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-01-30 05:32:18,349 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:18,349 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:32:18,349 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:18,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1712450811, now seen corresponding path program 1 times [2018-01-30 05:32:18,349 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:18,349 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:18,350 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:18,350 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:18,350 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:18,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:18,423 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-30 05:32:18,423 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:32:18,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:32:18,423 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:32:18,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:32:18,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:32:18,424 INFO L87 Difference]: Start difference. First operand 1991 states and 2400 transitions. Second operand 3 states. [2018-01-30 05:32:18,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:18,508 INFO L93 Difference]: Finished difference Result 3879 states and 4699 transitions. [2018-01-30 05:32:18,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:32:18,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 238 [2018-01-30 05:32:18,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:18,519 INFO L225 Difference]: With dead ends: 3879 [2018-01-30 05:32:18,519 INFO L226 Difference]: Without dead ends: 2030 [2018-01-30 05:32:18,521 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 05:32:18,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2030 states. [2018-01-30 05:32:18,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2030 to 2009. [2018-01-30 05:32:18,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2009 states. [2018-01-30 05:32:18,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2009 states to 2009 states and 2412 transitions. [2018-01-30 05:32:18,543 INFO L78 Accepts]: Start accepts. Automaton has 2009 states and 2412 transitions. Word has length 238 [2018-01-30 05:32:18,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:18,543 INFO L432 AbstractCegarLoop]: Abstraction has 2009 states and 2412 transitions. [2018-01-30 05:32:18,543 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:32:18,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 2412 transitions. [2018-01-30 05:32:18,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-01-30 05:32:18,547 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:18,547 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:32:18,547 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:18,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1689008111, now seen corresponding path program 1 times [2018-01-30 05:32:18,547 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:18,547 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:18,548 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:18,548 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:18,548 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:18,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:18,631 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 05:32:18,631 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:32:18,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:32:18,631 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:32:18,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:32:18,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:32:18,632 INFO L87 Difference]: Start difference. First operand 2009 states and 2412 transitions. Second operand 3 states. [2018-01-30 05:32:18,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:18,666 INFO L93 Difference]: Finished difference Result 5728 states and 6919 transitions. [2018-01-30 05:32:18,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:32:18,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2018-01-30 05:32:18,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:18,681 INFO L225 Difference]: With dead ends: 5728 [2018-01-30 05:32:18,681 INFO L226 Difference]: Without dead ends: 3861 [2018-01-30 05:32:18,684 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 05:32:18,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3861 states. [2018-01-30 05:32:18,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3861 to 3859. [2018-01-30 05:32:18,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3859 states. [2018-01-30 05:32:18,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3859 states to 3859 states and 4634 transitions. [2018-01-30 05:32:18,727 INFO L78 Accepts]: Start accepts. Automaton has 3859 states and 4634 transitions. Word has length 240 [2018-01-30 05:32:18,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:18,727 INFO L432 AbstractCegarLoop]: Abstraction has 3859 states and 4634 transitions. [2018-01-30 05:32:18,727 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:32:18,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3859 states and 4634 transitions. [2018-01-30 05:32:18,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-01-30 05:32:18,731 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:18,732 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:32:18,732 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:18,732 INFO L82 PathProgramCache]: Analyzing trace with hash 739861187, now seen corresponding path program 1 times [2018-01-30 05:32:18,732 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:18,732 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:18,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:18,732 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:18,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:18,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:18,813 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-30 05:32:18,814 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:32:18,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:32:18,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:32:18,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:32:18,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:32:18,814 INFO L87 Difference]: Start difference. First operand 3859 states and 4634 transitions. Second operand 3 states. [2018-01-30 05:32:19,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:19,073 INFO L93 Difference]: Finished difference Result 7570 states and 9130 transitions. [2018-01-30 05:32:19,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:32:19,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2018-01-30 05:32:19,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:19,082 INFO L225 Difference]: With dead ends: 7570 [2018-01-30 05:32:19,083 INFO L226 Difference]: Without dead ends: 5090 [2018-01-30 05:32:19,085 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 05:32:19,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5090 states. [2018-01-30 05:32:19,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5090 to 5090. [2018-01-30 05:32:19,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5090 states. [2018-01-30 05:32:19,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5090 states to 5090 states and 6123 transitions. [2018-01-30 05:32:19,137 INFO L78 Accepts]: Start accepts. Automaton has 5090 states and 6123 transitions. Word has length 241 [2018-01-30 05:32:19,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:19,138 INFO L432 AbstractCegarLoop]: Abstraction has 5090 states and 6123 transitions. [2018-01-30 05:32:19,138 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:32:19,138 INFO L276 IsEmpty]: Start isEmpty. Operand 5090 states and 6123 transitions. [2018-01-30 05:32:19,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-01-30 05:32:19,143 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:19,143 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:32:19,143 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:19,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1010426538, now seen corresponding path program 1 times [2018-01-30 05:32:19,144 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:19,144 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:19,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:19,144 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:19,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:19,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:19,231 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-01-30 05:32:19,231 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:32:19,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:32:19,231 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:32:19,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:32:19,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:32:19,232 INFO L87 Difference]: Start difference. First operand 5090 states and 6123 transitions. Second operand 3 states. [2018-01-30 05:32:19,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:19,477 INFO L93 Difference]: Finished difference Result 6323 states and 7621 transitions. [2018-01-30 05:32:19,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:32:19,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2018-01-30 05:32:19,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:19,489 INFO L225 Difference]: With dead ends: 6323 [2018-01-30 05:32:19,489 INFO L226 Difference]: Without dead ends: 6321 [2018-01-30 05:32:19,490 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 05:32:19,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6321 states. [2018-01-30 05:32:19,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6321 to 6321. [2018-01-30 05:32:19,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6321 states. [2018-01-30 05:32:19,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6321 states to 6321 states and 7616 transitions. [2018-01-30 05:32:19,573 INFO L78 Accepts]: Start accepts. Automaton has 6321 states and 7616 transitions. Word has length 277 [2018-01-30 05:32:19,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:19,574 INFO L432 AbstractCegarLoop]: Abstraction has 6321 states and 7616 transitions. [2018-01-30 05:32:19,574 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:32:19,574 INFO L276 IsEmpty]: Start isEmpty. Operand 6321 states and 7616 transitions. [2018-01-30 05:32:19,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-01-30 05:32:19,580 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:19,581 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:32:19,581 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:19,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1817325830, now seen corresponding path program 1 times [2018-01-30 05:32:19,581 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:19,582 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:19,582 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:19,582 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:19,582 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:19,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:19,676 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-01-30 05:32:19,676 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:32:19,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:32:19,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:32:19,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:32:19,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:32:19,677 INFO L87 Difference]: Start difference. First operand 6321 states and 7616 transitions. Second operand 3 states. [2018-01-30 05:32:20,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:20,631 INFO L93 Difference]: Finished difference Result 13699 states and 17023 transitions. [2018-01-30 05:32:20,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:32:20,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 325 [2018-01-30 05:32:20,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:20,643 INFO L225 Difference]: With dead ends: 13699 [2018-01-30 05:32:20,643 INFO L226 Difference]: Without dead ends: 7526 [2018-01-30 05:32:20,648 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 05:32:20,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7526 states. [2018-01-30 05:32:20,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7526 to 7136. [2018-01-30 05:32:20,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7136 states. [2018-01-30 05:32:20,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7136 states to 7136 states and 8521 transitions. [2018-01-30 05:32:20,712 INFO L78 Accepts]: Start accepts. Automaton has 7136 states and 8521 transitions. Word has length 325 [2018-01-30 05:32:20,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:20,713 INFO L432 AbstractCegarLoop]: Abstraction has 7136 states and 8521 transitions. [2018-01-30 05:32:20,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:32:20,713 INFO L276 IsEmpty]: Start isEmpty. Operand 7136 states and 8521 transitions. [2018-01-30 05:32:20,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-01-30 05:32:20,720 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:20,720 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:32:20,720 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:20,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1305251204, now seen corresponding path program 1 times [2018-01-30 05:32:20,720 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:20,720 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:20,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:20,721 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:20,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:20,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:20,822 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-01-30 05:32:20,823 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:32:20,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:32:20,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:32:20,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:32:20,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:32:20,823 INFO L87 Difference]: Start difference. First operand 7136 states and 8521 transitions. Second operand 3 states. [2018-01-30 05:32:20,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:20,926 INFO L93 Difference]: Finished difference Result 10870 states and 12983 transitions. [2018-01-30 05:32:20,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:32:20,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 340 [2018-01-30 05:32:20,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:20,935 INFO L225 Difference]: With dead ends: 10870 [2018-01-30 05:32:20,935 INFO L226 Difference]: Without dead ends: 7600 [2018-01-30 05:32:20,938 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 05:32:20,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7600 states. [2018-01-30 05:32:20,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7600 to 7598. [2018-01-30 05:32:20,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7598 states. [2018-01-30 05:32:21,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7598 states to 7598 states and 9048 transitions. [2018-01-30 05:32:21,001 INFO L78 Accepts]: Start accepts. Automaton has 7598 states and 9048 transitions. Word has length 340 [2018-01-30 05:32:21,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:21,002 INFO L432 AbstractCegarLoop]: Abstraction has 7598 states and 9048 transitions. [2018-01-30 05:32:21,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:32:21,002 INFO L276 IsEmpty]: Start isEmpty. Operand 7598 states and 9048 transitions. [2018-01-30 05:32:21,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2018-01-30 05:32:21,010 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:21,010 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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 05:32:21,010 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:21,010 INFO L82 PathProgramCache]: Analyzing trace with hash -386163861, now seen corresponding path program 1 times [2018-01-30 05:32:21,010 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:21,010 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:21,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:21,011 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:21,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:21,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:21,118 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-01-30 05:32:21,118 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:32:21,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:32:21,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:32:21,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:32:21,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:32:21,119 INFO L87 Difference]: Start difference. First operand 7598 states and 9048 transitions. Second operand 3 states. [2018-01-30 05:32:21,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:21,234 INFO L93 Difference]: Finished difference Result 12853 states and 15294 transitions. [2018-01-30 05:32:21,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:32:21,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 343 [2018-01-30 05:32:21,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:21,254 INFO L225 Difference]: With dead ends: 12853 [2018-01-30 05:32:21,254 INFO L226 Difference]: Without dead ends: 9378 [2018-01-30 05:32:21,260 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 05:32:21,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9378 states. [2018-01-30 05:32:21,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9378 to 9376. [2018-01-30 05:32:21,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9376 states. [2018-01-30 05:32:21,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9376 states to 9376 states and 11154 transitions. [2018-01-30 05:32:21,365 INFO L78 Accepts]: Start accepts. Automaton has 9376 states and 11154 transitions. Word has length 343 [2018-01-30 05:32:21,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:21,366 INFO L432 AbstractCegarLoop]: Abstraction has 9376 states and 11154 transitions. [2018-01-30 05:32:21,366 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:32:21,366 INFO L276 IsEmpty]: Start isEmpty. Operand 9376 states and 11154 transitions. [2018-01-30 05:32:21,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-01-30 05:32:21,375 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:21,375 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:32:21,375 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:21,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1834397685, now seen corresponding path program 1 times [2018-01-30 05:32:21,376 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:21,376 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:21,376 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:21,376 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:21,376 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:21,385 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:21,577 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2018-01-30 05:32:21,578 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:32:21,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 05:32:21,578 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 05:32:21,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 05:32:21,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:32:21,578 INFO L87 Difference]: Start difference. First operand 9376 states and 11154 transitions. Second operand 5 states. [2018-01-30 05:32:22,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:22,059 INFO L93 Difference]: Finished difference Result 12711 states and 14981 transitions. [2018-01-30 05:32:22,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 05:32:22,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 344 [2018-01-30 05:32:22,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:22,067 INFO L225 Difference]: With dead ends: 12711 [2018-01-30 05:32:22,067 INFO L226 Difference]: Without dead ends: 10830 [2018-01-30 05:32:22,069 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-30 05:32:22,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10830 states. [2018-01-30 05:32:22,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10830 to 9513. [2018-01-30 05:32:22,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9513 states. [2018-01-30 05:32:22,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9513 states to 9513 states and 11309 transitions. [2018-01-30 05:32:22,153 INFO L78 Accepts]: Start accepts. Automaton has 9513 states and 11309 transitions. Word has length 344 [2018-01-30 05:32:22,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:22,154 INFO L432 AbstractCegarLoop]: Abstraction has 9513 states and 11309 transitions. [2018-01-30 05:32:22,154 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 05:32:22,154 INFO L276 IsEmpty]: Start isEmpty. Operand 9513 states and 11309 transitions. [2018-01-30 05:32:22,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-01-30 05:32:22,162 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:22,162 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:32:22,162 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:22,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1038529954, now seen corresponding path program 1 times [2018-01-30 05:32:22,162 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:22,162 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:22,163 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:22,163 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:22,163 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:22,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:22,260 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-01-30 05:32:22,260 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:32:22,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:32:22,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:32:22,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:32:22,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:32:22,261 INFO L87 Difference]: Start difference. First operand 9513 states and 11309 transitions. Second operand 3 states. [2018-01-30 05:32:22,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:22,454 INFO L93 Difference]: Finished difference Result 19764 states and 24053 transitions. [2018-01-30 05:32:22,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:32:22,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 345 [2018-01-30 05:32:22,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:22,465 INFO L225 Difference]: With dead ends: 19764 [2018-01-30 05:32:22,465 INFO L226 Difference]: Without dead ends: 11104 [2018-01-30 05:32:22,474 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 05:32:22,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11104 states. [2018-01-30 05:32:22,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11104 to 10886. [2018-01-30 05:32:22,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10886 states. [2018-01-30 05:32:22,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10886 states to 10886 states and 13375 transitions. [2018-01-30 05:32:22,641 INFO L78 Accepts]: Start accepts. Automaton has 10886 states and 13375 transitions. Word has length 345 [2018-01-30 05:32:22,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:22,641 INFO L432 AbstractCegarLoop]: Abstraction has 10886 states and 13375 transitions. [2018-01-30 05:32:22,641 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:32:22,641 INFO L276 IsEmpty]: Start isEmpty. Operand 10886 states and 13375 transitions. [2018-01-30 05:32:22,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-01-30 05:32:22,650 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:22,650 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2018-01-30 05:32:22,650 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:22,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1692857092, now seen corresponding path program 1 times [2018-01-30 05:32:22,651 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:22,651 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:22,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:22,651 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:22,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:22,660 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:23,014 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2018-01-30 05:32:23,015 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:32:23,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 05:32:23,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 05:32:23,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 05:32:23,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 05:32:23,015 INFO L87 Difference]: Start difference. First operand 10886 states and 13375 transitions. Second operand 6 states. [2018-01-30 05:32:23,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:23,514 INFO L93 Difference]: Finished difference Result 22112 states and 27651 transitions. [2018-01-30 05:32:23,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 05:32:23,515 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 345 [2018-01-30 05:32:23,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:23,523 INFO L225 Difference]: With dead ends: 22112 [2018-01-30 05:32:23,523 INFO L226 Difference]: Without dead ends: 11209 [2018-01-30 05:32:23,534 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-30 05:32:23,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11209 states. [2018-01-30 05:32:23,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11209 to 10995. [2018-01-30 05:32:23,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10995 states. [2018-01-30 05:32:23,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10995 states to 10995 states and 13397 transitions. [2018-01-30 05:32:23,708 INFO L78 Accepts]: Start accepts. Automaton has 10995 states and 13397 transitions. Word has length 345 [2018-01-30 05:32:23,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:23,708 INFO L432 AbstractCegarLoop]: Abstraction has 10995 states and 13397 transitions. [2018-01-30 05:32:23,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 05:32:23,708 INFO L276 IsEmpty]: Start isEmpty. Operand 10995 states and 13397 transitions. [2018-01-30 05:32:23,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-01-30 05:32:23,714 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:23,714 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2018-01-30 05:32:23,714 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:23,714 INFO L82 PathProgramCache]: Analyzing trace with hash -601745862, now seen corresponding path program 2 times [2018-01-30 05:32:23,715 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:23,715 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:23,715 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:23,715 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:23,715 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:23,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:23,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:23,908 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-01-30 05:32:23,909 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:32:23,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 05:32:23,909 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 05:32:23,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 05:32:23,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:32:23,909 INFO L87 Difference]: Start difference. First operand 10995 states and 13397 transitions. Second operand 5 states. [2018-01-30 05:32:24,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:24,115 INFO L93 Difference]: Finished difference Result 14477 states and 17503 transitions. [2018-01-30 05:32:24,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 05:32:24,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 347 [2018-01-30 05:32:24,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:24,123 INFO L225 Difference]: With dead ends: 14477 [2018-01-30 05:32:24,124 INFO L226 Difference]: Without dead ends: 12025 [2018-01-30 05:32:24,128 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-30 05:32:24,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12025 states. [2018-01-30 05:32:24,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12025 to 11036. [2018-01-30 05:32:24,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11036 states. [2018-01-30 05:32:24,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11036 states to 11036 states and 13447 transitions. [2018-01-30 05:32:24,229 INFO L78 Accepts]: Start accepts. Automaton has 11036 states and 13447 transitions. Word has length 347 [2018-01-30 05:32:24,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:24,229 INFO L432 AbstractCegarLoop]: Abstraction has 11036 states and 13447 transitions. [2018-01-30 05:32:24,229 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 05:32:24,229 INFO L276 IsEmpty]: Start isEmpty. Operand 11036 states and 13447 transitions. [2018-01-30 05:32:24,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-01-30 05:32:24,234 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:24,234 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2018-01-30 05:32:24,235 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:24,235 INFO L82 PathProgramCache]: Analyzing trace with hash 191220907, now seen corresponding path program 1 times [2018-01-30 05:32:24,235 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:24,235 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:24,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:24,235 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:32:24,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:24,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:24,502 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-01-30 05:32:24,503 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:32:24,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 05:32:24,503 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 05:32:24,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 05:32:24,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 05:32:24,503 INFO L87 Difference]: Start difference. First operand 11036 states and 13447 transitions. Second operand 4 states. [2018-01-30 05:32:25,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:25,145 INFO L93 Difference]: Finished difference Result 26027 states and 32465 transitions. [2018-01-30 05:32:25,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 05:32:25,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 348 [2018-01-30 05:32:25,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:25,155 INFO L225 Difference]: With dead ends: 26027 [2018-01-30 05:32:25,155 INFO L226 Difference]: Without dead ends: 14908 [2018-01-30 05:32:25,167 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:32:25,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14908 states. [2018-01-30 05:32:25,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14908 to 11596. [2018-01-30 05:32:25,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11596 states. [2018-01-30 05:32:25,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11596 states to 11596 states and 14252 transitions. [2018-01-30 05:32:25,290 INFO L78 Accepts]: Start accepts. Automaton has 11596 states and 14252 transitions. Word has length 348 [2018-01-30 05:32:25,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:25,290 INFO L432 AbstractCegarLoop]: Abstraction has 11596 states and 14252 transitions. [2018-01-30 05:32:25,290 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 05:32:25,290 INFO L276 IsEmpty]: Start isEmpty. Operand 11596 states and 14252 transitions. [2018-01-30 05:32:25,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-01-30 05:32:25,296 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:25,296 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:32:25,296 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:25,296 INFO L82 PathProgramCache]: Analyzing trace with hash 638218405, now seen corresponding path program 3 times [2018-01-30 05:32:25,296 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:25,296 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:25,297 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:25,297 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:25,297 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:25,304 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:25,515 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-01-30 05:32:25,515 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:32:25,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 05:32:25,516 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 05:32:25,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 05:32:25,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 05:32:25,516 INFO L87 Difference]: Start difference. First operand 11596 states and 14252 transitions. Second operand 4 states. [2018-01-30 05:32:25,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:25,843 INFO L93 Difference]: Finished difference Result 17222 states and 21249 transitions. [2018-01-30 05:32:25,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 05:32:25,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 350 [2018-01-30 05:32:25,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:25,852 INFO L225 Difference]: With dead ends: 17222 [2018-01-30 05:32:25,852 INFO L226 Difference]: Without dead ends: 14544 [2018-01-30 05:32:25,858 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:32:25,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14544 states. [2018-01-30 05:32:25,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14544 to 11791. [2018-01-30 05:32:25,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11791 states. [2018-01-30 05:32:25,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11791 states to 11791 states and 14462 transitions. [2018-01-30 05:32:25,981 INFO L78 Accepts]: Start accepts. Automaton has 11791 states and 14462 transitions. Word has length 350 [2018-01-30 05:32:25,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:25,981 INFO L432 AbstractCegarLoop]: Abstraction has 11791 states and 14462 transitions. [2018-01-30 05:32:25,981 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 05:32:25,981 INFO L276 IsEmpty]: Start isEmpty. Operand 11791 states and 14462 transitions. [2018-01-30 05:32:25,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2018-01-30 05:32:25,987 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:25,987 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:32:25,987 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:25,987 INFO L82 PathProgramCache]: Analyzing trace with hash 606065770, now seen corresponding path program 1 times [2018-01-30 05:32:25,988 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:25,988 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:25,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:25,988 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:32:25,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:25,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:26,105 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 364 proven. 27 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-01-30 05:32:26,105 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:32:26,105 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 05:32:26,110 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:26,169 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:32:26,522 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 364 proven. 27 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-01-30 05:32:26,541 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:32:26,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-01-30 05:32:26,542 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 05:32:26,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 05:32:26,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 05:32:26,542 INFO L87 Difference]: Start difference. First operand 11791 states and 14462 transitions. Second operand 4 states. [2018-01-30 05:32:28,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:28,701 INFO L93 Difference]: Finished difference Result 31815 states and 39189 transitions. [2018-01-30 05:32:28,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 05:32:28,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 401 [2018-01-30 05:32:28,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:28,730 INFO L225 Difference]: With dead ends: 31815 [2018-01-30 05:32:28,730 INFO L226 Difference]: Without dead ends: 20038 [2018-01-30 05:32:28,748 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:32:28,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20038 states. [2018-01-30 05:32:28,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20038 to 16520. [2018-01-30 05:32:28,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16520 states. [2018-01-30 05:32:29,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16520 states to 16520 states and 20099 transitions. [2018-01-30 05:32:29,010 INFO L78 Accepts]: Start accepts. Automaton has 16520 states and 20099 transitions. Word has length 401 [2018-01-30 05:32:29,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:29,011 INFO L432 AbstractCegarLoop]: Abstraction has 16520 states and 20099 transitions. [2018-01-30 05:32:29,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 05:32:29,011 INFO L276 IsEmpty]: Start isEmpty. Operand 16520 states and 20099 transitions. [2018-01-30 05:32:29,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2018-01-30 05:32:29,023 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:29,023 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 05:32:29,023 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:29,024 INFO L82 PathProgramCache]: Analyzing trace with hash 2067358993, now seen corresponding path program 1 times [2018-01-30 05:32:29,024 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:29,024 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:29,024 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:29,024 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:29,024 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:29,033 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:29,128 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-01-30 05:32:29,128 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:32:29,128 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:32:29,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:32:29,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:32:29,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:32:29,129 INFO L87 Difference]: Start difference. First operand 16520 states and 20099 transitions. Second operand 3 states. [2018-01-30 05:32:29,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:29,752 INFO L93 Difference]: Finished difference Result 30728 states and 37358 transitions. [2018-01-30 05:32:29,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:32:29,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 406 [2018-01-30 05:32:29,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:29,778 INFO L225 Difference]: With dead ends: 30728 [2018-01-30 05:32:29,778 INFO L226 Difference]: Without dead ends: 17025 [2018-01-30 05:32:29,789 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:32:29,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17025 states. [2018-01-30 05:32:29,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17025 to 16780. [2018-01-30 05:32:29,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16780 states. [2018-01-30 05:32:29,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16780 states to 16780 states and 20382 transitions. [2018-01-30 05:32:29,976 INFO L78 Accepts]: Start accepts. Automaton has 16780 states and 20382 transitions. Word has length 406 [2018-01-30 05:32:29,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:29,976 INFO L432 AbstractCegarLoop]: Abstraction has 16780 states and 20382 transitions. [2018-01-30 05:32:29,976 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:32:29,976 INFO L276 IsEmpty]: Start isEmpty. Operand 16780 states and 20382 transitions. [2018-01-30 05:32:29,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-01-30 05:32:29,985 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:29,986 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:32:29,986 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:29,986 INFO L82 PathProgramCache]: Analyzing trace with hash 610733658, now seen corresponding path program 1 times [2018-01-30 05:32:29,986 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:29,986 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:29,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:29,986 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:29,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:29,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:30,095 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-01-30 05:32:30,095 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:32:30,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:32:30,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:32:30,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:32:30,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:32:30,096 INFO L87 Difference]: Start difference. First operand 16780 states and 20382 transitions. Second operand 3 states. [2018-01-30 05:32:30,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:30,958 INFO L93 Difference]: Finished difference Result 31034 states and 37671 transitions. [2018-01-30 05:32:30,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:32:30,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 408 [2018-01-30 05:32:30,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:30,975 INFO L225 Difference]: With dead ends: 31034 [2018-01-30 05:32:30,975 INFO L226 Difference]: Without dead ends: 17071 [2018-01-30 05:32:30,986 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 05:32:30,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17071 states. [2018-01-30 05:32:31,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17071 to 17071. [2018-01-30 05:32:31,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17071 states. [2018-01-30 05:32:31,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17071 states to 17071 states and 20695 transitions. [2018-01-30 05:32:31,249 INFO L78 Accepts]: Start accepts. Automaton has 17071 states and 20695 transitions. Word has length 408 [2018-01-30 05:32:31,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:31,249 INFO L432 AbstractCegarLoop]: Abstraction has 17071 states and 20695 transitions. [2018-01-30 05:32:31,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:32:31,250 INFO L276 IsEmpty]: Start isEmpty. Operand 17071 states and 20695 transitions. [2018-01-30 05:32:31,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-01-30 05:32:31,260 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:31,260 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:32:31,260 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:31,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1443972730, now seen corresponding path program 1 times [2018-01-30 05:32:31,260 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:31,260 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:31,261 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:31,261 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:31,261 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:31,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:31,368 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-01-30 05:32:31,368 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:32:31,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:32:31,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:32:31,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:32:31,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:32:31,369 INFO L87 Difference]: Start difference. First operand 17071 states and 20695 transitions. Second operand 3 states. [2018-01-30 05:32:31,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:31,943 INFO L93 Difference]: Finished difference Result 32215 states and 39014 transitions. [2018-01-30 05:32:31,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:32:31,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 408 [2018-01-30 05:32:31,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:31,961 INFO L225 Difference]: With dead ends: 32215 [2018-01-30 05:32:31,961 INFO L226 Difference]: Without dead ends: 17967 [2018-01-30 05:32:31,971 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 05:32:31,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17967 states. [2018-01-30 05:32:32,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17967 to 17683. [2018-01-30 05:32:32,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17683 states. [2018-01-30 05:32:32,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17683 states to 17683 states and 21335 transitions. [2018-01-30 05:32:32,169 INFO L78 Accepts]: Start accepts. Automaton has 17683 states and 21335 transitions. Word has length 408 [2018-01-30 05:32:32,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:32,169 INFO L432 AbstractCegarLoop]: Abstraction has 17683 states and 21335 transitions. [2018-01-30 05:32:32,169 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:32:32,169 INFO L276 IsEmpty]: Start isEmpty. Operand 17683 states and 21335 transitions. [2018-01-30 05:32:32,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-01-30 05:32:32,179 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:32,179 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:32:32,179 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:32,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1054994792, now seen corresponding path program 2 times [2018-01-30 05:32:32,180 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:32,180 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:32,180 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:32,180 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:32,180 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:32,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:32,414 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-01-30 05:32:32,414 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:32:32,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 05:32:32,415 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 05:32:32,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 05:32:32,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 05:32:32,415 INFO L87 Difference]: Start difference. First operand 17683 states and 21335 transitions. Second operand 4 states. [2018-01-30 05:32:32,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:32,865 INFO L93 Difference]: Finished difference Result 27964 states and 34404 transitions. [2018-01-30 05:32:32,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 05:32:32,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 409 [2018-01-30 05:32:32,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:32,881 INFO L225 Difference]: With dead ends: 27964 [2018-01-30 05:32:32,881 INFO L226 Difference]: Without dead ends: 22280 [2018-01-30 05:32:32,890 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:32:32,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22280 states. [2018-01-30 05:32:33,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22280 to 16616. [2018-01-30 05:32:33,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16616 states. [2018-01-30 05:32:33,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16616 states to 16616 states and 20219 transitions. [2018-01-30 05:32:33,097 INFO L78 Accepts]: Start accepts. Automaton has 16616 states and 20219 transitions. Word has length 409 [2018-01-30 05:32:33,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:33,097 INFO L432 AbstractCegarLoop]: Abstraction has 16616 states and 20219 transitions. [2018-01-30 05:32:33,097 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 05:32:33,097 INFO L276 IsEmpty]: Start isEmpty. Operand 16616 states and 20219 transitions. [2018-01-30 05:32:33,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-01-30 05:32:33,105 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:33,106 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:32:33,106 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:33,106 INFO L82 PathProgramCache]: Analyzing trace with hash -307555379, now seen corresponding path program 1 times [2018-01-30 05:32:33,106 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:33,106 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:33,106 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:33,106 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:32:33,107 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:33,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:33,225 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-01-30 05:32:33,225 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:32:33,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:32:33,225 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:32:33,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:32:33,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:32:33,226 INFO L87 Difference]: Start difference. First operand 16616 states and 20219 transitions. Second operand 3 states. [2018-01-30 05:32:33,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:33,509 INFO L93 Difference]: Finished difference Result 33375 states and 40548 transitions. [2018-01-30 05:32:33,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:32:33,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 420 [2018-01-30 05:32:33,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:33,521 INFO L225 Difference]: With dead ends: 33375 [2018-01-30 05:32:33,522 INFO L226 Difference]: Without dead ends: 17066 [2018-01-30 05:32:33,534 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 05:32:33,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17066 states. [2018-01-30 05:32:33,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17066 to 16616. [2018-01-30 05:32:33,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16616 states. [2018-01-30 05:32:33,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16616 states to 16616 states and 20179 transitions. [2018-01-30 05:32:33,729 INFO L78 Accepts]: Start accepts. Automaton has 16616 states and 20179 transitions. Word has length 420 [2018-01-30 05:32:33,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:33,729 INFO L432 AbstractCegarLoop]: Abstraction has 16616 states and 20179 transitions. [2018-01-30 05:32:33,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:32:33,729 INFO L276 IsEmpty]: Start isEmpty. Operand 16616 states and 20179 transitions. [2018-01-30 05:32:33,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2018-01-30 05:32:33,738 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:33,738 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:32:33,738 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:33,738 INFO L82 PathProgramCache]: Analyzing trace with hash -503995793, now seen corresponding path program 1 times [2018-01-30 05:32:33,739 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:33,739 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:33,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:33,739 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:33,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:33,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:33,976 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 460 proven. 17 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-01-30 05:32:33,977 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:32:33,977 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:32:33,981 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:34,025 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:32:34,088 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 460 proven. 17 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-01-30 05:32:34,107 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:32:34,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-01-30 05:32:34,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 05:32:34,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 05:32:34,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 05:32:34,108 INFO L87 Difference]: Start difference. First operand 16616 states and 20179 transitions. Second operand 4 states. [2018-01-30 05:32:34,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:34,641 INFO L93 Difference]: Finished difference Result 45467 states and 55938 transitions. [2018-01-30 05:32:34,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 05:32:34,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 426 [2018-01-30 05:32:34,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:34,663 INFO L225 Difference]: With dead ends: 45467 [2018-01-30 05:32:34,663 INFO L226 Difference]: Without dead ends: 29158 [2018-01-30 05:32:34,679 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 428 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:32:34,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29158 states. [2018-01-30 05:32:34,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29158 to 25666. [2018-01-30 05:32:34,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25666 states. [2018-01-30 05:32:34,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25666 states to 25666 states and 30883 transitions. [2018-01-30 05:32:34,999 INFO L78 Accepts]: Start accepts. Automaton has 25666 states and 30883 transitions. Word has length 426 [2018-01-30 05:32:34,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:35,000 INFO L432 AbstractCegarLoop]: Abstraction has 25666 states and 30883 transitions. [2018-01-30 05:32:35,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 05:32:35,000 INFO L276 IsEmpty]: Start isEmpty. Operand 25666 states and 30883 transitions. [2018-01-30 05:32:35,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2018-01-30 05:32:35,081 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:35,082 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:32:35,082 INFO L371 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:35,082 INFO L82 PathProgramCache]: Analyzing trace with hash 329243279, now seen corresponding path program 1 times [2018-01-30 05:32:35,082 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:35,082 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:35,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:35,083 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:35,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:35,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:35,206 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2018-01-30 05:32:35,206 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:32:35,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:32:35,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:32:35,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:32:35,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:32:35,207 INFO L87 Difference]: Start difference. First operand 25666 states and 30883 transitions. Second operand 3 states. [2018-01-30 05:32:35,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:35,584 INFO L93 Difference]: Finished difference Result 64979 states and 78137 transitions. [2018-01-30 05:32:35,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:32:35,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 426 [2018-01-30 05:32:35,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:35,612 INFO L225 Difference]: With dead ends: 64979 [2018-01-30 05:32:35,612 INFO L226 Difference]: Without dead ends: 39620 [2018-01-30 05:32:35,631 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 05:32:35,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39620 states. [2018-01-30 05:32:36,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39620 to 37796. [2018-01-30 05:32:36,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37796 states. [2018-01-30 05:32:36,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37796 states to 37796 states and 45513 transitions. [2018-01-30 05:32:36,103 INFO L78 Accepts]: Start accepts. Automaton has 37796 states and 45513 transitions. Word has length 426 [2018-01-30 05:32:36,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:36,104 INFO L432 AbstractCegarLoop]: Abstraction has 37796 states and 45513 transitions. [2018-01-30 05:32:36,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:32:36,104 INFO L276 IsEmpty]: Start isEmpty. Operand 37796 states and 45513 transitions. [2018-01-30 05:32:36,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2018-01-30 05:32:36,123 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:36,123 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:32:36,123 INFO L371 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:36,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1719222111, now seen corresponding path program 1 times [2018-01-30 05:32:36,124 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:36,124 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:36,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:36,124 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:36,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:36,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:36,866 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-01-30 05:32:36,866 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:32:36,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 05:32:36,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 05:32:36,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 05:32:36,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:32:36,867 INFO L87 Difference]: Start difference. First operand 37796 states and 45513 transitions. Second operand 5 states. [2018-01-30 05:32:37,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:37,348 INFO L93 Difference]: Finished difference Result 48964 states and 58975 transitions. [2018-01-30 05:32:37,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 05:32:37,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 433 [2018-01-30 05:32:37,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:37,375 INFO L225 Difference]: With dead ends: 48964 [2018-01-30 05:32:37,375 INFO L226 Difference]: Without dead ends: 40011 [2018-01-30 05:32:37,388 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-30 05:32:37,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40011 states. [2018-01-30 05:32:37,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40011 to 38000. [2018-01-30 05:32:37,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38000 states. [2018-01-30 05:32:37,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38000 states to 38000 states and 45737 transitions. [2018-01-30 05:32:37,874 INFO L78 Accepts]: Start accepts. Automaton has 38000 states and 45737 transitions. Word has length 433 [2018-01-30 05:32:37,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:37,874 INFO L432 AbstractCegarLoop]: Abstraction has 38000 states and 45737 transitions. [2018-01-30 05:32:37,874 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 05:32:37,874 INFO L276 IsEmpty]: Start isEmpty. Operand 38000 states and 45737 transitions. [2018-01-30 05:32:37,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-01-30 05:32:37,893 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:37,893 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:32:37,893 INFO L371 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:37,893 INFO L82 PathProgramCache]: Analyzing trace with hash -662859191, now seen corresponding path program 1 times [2018-01-30 05:32:37,893 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:37,893 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:37,894 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:37,894 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:37,894 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:37,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:37,901 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:38,094 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-01-30 05:32:38,095 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:32:38,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 05:32:38,095 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 05:32:38,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 05:32:38,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 05:32:38,095 INFO L87 Difference]: Start difference. First operand 38000 states and 45737 transitions. Second operand 4 states. [2018-01-30 05:32:38,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:38,853 INFO L93 Difference]: Finished difference Result 59844 states and 73177 transitions. [2018-01-30 05:32:38,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 05:32:38,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 435 [2018-01-30 05:32:38,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:38,888 INFO L225 Difference]: With dead ends: 59844 [2018-01-30 05:32:38,888 INFO L226 Difference]: Without dead ends: 50667 [2018-01-30 05:32:38,906 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:32:38,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50667 states. [2018-01-30 05:32:39,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50667 to 37980. [2018-01-30 05:32:39,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37980 states. [2018-01-30 05:32:39,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37980 states to 37980 states and 45697 transitions. [2018-01-30 05:32:39,447 INFO L78 Accepts]: Start accepts. Automaton has 37980 states and 45697 transitions. Word has length 435 [2018-01-30 05:32:39,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:39,447 INFO L432 AbstractCegarLoop]: Abstraction has 37980 states and 45697 transitions. [2018-01-30 05:32:39,447 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 05:32:39,447 INFO L276 IsEmpty]: Start isEmpty. Operand 37980 states and 45697 transitions. [2018-01-30 05:32:39,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-01-30 05:32:39,465 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:39,465 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:32:39,465 INFO L371 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:39,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1530721482, now seen corresponding path program 1 times [2018-01-30 05:32:39,465 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:39,465 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:39,466 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:39,466 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:39,466 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:39,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:39,473 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:39,586 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 409 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-01-30 05:32:39,586 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:32:39,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 05:32:39,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 05:32:39,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 05:32:39,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:32:39,587 INFO L87 Difference]: Start difference. First operand 37980 states and 45697 transitions. Second operand 5 states. [2018-01-30 05:32:40,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:40,197 INFO L93 Difference]: Finished difference Result 48476 states and 58441 transitions. [2018-01-30 05:32:40,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 05:32:40,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 438 [2018-01-30 05:32:40,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:40,221 INFO L225 Difference]: With dead ends: 48476 [2018-01-30 05:32:40,221 INFO L226 Difference]: Without dead ends: 39339 [2018-01-30 05:32:40,229 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-30 05:32:40,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39339 states. [2018-01-30 05:32:40,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39339 to 37980. [2018-01-30 05:32:40,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37980 states. [2018-01-30 05:32:40,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37980 states to 37980 states and 45697 transitions. [2018-01-30 05:32:40,739 INFO L78 Accepts]: Start accepts. Automaton has 37980 states and 45697 transitions. Word has length 438 [2018-01-30 05:32:40,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:40,739 INFO L432 AbstractCegarLoop]: Abstraction has 37980 states and 45697 transitions. [2018-01-30 05:32:40,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 05:32:40,739 INFO L276 IsEmpty]: Start isEmpty. Operand 37980 states and 45697 transitions. [2018-01-30 05:32:40,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2018-01-30 05:32:40,758 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:40,758 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:32:40,758 INFO L371 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:40,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1643090751, now seen corresponding path program 1 times [2018-01-30 05:32:40,758 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:40,758 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:40,759 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:40,759 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:40,759 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:40,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:40,963 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2018-01-30 05:32:40,963 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:32:40,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 05:32:40,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 05:32:40,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 05:32:40,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 05:32:40,964 INFO L87 Difference]: Start difference. First operand 37980 states and 45697 transitions. Second operand 4 states. [2018-01-30 05:32:41,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:41,624 INFO L93 Difference]: Finished difference Result 60624 states and 73124 transitions. [2018-01-30 05:32:41,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 05:32:41,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 439 [2018-01-30 05:32:41,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:41,657 INFO L225 Difference]: With dead ends: 60624 [2018-01-30 05:32:41,657 INFO L226 Difference]: Without dead ends: 48461 [2018-01-30 05:32:41,676 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:32:41,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48461 states. [2018-01-30 05:32:42,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48461 to 38133. [2018-01-30 05:32:42,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38133 states. [2018-01-30 05:32:42,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38133 states to 38133 states and 45860 transitions. [2018-01-30 05:32:42,341 INFO L78 Accepts]: Start accepts. Automaton has 38133 states and 45860 transitions. Word has length 439 [2018-01-30 05:32:42,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:42,341 INFO L432 AbstractCegarLoop]: Abstraction has 38133 states and 45860 transitions. [2018-01-30 05:32:42,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 05:32:42,341 INFO L276 IsEmpty]: Start isEmpty. Operand 38133 states and 45860 transitions. [2018-01-30 05:32:42,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2018-01-30 05:32:42,359 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:42,360 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:32:42,360 INFO L371 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:42,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1616796705, now seen corresponding path program 2 times [2018-01-30 05:32:42,360 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:42,360 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:42,361 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:42,361 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:42,361 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:42,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:42,492 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 428 proven. 34 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-01-30 05:32:42,493 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:32:42,493 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:32:42,497 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 05:32:42,514 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:32:42,532 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:32:42,535 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:32:42,538 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:32:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 428 proven. 34 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-01-30 05:32:42,617 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:32:42,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-30 05:32:42,618 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 05:32:42,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 05:32:42,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:32:42,618 INFO L87 Difference]: Start difference. First operand 38133 states and 45860 transitions. Second operand 5 states. [2018-01-30 05:32:45,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:45,056 INFO L93 Difference]: Finished difference Result 66205 states and 79465 transitions. [2018-01-30 05:32:45,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 05:32:45,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 441 [2018-01-30 05:32:45,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:45,090 INFO L225 Difference]: With dead ends: 66205 [2018-01-30 05:32:45,090 INFO L226 Difference]: Without dead ends: 53797 [2018-01-30 05:32:45,098 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 447 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-30 05:32:45,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53797 states. [2018-01-30 05:32:45,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53797 to 36734. [2018-01-30 05:32:45,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36734 states. [2018-01-30 05:32:45,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36734 states to 36734 states and 43882 transitions. [2018-01-30 05:32:45,675 INFO L78 Accepts]: Start accepts. Automaton has 36734 states and 43882 transitions. Word has length 441 [2018-01-30 05:32:45,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:45,675 INFO L432 AbstractCegarLoop]: Abstraction has 36734 states and 43882 transitions. [2018-01-30 05:32:45,675 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 05:32:45,675 INFO L276 IsEmpty]: Start isEmpty. Operand 36734 states and 43882 transitions. [2018-01-30 05:32:45,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2018-01-30 05:32:45,693 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:45,694 INFO L350 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:32:45,694 INFO L371 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:45,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1868471265, now seen corresponding path program 1 times [2018-01-30 05:32:45,694 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:45,694 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:45,694 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:45,694 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:32:45,694 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:45,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:45,816 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 414 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-01-30 05:32:45,816 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:32:45,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:32:45,816 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:32:45,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:32:45,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:32:45,817 INFO L87 Difference]: Start difference. First operand 36734 states and 43882 transitions. Second operand 3 states. [2018-01-30 05:32:46,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:46,432 INFO L93 Difference]: Finished difference Result 73168 states and 88247 transitions. [2018-01-30 05:32:46,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:32:46,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 442 [2018-01-30 05:32:46,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:46,461 INFO L225 Difference]: With dead ends: 73168 [2018-01-30 05:32:46,462 INFO L226 Difference]: Without dead ends: 42327 [2018-01-30 05:32:46,485 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 05:32:46,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42327 states. [2018-01-30 05:32:47,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42327 to 38557. [2018-01-30 05:32:47,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38557 states. [2018-01-30 05:32:47,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38557 states to 38557 states and 45594 transitions. [2018-01-30 05:32:47,245 INFO L78 Accepts]: Start accepts. Automaton has 38557 states and 45594 transitions. Word has length 442 [2018-01-30 05:32:47,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:47,245 INFO L432 AbstractCegarLoop]: Abstraction has 38557 states and 45594 transitions. [2018-01-30 05:32:47,245 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:32:47,245 INFO L276 IsEmpty]: Start isEmpty. Operand 38557 states and 45594 transitions. [2018-01-30 05:32:47,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2018-01-30 05:32:47,265 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:47,265 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:32:47,266 INFO L371 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:47,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1694708029, now seen corresponding path program 1 times [2018-01-30 05:32:47,266 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:47,266 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:47,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:47,266 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:47,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:47,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:47,396 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 448 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-01-30 05:32:47,396 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:32:47,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 05:32:47,397 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 05:32:47,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 05:32:47,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 05:32:47,397 INFO L87 Difference]: Start difference. First operand 38557 states and 45594 transitions. Second operand 4 states. [2018-01-30 05:32:48,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:48,234 INFO L93 Difference]: Finished difference Result 64654 states and 77584 transitions. [2018-01-30 05:32:48,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 05:32:48,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 468 [2018-01-30 05:32:48,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:48,271 INFO L225 Difference]: With dead ends: 64654 [2018-01-30 05:32:48,271 INFO L226 Difference]: Without dead ends: 53089 [2018-01-30 05:32:48,291 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:32:48,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53089 states. [2018-01-30 05:32:49,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53089 to 38494. [2018-01-30 05:32:49,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38494 states. [2018-01-30 05:32:49,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38494 states to 38494 states and 45445 transitions. [2018-01-30 05:32:49,087 INFO L78 Accepts]: Start accepts. Automaton has 38494 states and 45445 transitions. Word has length 468 [2018-01-30 05:32:49,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:49,087 INFO L432 AbstractCegarLoop]: Abstraction has 38494 states and 45445 transitions. [2018-01-30 05:32:49,087 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 05:32:49,087 INFO L276 IsEmpty]: Start isEmpty. Operand 38494 states and 45445 transitions. [2018-01-30 05:32:49,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2018-01-30 05:32:49,107 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:49,107 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:32:49,107 INFO L371 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:49,107 INFO L82 PathProgramCache]: Analyzing trace with hash -409547243, now seen corresponding path program 1 times [2018-01-30 05:32:49,107 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:49,107 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:49,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:49,108 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:49,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:49,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:49,266 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 561 proven. 25 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2018-01-30 05:32:49,266 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:32:49,266 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:32:49,271 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:49,310 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:32:49,370 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 561 proven. 25 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2018-01-30 05:32:49,387 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:32:49,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-30 05:32:49,388 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 05:32:49,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 05:32:49,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:32:49,388 INFO L87 Difference]: Start difference. First operand 38494 states and 45445 transitions. Second operand 5 states. [2018-01-30 05:32:50,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:50,421 INFO L93 Difference]: Finished difference Result 58553 states and 69063 transitions. [2018-01-30 05:32:50,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 05:32:50,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 473 [2018-01-30 05:32:50,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:50,455 INFO L225 Difference]: With dead ends: 58553 [2018-01-30 05:32:50,455 INFO L226 Difference]: Without dead ends: 47051 [2018-01-30 05:32:50,473 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 479 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-30 05:32:50,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47051 states. [2018-01-30 05:32:51,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47051 to 37701. [2018-01-30 05:32:51,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37701 states. [2018-01-30 05:32:51,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37701 states to 37701 states and 43920 transitions. [2018-01-30 05:32:51,229 INFO L78 Accepts]: Start accepts. Automaton has 37701 states and 43920 transitions. Word has length 473 [2018-01-30 05:32:51,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:51,229 INFO L432 AbstractCegarLoop]: Abstraction has 37701 states and 43920 transitions. [2018-01-30 05:32:51,229 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 05:32:51,229 INFO L276 IsEmpty]: Start isEmpty. Operand 37701 states and 43920 transitions. [2018-01-30 05:32:51,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2018-01-30 05:32:51,248 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:51,248 INFO L350 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:32:51,248 INFO L371 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:51,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1343487640, now seen corresponding path program 1 times [2018-01-30 05:32:51,248 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:51,248 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:51,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:51,249 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:51,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:51,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:51,371 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 463 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2018-01-30 05:32:51,371 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:32:51,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:32:51,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:32:51,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:32:51,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:32:51,372 INFO L87 Difference]: Start difference. First operand 37701 states and 43920 transitions. Second operand 3 states. [2018-01-30 05:32:52,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:52,190 INFO L93 Difference]: Finished difference Result 79143 states and 93148 transitions. [2018-01-30 05:32:52,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:32:52,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 479 [2018-01-30 05:32:52,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:52,220 INFO L225 Difference]: With dead ends: 79143 [2018-01-30 05:32:52,220 INFO L226 Difference]: Without dead ends: 41749 [2018-01-30 05:32:52,250 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 05:32:52,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41749 states. [2018-01-30 05:32:53,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41749 to 39685. [2018-01-30 05:32:53,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39685 states. [2018-01-30 05:32:53,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39685 states to 39685 states and 45984 transitions. [2018-01-30 05:32:53,582 INFO L78 Accepts]: Start accepts. Automaton has 39685 states and 45984 transitions. Word has length 479 [2018-01-30 05:32:53,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:53,582 INFO L432 AbstractCegarLoop]: Abstraction has 39685 states and 45984 transitions. [2018-01-30 05:32:53,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:32:53,582 INFO L276 IsEmpty]: Start isEmpty. Operand 39685 states and 45984 transitions. [2018-01-30 05:32:53,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2018-01-30 05:32:53,601 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:53,601 INFO L350 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:32:53,601 INFO L371 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:53,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1499927776, now seen corresponding path program 1 times [2018-01-30 05:32:53,601 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:53,601 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:53,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:53,602 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:53,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:53,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:53,791 INFO L134 CoverageAnalysis]: Checked inductivity of 939 backedges. 570 proven. 22 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2018-01-30 05:32:53,791 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:32:53,791 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:32:53,796 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:53,838 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:32:53,930 INFO L134 CoverageAnalysis]: Checked inductivity of 939 backedges. 598 proven. 0 refuted. 0 times theorem prover too weak. 341 trivial. 0 not checked. [2018-01-30 05:32:53,947 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 05:32:53,948 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-01-30 05:32:53,948 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 05:32:53,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 05:32:53,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 05:32:53,948 INFO L87 Difference]: Start difference. First operand 39685 states and 45984 transitions. Second operand 6 states. [2018-01-30 05:32:55,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:55,148 INFO L93 Difference]: Finished difference Result 66662 states and 77556 transitions. [2018-01-30 05:32:55,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 05:32:55,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 501 [2018-01-30 05:32:55,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:55,174 INFO L225 Difference]: With dead ends: 66662 [2018-01-30 05:32:55,174 INFO L226 Difference]: Without dead ends: 42882 [2018-01-30 05:32:55,190 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-01-30 05:32:55,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42882 states. [2018-01-30 05:32:55,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42882 to 36579. [2018-01-30 05:32:55,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36579 states. [2018-01-30 05:32:55,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36579 states to 36579 states and 42264 transitions. [2018-01-30 05:32:55,885 INFO L78 Accepts]: Start accepts. Automaton has 36579 states and 42264 transitions. Word has length 501 [2018-01-30 05:32:55,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:55,886 INFO L432 AbstractCegarLoop]: Abstraction has 36579 states and 42264 transitions. [2018-01-30 05:32:55,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 05:32:55,886 INFO L276 IsEmpty]: Start isEmpty. Operand 36579 states and 42264 transitions. [2018-01-30 05:32:55,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2018-01-30 05:32:55,903 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:55,903 INFO L350 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 05:32:55,903 INFO L371 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:55,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1133507502, now seen corresponding path program 1 times [2018-01-30 05:32:55,904 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:55,904 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:55,904 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:55,904 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:55,904 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:55,912 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:56,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1039 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2018-01-30 05:32:56,046 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:32:56,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:32:56,046 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:32:56,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:32:56,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:32:56,047 INFO L87 Difference]: Start difference. First operand 36579 states and 42264 transitions. Second operand 3 states. [2018-01-30 05:32:56,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:56,791 INFO L93 Difference]: Finished difference Result 70610 states and 81453 transitions. [2018-01-30 05:32:56,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:32:56,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 512 [2018-01-30 05:32:56,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:56,810 INFO L225 Difference]: With dead ends: 70610 [2018-01-30 05:32:56,810 INFO L226 Difference]: Without dead ends: 29200 [2018-01-30 05:32:56,822 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 05:32:56,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29200 states. [2018-01-30 05:32:57,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29200 to 26318. [2018-01-30 05:32:57,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26318 states. [2018-01-30 05:32:57,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26318 states to 26318 states and 30662 transitions. [2018-01-30 05:32:57,346 INFO L78 Accepts]: Start accepts. Automaton has 26318 states and 30662 transitions. Word has length 512 [2018-01-30 05:32:57,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:57,346 INFO L432 AbstractCegarLoop]: Abstraction has 26318 states and 30662 transitions. [2018-01-30 05:32:57,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:32:57,346 INFO L276 IsEmpty]: Start isEmpty. Operand 26318 states and 30662 transitions. [2018-01-30 05:32:57,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2018-01-30 05:32:57,358 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:57,358 INFO L350 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:32:57,358 INFO L371 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:57,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1022477732, now seen corresponding path program 1 times [2018-01-30 05:32:57,359 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:57,359 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:57,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:57,359 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:57,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:57,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:57,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 592 proven. 22 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2018-01-30 05:32:57,559 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:32:57,559 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:32:57,564 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:57,602 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:32:57,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 438 proven. 0 refuted. 0 times theorem prover too weak. 586 trivial. 0 not checked. [2018-01-30 05:32:57,703 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 05:32:57,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-01-30 05:32:57,703 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 05:32:57,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 05:32:57,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-30 05:32:57,704 INFO L87 Difference]: Start difference. First operand 26318 states and 30662 transitions. Second operand 7 states. [2018-01-30 05:32:59,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:32:59,057 INFO L93 Difference]: Finished difference Result 67426 states and 79841 transitions. [2018-01-30 05:32:59,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-30 05:32:59,058 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 518 [2018-01-30 05:32:59,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:32:59,085 INFO L225 Difference]: With dead ends: 67426 [2018-01-30 05:32:59,085 INFO L226 Difference]: Without dead ends: 40715 [2018-01-30 05:32:59,103 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 529 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2018-01-30 05:32:59,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40715 states. [2018-01-30 05:32:59,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40715 to 26354. [2018-01-30 05:32:59,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26354 states. [2018-01-30 05:32:59,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26354 states to 26354 states and 30743 transitions. [2018-01-30 05:32:59,699 INFO L78 Accepts]: Start accepts. Automaton has 26354 states and 30743 transitions. Word has length 518 [2018-01-30 05:32:59,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:32:59,699 INFO L432 AbstractCegarLoop]: Abstraction has 26354 states and 30743 transitions. [2018-01-30 05:32:59,699 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 05:32:59,699 INFO L276 IsEmpty]: Start isEmpty. Operand 26354 states and 30743 transitions. [2018-01-30 05:32:59,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2018-01-30 05:32:59,711 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:32:59,712 INFO L350 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:32:59,712 INFO L371 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:32:59,712 INFO L82 PathProgramCache]: Analyzing trace with hash 519298175, now seen corresponding path program 2 times [2018-01-30 05:32:59,712 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:32:59,712 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:32:59,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:59,712 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:32:59,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:32:59,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:32:59,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:32:59,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1097 backedges. 778 proven. 31 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-01-30 05:32:59,856 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:32:59,856 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:32:59,860 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 05:32:59,878 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:32:59,968 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:32:59,973 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:32:59,976 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:33:00,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1097 backedges. 485 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2018-01-30 05:33:00,069 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 05:33:00,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-01-30 05:33:00,070 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 05:33:00,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 05:33:00,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 05:33:00,070 INFO L87 Difference]: Start difference. First operand 26354 states and 30743 transitions. Second operand 6 states. [2018-01-30 05:33:01,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:01,374 INFO L93 Difference]: Finished difference Result 53822 states and 63163 transitions. [2018-01-30 05:33:01,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 05:33:01,375 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 536 [2018-01-30 05:33:01,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:01,395 INFO L225 Difference]: With dead ends: 53822 [2018-01-30 05:33:01,395 INFO L226 Difference]: Without dead ends: 28312 [2018-01-30 05:33:01,414 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 542 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-01-30 05:33:01,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28312 states. [2018-01-30 05:33:01,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28312 to 15036. [2018-01-30 05:33:01,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15036 states. [2018-01-30 05:33:01,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15036 states to 15036 states and 17630 transitions. [2018-01-30 05:33:01,905 INFO L78 Accepts]: Start accepts. Automaton has 15036 states and 17630 transitions. Word has length 536 [2018-01-30 05:33:01,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:01,905 INFO L432 AbstractCegarLoop]: Abstraction has 15036 states and 17630 transitions. [2018-01-30 05:33:01,905 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 05:33:01,905 INFO L276 IsEmpty]: Start isEmpty. Operand 15036 states and 17630 transitions. [2018-01-30 05:33:01,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2018-01-30 05:33:01,913 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:01,913 INFO L350 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:33:01,913 INFO L371 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:01,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1471194717, now seen corresponding path program 1 times [2018-01-30 05:33:01,914 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:01,914 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:01,914 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:01,914 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:33:01,914 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:01,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:01,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:33:02,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 802 proven. 22 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-01-30 05:33:02,572 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:33:02,573 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-30 05:33:02,577 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:33:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:02,628 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:33:02,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 802 proven. 22 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-01-30 05:33:02,724 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:33:02,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-30 05:33:02,725 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 05:33:02,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 05:33:02,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:33:02,725 INFO L87 Difference]: Start difference. First operand 15036 states and 17630 transitions. Second operand 5 states. [2018-01-30 05:33:03,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:03,343 INFO L93 Difference]: Finished difference Result 31693 states and 37199 transitions. [2018-01-30 05:33:03,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 05:33:03,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 549 [2018-01-30 05:33:03,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:03,354 INFO L225 Difference]: With dead ends: 31693 [2018-01-30 05:33:03,354 INFO L226 Difference]: Without dead ends: 16076 [2018-01-30 05:33:03,366 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 552 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-30 05:33:03,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16076 states. [2018-01-30 05:33:03,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16076 to 14304. [2018-01-30 05:33:03,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14304 states. [2018-01-30 05:33:03,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14304 states to 14304 states and 16609 transitions. [2018-01-30 05:33:03,809 INFO L78 Accepts]: Start accepts. Automaton has 14304 states and 16609 transitions. Word has length 549 [2018-01-30 05:33:03,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:03,810 INFO L432 AbstractCegarLoop]: Abstraction has 14304 states and 16609 transitions. [2018-01-30 05:33:03,810 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 05:33:03,810 INFO L276 IsEmpty]: Start isEmpty. Operand 14304 states and 16609 transitions. [2018-01-30 05:33:03,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2018-01-30 05:33:03,817 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:03,818 INFO L350 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:33:03,818 INFO L371 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:03,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1994446516, now seen corresponding path program 1 times [2018-01-30 05:33:03,818 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:03,818 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:03,818 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:03,818 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:03,818 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:03,828 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:33:04,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1150 backedges. 676 proven. 0 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2018-01-30 05:33:04,096 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:04,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 05:33:04,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 05:33:04,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 05:33:04,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 05:33:04,096 INFO L87 Difference]: Start difference. First operand 14304 states and 16609 transitions. Second operand 4 states. [2018-01-30 05:33:04,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:04,643 INFO L93 Difference]: Finished difference Result 24417 states and 28257 transitions. [2018-01-30 05:33:04,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 05:33:04,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 552 [2018-01-30 05:33:04,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:04,648 INFO L225 Difference]: With dead ends: 24417 [2018-01-30 05:33:04,648 INFO L226 Difference]: Without dead ends: 8237 [2018-01-30 05:33:04,658 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:33:04,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8237 states. [2018-01-30 05:33:04,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8237 to 6255. [2018-01-30 05:33:04,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6255 states. [2018-01-30 05:33:04,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6255 states to 6255 states and 7284 transitions. [2018-01-30 05:33:04,860 INFO L78 Accepts]: Start accepts. Automaton has 6255 states and 7284 transitions. Word has length 552 [2018-01-30 05:33:04,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:04,860 INFO L432 AbstractCegarLoop]: Abstraction has 6255 states and 7284 transitions. [2018-01-30 05:33:04,860 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 05:33:04,860 INFO L276 IsEmpty]: Start isEmpty. Operand 6255 states and 7284 transitions. [2018-01-30 05:33:04,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2018-01-30 05:33:04,864 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:04,864 INFO L350 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:33:04,864 INFO L371 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:04,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1267795999, now seen corresponding path program 1 times [2018-01-30 05:33:04,864 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:04,864 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:04,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:04,865 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:04,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:04,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:33:05,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1558 backedges. 491 proven. 0 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2018-01-30 05:33:05,028 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:05,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:05,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:05,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:05,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:05,029 INFO L87 Difference]: Start difference. First operand 6255 states and 7284 transitions. Second operand 3 states. [2018-01-30 05:33:05,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:05,218 INFO L93 Difference]: Finished difference Result 12382 states and 14434 transitions. [2018-01-30 05:33:05,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:05,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 598 [2018-01-30 05:33:05,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:05,221 INFO L225 Difference]: With dead ends: 12382 [2018-01-30 05:33:05,221 INFO L226 Difference]: Without dead ends: 6281 [2018-01-30 05:33:05,225 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 05:33:05,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6281 states. [2018-01-30 05:33:05,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6281 to 6255. [2018-01-30 05:33:05,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6255 states. [2018-01-30 05:33:05,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6255 states to 6255 states and 7258 transitions. [2018-01-30 05:33:05,422 INFO L78 Accepts]: Start accepts. Automaton has 6255 states and 7258 transitions. Word has length 598 [2018-01-30 05:33:05,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:05,422 INFO L432 AbstractCegarLoop]: Abstraction has 6255 states and 7258 transitions. [2018-01-30 05:33:05,422 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:05,422 INFO L276 IsEmpty]: Start isEmpty. Operand 6255 states and 7258 transitions. [2018-01-30 05:33:05,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2018-01-30 05:33:05,426 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:05,426 INFO L350 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:33:05,426 INFO L371 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:05,427 INFO L82 PathProgramCache]: Analyzing trace with hash -584981645, now seen corresponding path program 1 times [2018-01-30 05:33:05,427 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:05,427 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:05,427 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:05,427 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:05,427 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:05,437 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:33:05,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1561 backedges. 370 proven. 0 refuted. 0 times theorem prover too weak. 1191 trivial. 0 not checked. [2018-01-30 05:33:05,672 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:05,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 05:33:05,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 05:33:05,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 05:33:05,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:33:05,672 INFO L87 Difference]: Start difference. First operand 6255 states and 7258 transitions. Second operand 5 states. [2018-01-30 05:33:06,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:06,045 INFO L93 Difference]: Finished difference Result 13269 states and 15328 transitions. [2018-01-30 05:33:06,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 05:33:06,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 604 [2018-01-30 05:33:06,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:06,052 INFO L225 Difference]: With dead ends: 13269 [2018-01-30 05:33:06,052 INFO L226 Difference]: Without dead ends: 7168 [2018-01-30 05:33:06,056 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-30 05:33:06,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7168 states. [2018-01-30 05:33:06,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7168 to 6479. [2018-01-30 05:33:06,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6479 states. [2018-01-30 05:33:06,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6479 states to 6479 states and 7505 transitions. [2018-01-30 05:33:06,272 INFO L78 Accepts]: Start accepts. Automaton has 6479 states and 7505 transitions. Word has length 604 [2018-01-30 05:33:06,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:06,273 INFO L432 AbstractCegarLoop]: Abstraction has 6479 states and 7505 transitions. [2018-01-30 05:33:06,273 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 05:33:06,273 INFO L276 IsEmpty]: Start isEmpty. Operand 6479 states and 7505 transitions. [2018-01-30 05:33:06,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2018-01-30 05:33:06,276 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:06,277 INFO L350 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:33:06,277 INFO L371 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:06,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1198019240, now seen corresponding path program 1 times [2018-01-30 05:33:06,277 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:06,277 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:06,277 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:06,278 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:06,278 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:06,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:33:06,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 769 proven. 0 refuted. 0 times theorem prover too weak. 819 trivial. 0 not checked. [2018-01-30 05:33:06,466 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:06,466 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 05:33:06,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 05:33:06,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 05:33:06,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 05:33:06,467 INFO L87 Difference]: Start difference. First operand 6479 states and 7505 transitions. Second operand 4 states. [2018-01-30 05:33:06,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:06,967 INFO L93 Difference]: Finished difference Result 18759 states and 21867 transitions. [2018-01-30 05:33:06,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 05:33:06,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 607 [2018-01-30 05:33:06,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:06,973 INFO L225 Difference]: With dead ends: 18759 [2018-01-30 05:33:06,973 INFO L226 Difference]: Without dead ends: 12289 [2018-01-30 05:33:06,975 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:33:06,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12289 states. [2018-01-30 05:33:07,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12289 to 6765. [2018-01-30 05:33:07,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6765 states. [2018-01-30 05:33:07,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6765 states to 6765 states and 7817 transitions. [2018-01-30 05:33:07,214 INFO L78 Accepts]: Start accepts. Automaton has 6765 states and 7817 transitions. Word has length 607 [2018-01-30 05:33:07,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:07,215 INFO L432 AbstractCegarLoop]: Abstraction has 6765 states and 7817 transitions. [2018-01-30 05:33:07,215 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 05:33:07,215 INFO L276 IsEmpty]: Start isEmpty. Operand 6765 states and 7817 transitions. [2018-01-30 05:33:07,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2018-01-30 05:33:07,219 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:07,219 INFO L350 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:33:07,219 INFO L371 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:07,219 INFO L82 PathProgramCache]: Analyzing trace with hash 496133940, now seen corresponding path program 1 times [2018-01-30 05:33:07,219 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:07,219 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:07,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:07,220 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:07,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:07,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:33:07,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1963 backedges. 919 proven. 0 refuted. 0 times theorem prover too weak. 1044 trivial. 0 not checked. [2018-01-30 05:33:07,393 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:07,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:07,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:07,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:07,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:07,394 INFO L87 Difference]: Start difference. First operand 6765 states and 7817 transitions. Second operand 3 states. [2018-01-30 05:33:07,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:07,998 INFO L93 Difference]: Finished difference Result 14056 states and 16310 transitions. [2018-01-30 05:33:07,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:07,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 653 [2018-01-30 05:33:07,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:08,002 INFO L225 Difference]: With dead ends: 14056 [2018-01-30 05:33:08,002 INFO L226 Difference]: Without dead ends: 7445 [2018-01-30 05:33:08,007 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 05:33:08,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7445 states. [2018-01-30 05:33:08,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7445 to 7194. [2018-01-30 05:33:08,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7194 states. [2018-01-30 05:33:08,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7194 states to 7194 states and 8272 transitions. [2018-01-30 05:33:08,250 INFO L78 Accepts]: Start accepts. Automaton has 7194 states and 8272 transitions. Word has length 653 [2018-01-30 05:33:08,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:08,251 INFO L432 AbstractCegarLoop]: Abstraction has 7194 states and 8272 transitions. [2018-01-30 05:33:08,251 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:08,251 INFO L276 IsEmpty]: Start isEmpty. Operand 7194 states and 8272 transitions. [2018-01-30 05:33:08,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2018-01-30 05:33:08,255 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:08,255 INFO L350 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:33:08,255 INFO L371 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:08,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1791114545, now seen corresponding path program 1 times [2018-01-30 05:33:08,256 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:08,256 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:08,256 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:08,256 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:08,256 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:08,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:33:08,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 723 proven. 0 refuted. 0 times theorem prover too weak. 1312 trivial. 0 not checked. [2018-01-30 05:33:08,432 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:08,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:08,432 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:08,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:08,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:08,433 INFO L87 Difference]: Start difference. First operand 7194 states and 8272 transitions. Second operand 3 states. [2018-01-30 05:33:08,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:08,868 INFO L93 Difference]: Finished difference Result 21040 states and 24184 transitions. [2018-01-30 05:33:08,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:08,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 662 [2018-01-30 05:33:08,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:08,876 INFO L225 Difference]: With dead ends: 21040 [2018-01-30 05:33:08,876 INFO L226 Difference]: Without dead ends: 14000 [2018-01-30 05:33:08,882 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 05:33:08,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14000 states. [2018-01-30 05:33:09,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14000 to 7207. [2018-01-30 05:33:09,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7207 states. [2018-01-30 05:33:09,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7207 states to 7207 states and 8285 transitions. [2018-01-30 05:33:09,153 INFO L78 Accepts]: Start accepts. Automaton has 7207 states and 8285 transitions. Word has length 662 [2018-01-30 05:33:09,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:09,153 INFO L432 AbstractCegarLoop]: Abstraction has 7207 states and 8285 transitions. [2018-01-30 05:33:09,153 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:09,153 INFO L276 IsEmpty]: Start isEmpty. Operand 7207 states and 8285 transitions. [2018-01-30 05:33:09,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2018-01-30 05:33:09,157 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:09,158 INFO L350 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:33:09,158 INFO L371 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:09,158 INFO L82 PathProgramCache]: Analyzing trace with hash 142299473, now seen corresponding path program 1 times [2018-01-30 05:33:09,158 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:09,158 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:09,159 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:09,159 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:09,159 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:09,168 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:33:09,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 1011 proven. 0 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2018-01-30 05:33:09,376 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:09,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 05:33:09,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 05:33:09,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 05:33:09,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 05:33:09,376 INFO L87 Difference]: Start difference. First operand 7207 states and 8285 transitions. Second operand 4 states. [2018-01-30 05:33:09,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:09,925 INFO L93 Difference]: Finished difference Result 20444 states and 23604 transitions. [2018-01-30 05:33:09,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 05:33:09,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 662 [2018-01-30 05:33:09,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:09,933 INFO L225 Difference]: With dead ends: 20444 [2018-01-30 05:33:09,934 INFO L226 Difference]: Without dead ends: 13272 [2018-01-30 05:33:09,940 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:33:09,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13272 states. [2018-01-30 05:33:10,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13272 to 7519. [2018-01-30 05:33:10,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7519 states. [2018-01-30 05:33:10,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7519 states to 7519 states and 8649 transitions. [2018-01-30 05:33:10,265 INFO L78 Accepts]: Start accepts. Automaton has 7519 states and 8649 transitions. Word has length 662 [2018-01-30 05:33:10,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:10,265 INFO L432 AbstractCegarLoop]: Abstraction has 7519 states and 8649 transitions. [2018-01-30 05:33:10,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 05:33:10,265 INFO L276 IsEmpty]: Start isEmpty. Operand 7519 states and 8649 transitions. [2018-01-30 05:33:10,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2018-01-30 05:33:10,270 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:10,270 INFO L350 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:33:10,270 INFO L371 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:10,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1031470307, now seen corresponding path program 1 times [2018-01-30 05:33:10,270 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:10,270 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:10,271 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:10,271 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:10,271 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:10,279 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:33:10,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2254 backedges. 1109 proven. 0 refuted. 0 times theorem prover too weak. 1145 trivial. 0 not checked. [2018-01-30 05:33:10,461 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:10,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:10,462 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:10,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:10,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:10,462 INFO L87 Difference]: Start difference. First operand 7519 states and 8649 transitions. Second operand 3 states. [2018-01-30 05:33:10,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:10,793 INFO L93 Difference]: Finished difference Result 14516 states and 16696 transitions. [2018-01-30 05:33:10,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:10,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 683 [2018-01-30 05:33:10,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:10,797 INFO L225 Difference]: With dead ends: 14516 [2018-01-30 05:33:10,797 INFO L226 Difference]: Without dead ends: 7151 [2018-01-30 05:33:10,802 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 05:33:10,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7151 states. [2018-01-30 05:33:11,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7151 to 5045. [2018-01-30 05:33:11,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5045 states. [2018-01-30 05:33:11,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5045 states to 5045 states and 5784 transitions. [2018-01-30 05:33:11,013 INFO L78 Accepts]: Start accepts. Automaton has 5045 states and 5784 transitions. Word has length 683 [2018-01-30 05:33:11,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:11,013 INFO L432 AbstractCegarLoop]: Abstraction has 5045 states and 5784 transitions. [2018-01-30 05:33:11,013 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:11,014 INFO L276 IsEmpty]: Start isEmpty. Operand 5045 states and 5784 transitions. [2018-01-30 05:33:11,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2018-01-30 05:33:11,017 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:11,017 INFO L350 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:33:11,017 INFO L371 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:11,018 INFO L82 PathProgramCache]: Analyzing trace with hash -544787411, now seen corresponding path program 1 times [2018-01-30 05:33:11,018 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:11,018 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:11,018 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:11,018 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:11,018 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:11,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:33:11,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2680 backedges. 1144 proven. 2 refuted. 0 times theorem prover too weak. 1534 trivial. 0 not checked. [2018-01-30 05:33:11,301 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:33:11,301 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:33:11,306 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:11,367 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:33:11,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2680 backedges. 1144 proven. 2 refuted. 0 times theorem prover too weak. 1534 trivial. 0 not checked. [2018-01-30 05:33:11,754 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:33:11,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-01-30 05:33:11,755 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 05:33:11,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 05:33:11,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-30 05:33:11,755 INFO L87 Difference]: Start difference. First operand 5045 states and 5784 transitions. Second operand 8 states. [2018-01-30 05:33:12,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:12,538 INFO L93 Difference]: Finished difference Result 11697 states and 13442 transitions. [2018-01-30 05:33:12,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 05:33:12,538 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 730 [2018-01-30 05:33:12,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:12,543 INFO L225 Difference]: With dead ends: 11697 [2018-01-30 05:33:12,543 INFO L226 Difference]: Without dead ends: 6624 [2018-01-30 05:33:12,546 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 738 GetRequests, 730 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-30 05:33:12,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6624 states. [2018-01-30 05:33:12,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6624 to 5438. [2018-01-30 05:33:12,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5438 states. [2018-01-30 05:33:12,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5438 states to 5438 states and 6256 transitions. [2018-01-30 05:33:12,775 INFO L78 Accepts]: Start accepts. Automaton has 5438 states and 6256 transitions. Word has length 730 [2018-01-30 05:33:12,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:12,775 INFO L432 AbstractCegarLoop]: Abstraction has 5438 states and 6256 transitions. [2018-01-30 05:33:12,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 05:33:12,775 INFO L276 IsEmpty]: Start isEmpty. Operand 5438 states and 6256 transitions. [2018-01-30 05:33:12,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2018-01-30 05:33:12,779 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:12,779 INFO L350 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:33:12,779 INFO L371 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:12,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1958680506, now seen corresponding path program 2 times [2018-01-30 05:33:12,780 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:12,780 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:12,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:12,780 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:12,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:12,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:33:13,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2710 backedges. 1580 proven. 34 refuted. 0 times theorem prover too weak. 1096 trivial. 0 not checked. [2018-01-30 05:33:13,066 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:33:13,066 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 05:33:13,073 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 05:33:13,094 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:33:13,130 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 05:33:13,138 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 05:33:13,142 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:33:13,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2710 backedges. 1580 proven. 34 refuted. 0 times theorem prover too weak. 1096 trivial. 0 not checked. [2018-01-30 05:33:13,291 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:33:13,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-30 05:33:13,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 05:33:13,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 05:33:13,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:33:13,292 INFO L87 Difference]: Start difference. First operand 5438 states and 6256 transitions. Second operand 5 states. [2018-01-30 05:33:13,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:13,972 INFO L93 Difference]: Finished difference Result 14905 states and 16955 transitions. [2018-01-30 05:33:13,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 05:33:13,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 733 [2018-01-30 05:33:13,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:13,979 INFO L225 Difference]: With dead ends: 14905 [2018-01-30 05:33:13,979 INFO L226 Difference]: Without dead ends: 10315 [2018-01-30 05:33:13,983 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 746 GetRequests, 739 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-30 05:33:13,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10315 states. [2018-01-30 05:33:14,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10315 to 5443. [2018-01-30 05:33:14,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5443 states. [2018-01-30 05:33:14,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5443 states to 5443 states and 6261 transitions. [2018-01-30 05:33:14,237 INFO L78 Accepts]: Start accepts. Automaton has 5443 states and 6261 transitions. Word has length 733 [2018-01-30 05:33:14,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:14,237 INFO L432 AbstractCegarLoop]: Abstraction has 5443 states and 6261 transitions. [2018-01-30 05:33:14,237 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 05:33:14,237 INFO L276 IsEmpty]: Start isEmpty. Operand 5443 states and 6261 transitions. [2018-01-30 05:33:14,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2018-01-30 05:33:14,242 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:14,242 INFO L350 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 8, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:33:14,242 INFO L371 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:14,242 INFO L82 PathProgramCache]: Analyzing trace with hash -566953166, now seen corresponding path program 1 times [2018-01-30 05:33:14,242 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:14,242 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:14,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:14,243 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:33:14,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:14,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:33:14,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3557 backedges. 1954 proven. 0 refuted. 0 times theorem prover too weak. 1603 trivial. 0 not checked. [2018-01-30 05:33:14,485 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:14,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:14,485 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:14,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:14,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:14,485 INFO L87 Difference]: Start difference. First operand 5443 states and 6261 transitions. Second operand 3 states. [2018-01-30 05:33:14,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:14,764 INFO L93 Difference]: Finished difference Result 11047 states and 12740 transitions. [2018-01-30 05:33:14,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:14,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 819 [2018-01-30 05:33:14,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:14,768 INFO L225 Difference]: With dead ends: 11047 [2018-01-30 05:33:14,768 INFO L226 Difference]: Without dead ends: 5758 [2018-01-30 05:33:14,771 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 05:33:14,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5758 states. [2018-01-30 05:33:15,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5758 to 5709. [2018-01-30 05:33:15,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5709 states. [2018-01-30 05:33:15,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5709 states to 5709 states and 6541 transitions. [2018-01-30 05:33:15,014 INFO L78 Accepts]: Start accepts. Automaton has 5709 states and 6541 transitions. Word has length 819 [2018-01-30 05:33:15,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:15,015 INFO L432 AbstractCegarLoop]: Abstraction has 5709 states and 6541 transitions. [2018-01-30 05:33:15,015 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:15,015 INFO L276 IsEmpty]: Start isEmpty. Operand 5709 states and 6541 transitions. [2018-01-30 05:33:15,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 826 [2018-01-30 05:33:15,019 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:15,019 INFO L350 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 11, 11, 8, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:33:15,019 INFO L371 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:15,020 INFO L82 PathProgramCache]: Analyzing trace with hash -620577126, now seen corresponding path program 2 times [2018-01-30 05:33:15,020 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:15,020 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:15,020 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:15,020 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:15,020 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:15,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:33:15,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 2022 proven. 0 refuted. 0 times theorem prover too weak. 1604 trivial. 0 not checked. [2018-01-30 05:33:15,312 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:15,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 05:33:15,312 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 05:33:15,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 05:33:15,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 05:33:15,312 INFO L87 Difference]: Start difference. First operand 5709 states and 6541 transitions. Second operand 4 states. [2018-01-30 05:33:15,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:15,821 INFO L93 Difference]: Finished difference Result 15386 states and 17568 transitions. [2018-01-30 05:33:15,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 05:33:15,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 825 [2018-01-30 05:33:15,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:15,826 INFO L225 Difference]: With dead ends: 15386 [2018-01-30 05:33:15,827 INFO L226 Difference]: Without dead ends: 9809 [2018-01-30 05:33:15,831 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:33:15,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9809 states. [2018-01-30 05:33:16,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9809 to 5926. [2018-01-30 05:33:16,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5926 states. [2018-01-30 05:33:16,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5926 states to 5926 states and 6828 transitions. [2018-01-30 05:33:16,097 INFO L78 Accepts]: Start accepts. Automaton has 5926 states and 6828 transitions. Word has length 825 [2018-01-30 05:33:16,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:16,098 INFO L432 AbstractCegarLoop]: Abstraction has 5926 states and 6828 transitions. [2018-01-30 05:33:16,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 05:33:16,098 INFO L276 IsEmpty]: Start isEmpty. Operand 5926 states and 6828 transitions. [2018-01-30 05:33:16,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 900 [2018-01-30 05:33:16,103 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:16,103 INFO L350 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 11, 11, 11, 11, 10, 8, 8, 6, 6, 6, 6, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:33:16,103 INFO L371 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:16,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1790001270, now seen corresponding path program 1 times [2018-01-30 05:33:16,103 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:16,103 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:16,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:16,104 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:33:16,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:16,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:33:16,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4553 backedges. 2516 proven. 0 refuted. 0 times theorem prover too weak. 2037 trivial. 0 not checked. [2018-01-30 05:33:16,394 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:16,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:16,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:16,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:16,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:16,394 INFO L87 Difference]: Start difference. First operand 5926 states and 6828 transitions. Second operand 3 states. [2018-01-30 05:33:16,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:16,683 INFO L93 Difference]: Finished difference Result 11700 states and 13510 transitions. [2018-01-30 05:33:16,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:16,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 899 [2018-01-30 05:33:16,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:16,687 INFO L225 Difference]: With dead ends: 11700 [2018-01-30 05:33:16,687 INFO L226 Difference]: Without dead ends: 5928 [2018-01-30 05:33:16,691 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 05:33:16,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5928 states. Received shutdown request... [2018-01-30 05:33:16,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5928 to 5843. [2018-01-30 05:33:16,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5843 states. [2018-01-30 05:33:16,939 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 05:33:16,942 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 05:33:16,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 05:33:16 BasicIcfg [2018-01-30 05:33:16,943 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 05:33:16,943 INFO L168 Benchmark]: Toolchain (without parser) took 62726.10 ms. Allocated memory was 149.9 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 115.8 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 787.3 MB. Max. memory is 5.3 GB. [2018-01-30 05:33:16,944 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 149.9 MB. Free memory is still 120.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 05:33:16,944 INFO L168 Benchmark]: CACSL2BoogieTranslator took 155.34 ms. Allocated memory is still 149.9 MB. Free memory was 115.6 MB in the beginning and 101.4 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 5.3 GB. [2018-01-30 05:33:16,944 INFO L168 Benchmark]: Boogie Preprocessor took 24.37 ms. Allocated memory is still 149.9 MB. Free memory was 101.4 MB in the beginning and 99.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-30 05:33:16,944 INFO L168 Benchmark]: RCFGBuilder took 1165.04 ms. Allocated memory is still 149.9 MB. Free memory was 99.4 MB in the beginning and 90.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 39.4 MB. Max. memory is 5.3 GB. [2018-01-30 05:33:16,945 INFO L168 Benchmark]: IcfgTransformer took 20.67 ms. Allocated memory is still 149.9 MB. Free memory was 90.0 MB in the beginning and 87.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 5.3 GB. [2018-01-30 05:33:16,945 INFO L168 Benchmark]: TraceAbstraction took 61357.99 ms. Allocated memory was 149.9 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 87.1 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 758.6 MB. Max. memory is 5.3 GB. [2018-01-30 05:33:16,946 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 149.9 MB. Free memory is still 120.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 155.34 ms. Allocated memory is still 149.9 MB. Free memory was 115.6 MB in the beginning and 101.4 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.37 ms. Allocated memory is still 149.9 MB. Free memory was 101.4 MB in the beginning and 99.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 1165.04 ms. Allocated memory is still 149.9 MB. Free memory was 99.4 MB in the beginning and 90.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 39.4 MB. Max. memory is 5.3 GB. * IcfgTransformer took 20.67 ms. Allocated memory is still 149.9 MB. Free memory was 90.0 MB in the beginning and 87.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 61357.99 ms. Allocated memory was 149.9 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 87.1 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 758.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 608]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 608). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 410 locations, 1 error locations. TIMEOUT Result, 61.3s OverallTime, 54 OverallIterations, 19 TraceHistogramMax, 32.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 30458 SDtfs, 18330 SDslu, 36424 SDs, 0 SdLazy, 11443 SolverSat, 1513 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5640 GetRequests, 5469 SyntacticMatches, 6 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39685occurred in iteration=36, 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: 15.7s AutomataMinimizationTime, 54 MinimizatonAttempts, 169720 StatesRemovedByMinimization, 48 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 29678 NumberOfCodeBlocks, 29678 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 29614 ConstructedInterpolants, 0 QuantifiedInterpolants, 18579832 SizeOfPredicates, 28 NumberOfNonLiveVariables, 7272 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 64 InterpolantComputations, 47 PerfectInterpolantSequences, 60528/60925 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_4_true-unreach-call_false-termination.cil.c_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-30_05-33-16-950.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_4_true-unreach-call_false-termination.cil.c_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_05-33-16-950.csv Completed graceful shutdown