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_6_true-unreach-call_false-termination.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 05:33:18,935 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 05:33:18,936 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 05:33:18,945 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 05:33:18,945 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 05:33:18,946 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 05:33:18,946 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 05:33:18,947 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 05:33:18,949 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 05:33:18,949 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 05:33:18,950 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 05:33:18,950 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 05:33:18,950 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 05:33:18,951 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 05:33:18,952 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 05:33:18,953 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 05:33:18,954 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 05:33:18,955 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 05:33:18,956 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 05:33:18,956 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 05:33:18,958 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 05:33:18,958 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 05:33:18,958 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 05:33:18,958 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 05:33:18,959 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 05:33:18,960 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 05:33:18,960 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 05:33:18,960 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 05:33:18,960 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 05:33:18,960 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 05:33:18,961 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 05:33:18,961 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:33:18,967 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 05:33:18,967 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 05:33:18,967 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 05:33:18,967 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 05:33:18,967 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 05:33:18,968 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 05:33:18,968 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 05:33:18,968 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 05:33:18,968 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 05:33:18,968 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 05:33:18,968 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 05:33:18,969 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 05:33:18,969 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 05:33:18,969 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 05:33:18,969 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 05:33:18,969 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 05:33:18,969 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 05:33:18,969 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 05:33:18,969 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 05:33:18,969 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 05:33:18,970 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 05:33:18,970 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 05:33:18,970 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 05:33:18,970 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 05:33:18,970 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 05:33:18,970 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 05:33:18,970 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 05:33:18,970 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 05:33:18,970 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 05:33:18,970 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 05:33:18,970 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 05:33:18,970 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 05:33:18,971 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 05:33:18,971 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 05:33:18,989 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 05:33:18,995 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 05:33:18,997 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 05:33:18,998 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 05:33:18,998 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 05:33:18,999 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_6_true-unreach-call_false-termination.cil.c [2018-01-30 05:33:19,075 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 05:33:19,076 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 05:33:19,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 05:33:19,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 05:33:19,081 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 05:33:19,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 05:33:19" (1/1) ... [2018-01-30 05:33:19,083 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58379aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:33:19, skipping insertion in model container [2018-01-30 05:33:19,083 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 05:33:19" (1/1) ... [2018-01-30 05:33:19,092 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 05:33:19,118 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 05:33:19,236 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 05:33:19,277 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 05:33:19,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:33:19 WrapperNode [2018-01-30 05:33:19,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 05:33:19,287 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 05:33:19,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 05:33:19,288 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 05:33:19,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:33:19" (1/1) ... [2018-01-30 05:33:19,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:33:19" (1/1) ... [2018-01-30 05:33:19,302 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:33:19" (1/1) ... [2018-01-30 05:33:19,302 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:33:19" (1/1) ... [2018-01-30 05:33:19,305 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:33:19" (1/1) ... [2018-01-30 05:33:19,309 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:33:19" (1/1) ... [2018-01-30 05:33:19,310 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:33:19" (1/1) ... [2018-01-30 05:33:19,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 05:33:19,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 05:33:19,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 05:33:19,312 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 05:33:19,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:33:19" (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:33:19,362 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 05:33:19,363 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 05:33:19,363 INFO L136 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-01-30 05:33:19,363 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 05:33:19,363 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 05:33:19,363 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 05:33:19,363 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2018-01-30 05:33:19,363 INFO L128 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-01-30 05:33:19,363 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 05:33:19,363 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 05:33:19,363 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 05:33:19,532 WARN L490 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-01-30 05:33:19,532 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-30 05:33:20,373 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 05:33:20,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 05:33:20 BoogieIcfgContainer [2018-01-30 05:33:20,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 05:33:20,374 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 05:33:20,374 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 05:33:20,374 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 05:33:20,376 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 05:33:20" (1/1) ... [2018-01-30 05:33:20,379 WARN L213 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-01-30 05:33:20,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 05:33:20 BasicIcfg [2018-01-30 05:33:20,394 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 05:33:20,394 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 05:33:20,394 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 05:33:20,396 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 05:33:20,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 05:33:19" (1/4) ... [2018-01-30 05:33:20,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75afd365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 05:33:20, skipping insertion in model container [2018-01-30 05:33:20,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:33:19" (2/4) ... [2018-01-30 05:33:20,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75afd365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 05:33:20, skipping insertion in model container [2018-01-30 05:33:20,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 05:33:20" (3/4) ... [2018-01-30 05:33:20,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75afd365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 05:33:20, skipping insertion in model container [2018-01-30 05:33:20,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 05:33:20" (4/4) ... [2018-01-30 05:33:20,398 INFO L107 eAbstractionObserver]: Analyzing ICFG s3_srvr_6_true-unreach-call_false-termination.cil.cleft_unchanged_by_heapseparator [2018-01-30 05:33:20,403 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 05:33:20,408 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 05:33:20,434 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 05:33:20,434 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 05:33:20,434 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 05:33:20,434 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 05:33:20,434 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 05:33:20,434 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 05:33:20,435 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 05:33:20,435 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 05:33:20,435 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 05:33:20,447 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states. [2018-01-30 05:33:20,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-01-30 05:33:20,461 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:20,461 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:33:20,462 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:20,464 INFO L82 PathProgramCache]: Analyzing trace with hash 2061980694, now seen corresponding path program 1 times [2018-01-30 05:33:20,465 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:20,466 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:20,494 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:20,495 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:20,495 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:20,544 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:20,705 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:33:20,707 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:20,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:20,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:20,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:20,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:20,789 INFO L87 Difference]: Start difference. First operand 444 states. Second operand 3 states. [2018-01-30 05:33:21,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:21,119 INFO L93 Difference]: Finished difference Result 1014 states and 1353 transitions. [2018-01-30 05:33:21,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:21,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2018-01-30 05:33:21,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:21,131 INFO L225 Difference]: With dead ends: 1014 [2018-01-30 05:33:21,132 INFO L226 Difference]: Without dead ends: 651 [2018-01-30 05:33:21,134 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:21,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-01-30 05:33:21,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2018-01-30 05:33:21,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-01-30 05:33:21,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 797 transitions. [2018-01-30 05:33:21,174 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 797 transitions. Word has length 180 [2018-01-30 05:33:21,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:21,174 INFO L432 AbstractCegarLoop]: Abstraction has 651 states and 797 transitions. [2018-01-30 05:33:21,175 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:21,175 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 797 transitions. [2018-01-30 05:33:21,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-01-30 05:33:21,177 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:21,178 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:33:21,178 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:21,178 INFO L82 PathProgramCache]: Analyzing trace with hash 2120306526, now seen corresponding path program 1 times [2018-01-30 05:33:21,178 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:21,178 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:21,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:21,179 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:21,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:21,199 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:21,276 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:33:21,276 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:21,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:21,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:21,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:21,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:21,278 INFO L87 Difference]: Start difference. First operand 651 states and 797 transitions. Second operand 3 states. [2018-01-30 05:33:21,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:21,529 INFO L93 Difference]: Finished difference Result 1231 states and 1556 transitions. [2018-01-30 05:33:21,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:21,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2018-01-30 05:33:21,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:21,532 INFO L225 Difference]: With dead ends: 1231 [2018-01-30 05:33:21,532 INFO L226 Difference]: Without dead ends: 722 [2018-01-30 05:33:21,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:33:21,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2018-01-30 05:33:21,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 701. [2018-01-30 05:33:21,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2018-01-30 05:33:21,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 857 transitions. [2018-01-30 05:33:21,547 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 857 transitions. Word has length 204 [2018-01-30 05:33:21,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:21,548 INFO L432 AbstractCegarLoop]: Abstraction has 701 states and 857 transitions. [2018-01-30 05:33:21,548 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:21,548 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 857 transitions. [2018-01-30 05:33:21,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-01-30 05:33:21,550 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:21,550 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:33:21,550 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:21,550 INFO L82 PathProgramCache]: Analyzing trace with hash 350998690, now seen corresponding path program 1 times [2018-01-30 05:33:21,550 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:21,551 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:21,551 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:21,551 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:21,551 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:21,565 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:21,659 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:33:21,659 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:21,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:21,660 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:21,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:21,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:21,660 INFO L87 Difference]: Start difference. First operand 701 states and 857 transitions. Second operand 3 states. [2018-01-30 05:33:21,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:21,843 INFO L93 Difference]: Finished difference Result 1260 states and 1589 transitions. [2018-01-30 05:33:21,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:21,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-01-30 05:33:21,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:21,846 INFO L225 Difference]: With dead ends: 1260 [2018-01-30 05:33:21,846 INFO L226 Difference]: Without dead ends: 969 [2018-01-30 05:33:21,846 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:21,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2018-01-30 05:33:21,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 969. [2018-01-30 05:33:21,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2018-01-30 05:33:21,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1192 transitions. [2018-01-30 05:33:21,860 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1192 transitions. Word has length 211 [2018-01-30 05:33:21,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:21,861 INFO L432 AbstractCegarLoop]: Abstraction has 969 states and 1192 transitions. [2018-01-30 05:33:21,861 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:21,861 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1192 transitions. [2018-01-30 05:33:21,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-01-30 05:33:21,863 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:21,863 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:33:21,863 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:21,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1301343267, now seen corresponding path program 1 times [2018-01-30 05:33:21,863 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:21,864 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:21,864 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:21,864 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:21,864 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:21,876 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:21,969 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:33:21,969 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:21,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:21,970 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:21,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:21,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:21,970 INFO L87 Difference]: Start difference. First operand 969 states and 1192 transitions. Second operand 3 states. [2018-01-30 05:33:22,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:22,534 INFO L93 Difference]: Finished difference Result 2000 states and 2565 transitions. [2018-01-30 05:33:22,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:22,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-01-30 05:33:22,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:22,537 INFO L225 Difference]: With dead ends: 2000 [2018-01-30 05:33:22,537 INFO L226 Difference]: Without dead ends: 1173 [2018-01-30 05:33:22,539 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:22,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2018-01-30 05:33:22,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1104. [2018-01-30 05:33:22,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1104 states. [2018-01-30 05:33:22,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1351 transitions. [2018-01-30 05:33:22,552 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1351 transitions. Word has length 230 [2018-01-30 05:33:22,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:22,552 INFO L432 AbstractCegarLoop]: Abstraction has 1104 states and 1351 transitions. [2018-01-30 05:33:22,552 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:22,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1351 transitions. [2018-01-30 05:33:22,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-01-30 05:33:22,555 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:22,555 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:33:22,555 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:22,555 INFO L82 PathProgramCache]: Analyzing trace with hash 109536253, now seen corresponding path program 1 times [2018-01-30 05:33:22,555 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:22,555 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:22,556 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:22,556 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:22,556 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:22,566 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:22,637 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:33:22,637 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:22,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:22,637 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:22,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:22,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:22,638 INFO L87 Difference]: Start difference. First operand 1104 states and 1351 transitions. Second operand 3 states. [2018-01-30 05:33:23,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:23,094 INFO L93 Difference]: Finished difference Result 2181 states and 2732 transitions. [2018-01-30 05:33:23,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:23,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-01-30 05:33:23,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:23,097 INFO L225 Difference]: With dead ends: 2181 [2018-01-30 05:33:23,097 INFO L226 Difference]: Without dead ends: 1219 [2018-01-30 05:33:23,098 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:23,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-01-30 05:33:23,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1185. [2018-01-30 05:33:23,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2018-01-30 05:33:23,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1447 transitions. [2018-01-30 05:33:23,111 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1447 transitions. Word has length 230 [2018-01-30 05:33:23,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:23,111 INFO L432 AbstractCegarLoop]: Abstraction has 1185 states and 1447 transitions. [2018-01-30 05:33:23,111 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:23,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1447 transitions. [2018-01-30 05:33:23,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-01-30 05:33:23,114 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:23,114 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:33:23,114 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:23,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1756442813, now seen corresponding path program 1 times [2018-01-30 05:33:23,114 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:23,114 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:23,115 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:23,115 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:23,115 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:23,123 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:23,191 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:33:23,191 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:23,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:23,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:23,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:23,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:23,192 INFO L87 Difference]: Start difference. First operand 1185 states and 1447 transitions. Second operand 3 states. [2018-01-30 05:33:23,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:23,233 INFO L93 Difference]: Finished difference Result 3166 states and 3896 transitions. [2018-01-30 05:33:23,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:23,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2018-01-30 05:33:23,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:23,238 INFO L225 Difference]: With dead ends: 3166 [2018-01-30 05:33:23,238 INFO L226 Difference]: Without dead ends: 2123 [2018-01-30 05:33:23,240 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:23,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2018-01-30 05:33:23,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2121. [2018-01-30 05:33:23,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2121 states. [2018-01-30 05:33:23,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 2582 transitions. [2018-01-30 05:33:23,263 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 2582 transitions. Word has length 237 [2018-01-30 05:33:23,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:23,264 INFO L432 AbstractCegarLoop]: Abstraction has 2121 states and 2582 transitions. [2018-01-30 05:33:23,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:23,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2582 transitions. [2018-01-30 05:33:23,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-01-30 05:33:23,267 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:23,267 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:33:23,267 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:23,267 INFO L82 PathProgramCache]: Analyzing trace with hash 250381596, now seen corresponding path program 1 times [2018-01-30 05:33:23,267 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:23,267 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:23,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:23,268 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:23,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:23,275 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:23,348 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:33:23,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:23,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:23,349 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:23,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:23,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:23,349 INFO L87 Difference]: Start difference. First operand 2121 states and 2582 transitions. Second operand 3 states. [2018-01-30 05:33:23,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:23,410 INFO L93 Difference]: Finished difference Result 4139 states and 5063 transitions. [2018-01-30 05:33:23,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:23,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 238 [2018-01-30 05:33:23,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:23,415 INFO L225 Difference]: With dead ends: 4139 [2018-01-30 05:33:23,415 INFO L226 Difference]: Without dead ends: 2160 [2018-01-30 05:33:23,417 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:23,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2160 states. [2018-01-30 05:33:23,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2160 to 2139. [2018-01-30 05:33:23,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2139 states. [2018-01-30 05:33:23,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 2594 transitions. [2018-01-30 05:33:23,441 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 2594 transitions. Word has length 238 [2018-01-30 05:33:23,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:23,441 INFO L432 AbstractCegarLoop]: Abstraction has 2139 states and 2594 transitions. [2018-01-30 05:33:23,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:23,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2594 transitions. [2018-01-30 05:33:23,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-01-30 05:33:23,445 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:23,445 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:33:23,445 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:23,445 INFO L82 PathProgramCache]: Analyzing trace with hash 281872592, now seen corresponding path program 1 times [2018-01-30 05:33:23,445 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:23,445 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:23,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:23,446 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:23,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:23,453 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:23,518 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:33:23,518 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:23,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:23,519 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:23,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:23,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:23,519 INFO L87 Difference]: Start difference. First operand 2139 states and 2594 transitions. Second operand 3 states. [2018-01-30 05:33:23,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:23,636 INFO L93 Difference]: Finished difference Result 6118 states and 7465 transitions. [2018-01-30 05:33:23,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:23,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2018-01-30 05:33:23,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:23,644 INFO L225 Difference]: With dead ends: 6118 [2018-01-30 05:33:23,644 INFO L226 Difference]: Without dead ends: 4121 [2018-01-30 05:33:23,647 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:23,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4121 states. [2018-01-30 05:33:23,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4121 to 4119. [2018-01-30 05:33:23,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4119 states. [2018-01-30 05:33:23,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4119 states to 4119 states and 4998 transitions. [2018-01-30 05:33:23,717 INFO L78 Accepts]: Start accepts. Automaton has 4119 states and 4998 transitions. Word has length 240 [2018-01-30 05:33:23,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:23,717 INFO L432 AbstractCegarLoop]: Abstraction has 4119 states and 4998 transitions. [2018-01-30 05:33:23,717 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:23,718 INFO L276 IsEmpty]: Start isEmpty. Operand 4119 states and 4998 transitions. [2018-01-30 05:33:23,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-01-30 05:33:23,723 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:23,723 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:33:23,723 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:23,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1385106410, now seen corresponding path program 1 times [2018-01-30 05:33:23,724 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:23,724 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:23,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:23,724 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:23,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:23,731 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:23,812 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:33:23,812 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:23,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:23,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:23,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:23,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:23,813 INFO L87 Difference]: Start difference. First operand 4119 states and 4998 transitions. Second operand 3 states. [2018-01-30 05:33:24,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:24,152 INFO L93 Difference]: Finished difference Result 8090 states and 9926 transitions. [2018-01-30 05:33:24,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:24,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2018-01-30 05:33:24,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:24,162 INFO L225 Difference]: With dead ends: 8090 [2018-01-30 05:33:24,162 INFO L226 Difference]: Without dead ends: 5414 [2018-01-30 05:33:24,165 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:24,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5414 states. [2018-01-30 05:33:24,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5414 to 5414. [2018-01-30 05:33:24,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5414 states. [2018-01-30 05:33:24,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5414 states to 5414 states and 6563 transitions. [2018-01-30 05:33:24,242 INFO L78 Accepts]: Start accepts. Automaton has 5414 states and 6563 transitions. Word has length 241 [2018-01-30 05:33:24,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:24,242 INFO L432 AbstractCegarLoop]: Abstraction has 5414 states and 6563 transitions. [2018-01-30 05:33:24,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:24,242 INFO L276 IsEmpty]: Start isEmpty. Operand 5414 states and 6563 transitions. [2018-01-30 05:33:24,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-01-30 05:33:24,248 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:24,249 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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:33:24,249 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:24,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1603025059, now seen corresponding path program 1 times [2018-01-30 05:33:24,249 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:24,249 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:24,250 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:24,250 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:24,250 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:24,259 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:24,339 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-01-30 05:33:24,340 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:24,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:24,340 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:24,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:24,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:24,340 INFO L87 Difference]: Start difference. First operand 5414 states and 6563 transitions. Second operand 3 states. [2018-01-30 05:33:24,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:24,700 INFO L93 Difference]: Finished difference Result 11528 states and 14248 transitions. [2018-01-30 05:33:24,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:24,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2018-01-30 05:33:24,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:24,711 INFO L225 Difference]: With dead ends: 11528 [2018-01-30 05:33:24,712 INFO L226 Difference]: Without dead ends: 6262 [2018-01-30 05:33:24,718 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:24,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6262 states. [2018-01-30 05:33:24,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6262 to 5826. [2018-01-30 05:33:24,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5826 states. [2018-01-30 05:33:24,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5826 states to 5826 states and 7015 transitions. [2018-01-30 05:33:24,776 INFO L78 Accepts]: Start accepts. Automaton has 5826 states and 7015 transitions. Word has length 259 [2018-01-30 05:33:24,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:24,776 INFO L432 AbstractCegarLoop]: Abstraction has 5826 states and 7015 transitions. [2018-01-30 05:33:24,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:24,776 INFO L276 IsEmpty]: Start isEmpty. Operand 5826 states and 7015 transitions. [2018-01-30 05:33:24,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-01-30 05:33:24,782 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:24,783 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:33:24,783 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:24,783 INFO L82 PathProgramCache]: Analyzing trace with hash 2128648815, now seen corresponding path program 1 times [2018-01-30 05:33:24,783 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:24,783 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:24,784 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:24,784 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:24,784 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:24,790 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:24,897 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-30 05:33:24,897 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:24,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:24,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:24,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:24,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:24,898 INFO L87 Difference]: Start difference. First operand 5826 states and 7015 transitions. Second operand 3 states. [2018-01-30 05:33:25,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:25,379 INFO L93 Difference]: Finished difference Result 11504 states and 13960 transitions. [2018-01-30 05:33:25,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:25,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2018-01-30 05:33:25,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:25,391 INFO L225 Difference]: With dead ends: 11504 [2018-01-30 05:33:25,391 INFO L226 Difference]: Without dead ends: 7224 [2018-01-30 05:33:25,396 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:25,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7224 states. [2018-01-30 05:33:25,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7224 to 7224. [2018-01-30 05:33:25,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7224 states. [2018-01-30 05:33:25,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7224 states to 7224 states and 8697 transitions. [2018-01-30 05:33:25,459 INFO L78 Accepts]: Start accepts. Automaton has 7224 states and 8697 transitions. Word has length 274 [2018-01-30 05:33:25,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:25,460 INFO L432 AbstractCegarLoop]: Abstraction has 7224 states and 8697 transitions. [2018-01-30 05:33:25,460 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:25,460 INFO L276 IsEmpty]: Start isEmpty. Operand 7224 states and 8697 transitions. [2018-01-30 05:33:25,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-01-30 05:33:25,467 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:25,467 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 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] [2018-01-30 05:33:25,467 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:25,468 INFO L82 PathProgramCache]: Analyzing trace with hash 60780792, now seen corresponding path program 1 times [2018-01-30 05:33:25,468 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:25,468 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:25,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:25,468 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:25,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:25,474 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:25,574 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-01-30 05:33:25,574 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:25,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:25,574 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:25,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:25,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:25,575 INFO L87 Difference]: Start difference. First operand 7224 states and 8697 transitions. Second operand 3 states. [2018-01-30 05:33:25,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:25,688 INFO L93 Difference]: Finished difference Result 21076 states and 25363 transitions. [2018-01-30 05:33:25,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:25,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 293 [2018-01-30 05:33:25,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:25,704 INFO L225 Difference]: With dead ends: 21076 [2018-01-30 05:33:25,704 INFO L226 Difference]: Without dead ends: 14000 [2018-01-30 05:33:25,712 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:25,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14000 states. [2018-01-30 05:33:25,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14000 to 7244. [2018-01-30 05:33:25,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7244 states. [2018-01-30 05:33:25,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7244 states to 7244 states and 8717 transitions. [2018-01-30 05:33:25,800 INFO L78 Accepts]: Start accepts. Automaton has 7244 states and 8717 transitions. Word has length 293 [2018-01-30 05:33:25,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:25,801 INFO L432 AbstractCegarLoop]: Abstraction has 7244 states and 8717 transitions. [2018-01-30 05:33:25,801 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:25,801 INFO L276 IsEmpty]: Start isEmpty. Operand 7244 states and 8717 transitions. [2018-01-30 05:33:25,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-01-30 05:33:25,808 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:25,808 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 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] [2018-01-30 05:33:25,808 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:25,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1548304600, now seen corresponding path program 1 times [2018-01-30 05:33:25,809 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:25,809 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:25,809 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:25,809 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:25,809 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:25,816 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:25,933 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-01-30 05:33:25,934 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:25,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:25,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:25,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:25,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:25,934 INFO L87 Difference]: Start difference. First operand 7244 states and 8717 transitions. Second operand 3 states. [2018-01-30 05:33:26,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:26,154 INFO L93 Difference]: Finished difference Result 15349 states and 18803 transitions. [2018-01-30 05:33:26,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:26,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 293 [2018-01-30 05:33:26,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:26,162 INFO L225 Difference]: With dead ends: 15349 [2018-01-30 05:33:26,162 INFO L226 Difference]: Without dead ends: 8253 [2018-01-30 05:33:26,170 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:26,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8253 states. [2018-01-30 05:33:26,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8253 to 7799. [2018-01-30 05:33:26,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7799 states. [2018-01-30 05:33:26,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7799 states to 7799 states and 9322 transitions. [2018-01-30 05:33:26,243 INFO L78 Accepts]: Start accepts. Automaton has 7799 states and 9322 transitions. Word has length 293 [2018-01-30 05:33:26,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:26,243 INFO L432 AbstractCegarLoop]: Abstraction has 7799 states and 9322 transitions. [2018-01-30 05:33:26,243 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:26,243 INFO L276 IsEmpty]: Start isEmpty. Operand 7799 states and 9322 transitions. [2018-01-30 05:33:26,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-01-30 05:33:26,251 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:26,251 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, 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:26,251 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:26,252 INFO L82 PathProgramCache]: Analyzing trace with hash -926922943, now seen corresponding path program 1 times [2018-01-30 05:33:26,252 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:26,252 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:26,252 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:26,252 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:26,252 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:26,259 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:26,380 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-01-30 05:33:26,380 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:26,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:26,381 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:26,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:26,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:26,381 INFO L87 Difference]: Start difference. First operand 7799 states and 9322 transitions. Second operand 3 states. [2018-01-30 05:33:26,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:26,861 INFO L93 Difference]: Finished difference Result 15450 states and 18574 transitions. [2018-01-30 05:33:26,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:26,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2018-01-30 05:33:26,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:26,876 INFO L225 Difference]: With dead ends: 15450 [2018-01-30 05:33:26,876 INFO L226 Difference]: Without dead ends: 9312 [2018-01-30 05:33:26,884 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:26,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9312 states. [2018-01-30 05:33:26,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9312 to 9312. [2018-01-30 05:33:26,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9312 states. [2018-01-30 05:33:26,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9312 states to 9312 states and 11133 transitions. [2018-01-30 05:33:26,975 INFO L78 Accepts]: Start accepts. Automaton has 9312 states and 11133 transitions. Word has length 312 [2018-01-30 05:33:26,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:26,975 INFO L432 AbstractCegarLoop]: Abstraction has 9312 states and 11133 transitions. [2018-01-30 05:33:26,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:26,975 INFO L276 IsEmpty]: Start isEmpty. Operand 9312 states and 11133 transitions. [2018-01-30 05:33:26,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-01-30 05:33:26,984 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:26,984 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:33:26,985 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:26,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1149672086, now seen corresponding path program 1 times [2018-01-30 05:33:26,985 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:26,985 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:26,985 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:26,985 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:26,985 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:26,994 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:27,088 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-01-30 05:33:27,088 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:27,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:27,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:27,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:27,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:27,088 INFO L87 Difference]: Start difference. First operand 9312 states and 11133 transitions. Second operand 3 states. [2018-01-30 05:33:27,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:27,401 INFO L93 Difference]: Finished difference Result 19226 states and 23426 transitions. [2018-01-30 05:33:27,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:27,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2018-01-30 05:33:27,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:27,408 INFO L225 Difference]: With dead ends: 19226 [2018-01-30 05:33:27,409 INFO L226 Difference]: Without dead ends: 10062 [2018-01-30 05:33:27,416 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:27,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10062 states. [2018-01-30 05:33:27,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10062 to 10050. [2018-01-30 05:33:27,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10050 states. [2018-01-30 05:33:27,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10050 states to 10050 states and 11907 transitions. [2018-01-30 05:33:27,508 INFO L78 Accepts]: Start accepts. Automaton has 10050 states and 11907 transitions. Word has length 330 [2018-01-30 05:33:27,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:27,508 INFO L432 AbstractCegarLoop]: Abstraction has 10050 states and 11907 transitions. [2018-01-30 05:33:27,508 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:27,508 INFO L276 IsEmpty]: Start isEmpty. Operand 10050 states and 11907 transitions. [2018-01-30 05:33:27,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-01-30 05:33:27,516 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:27,516 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:33:27,516 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:27,516 INFO L82 PathProgramCache]: Analyzing trace with hash 193421270, now seen corresponding path program 1 times [2018-01-30 05:33:27,516 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:27,516 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:27,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:27,517 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:27,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:27,524 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:27,617 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-01-30 05:33:27,618 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:27,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:27,618 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:27,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:27,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:27,618 INFO L87 Difference]: Start difference. First operand 10050 states and 11907 transitions. Second operand 3 states. [2018-01-30 05:33:27,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:27,912 INFO L93 Difference]: Finished difference Result 19952 states and 23744 transitions. [2018-01-30 05:33:27,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:27,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 353 [2018-01-30 05:33:27,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:27,920 INFO L225 Difference]: With dead ends: 19952 [2018-01-30 05:33:27,920 INFO L226 Difference]: Without dead ends: 11686 [2018-01-30 05:33:27,928 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:27,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11686 states. [2018-01-30 05:33:28,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11686 to 11686. [2018-01-30 05:33:28,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11686 states. [2018-01-30 05:33:28,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11686 states to 11686 states and 13851 transitions. [2018-01-30 05:33:28,078 INFO L78 Accepts]: Start accepts. Automaton has 11686 states and 13851 transitions. Word has length 353 [2018-01-30 05:33:28,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:28,078 INFO L432 AbstractCegarLoop]: Abstraction has 11686 states and 13851 transitions. [2018-01-30 05:33:28,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:28,079 INFO L276 IsEmpty]: Start isEmpty. Operand 11686 states and 13851 transitions. [2018-01-30 05:33:28,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-01-30 05:33:28,085 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:28,085 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,085 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:28,085 INFO L82 PathProgramCache]: Analyzing trace with hash 46544672, now seen corresponding path program 1 times [2018-01-30 05:33:28,086 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:28,086 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:28,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:28,086 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:28,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:28,097 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:28,208 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2018-01-30 05:33:28,208 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:28,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:28,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:28,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:28,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:28,209 INFO L87 Difference]: Start difference. First operand 11686 states and 13851 transitions. Second operand 3 states. [2018-01-30 05:33:28,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:28,311 INFO L93 Difference]: Finished difference Result 17516 states and 20703 transitions. [2018-01-30 05:33:28,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:28,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 389 [2018-01-30 05:33:28,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:28,319 INFO L225 Difference]: With dead ends: 17516 [2018-01-30 05:33:28,320 INFO L226 Difference]: Without dead ends: 12194 [2018-01-30 05:33:28,326 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:28,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12194 states. [2018-01-30 05:33:28,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12194 to 12192. [2018-01-30 05:33:28,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12192 states. [2018-01-30 05:33:28,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12192 states to 12192 states and 14350 transitions. [2018-01-30 05:33:28,520 INFO L78 Accepts]: Start accepts. Automaton has 12192 states and 14350 transitions. Word has length 389 [2018-01-30 05:33:28,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:28,520 INFO L432 AbstractCegarLoop]: Abstraction has 12192 states and 14350 transitions. [2018-01-30 05:33:28,520 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:28,520 INFO L276 IsEmpty]: Start isEmpty. Operand 12192 states and 14350 transitions. [2018-01-30 05:33:28,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-01-30 05:33:28,528 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:28,528 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,528 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:28,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1057675985, now seen corresponding path program 1 times [2018-01-30 05:33:28,528 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:28,528 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:28,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:28,529 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:28,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:28,537 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:28,683 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2018-01-30 05:33:28,683 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:28,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:28,683 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:28,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:28,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:28,684 INFO L87 Difference]: Start difference. First operand 12192 states and 14350 transitions. Second operand 3 states. [2018-01-30 05:33:28,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:28,783 INFO L93 Difference]: Finished difference Result 20769 states and 24388 transitions. [2018-01-30 05:33:28,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:28,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2018-01-30 05:33:28,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:28,793 INFO L225 Difference]: With dead ends: 20769 [2018-01-30 05:33:28,793 INFO L226 Difference]: Without dead ends: 15034 [2018-01-30 05:33:28,800 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:28,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15034 states. [2018-01-30 05:33:28,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15034 to 15032. [2018-01-30 05:33:28,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15032 states. [2018-01-30 05:33:28,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15032 states to 15032 states and 17636 transitions. [2018-01-30 05:33:28,939 INFO L78 Accepts]: Start accepts. Automaton has 15032 states and 17636 transitions. Word has length 392 [2018-01-30 05:33:28,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:28,939 INFO L432 AbstractCegarLoop]: Abstraction has 15032 states and 17636 transitions. [2018-01-30 05:33:28,939 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:28,939 INFO L276 IsEmpty]: Start isEmpty. Operand 15032 states and 17636 transitions. [2018-01-30 05:33:28,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2018-01-30 05:33:28,948 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:28,948 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, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,948 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:28,948 INFO L82 PathProgramCache]: Analyzing trace with hash -485835623, now seen corresponding path program 1 times [2018-01-30 05:33:28,948 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:28,948 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:28,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:28,949 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:28,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:28,956 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:29,107 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2018-01-30 05:33:29,107 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:29,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:29,108 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:29,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:29,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:29,108 INFO L87 Difference]: Start difference. First operand 15032 states and 17636 transitions. Second operand 3 states. [2018-01-30 05:33:29,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:29,289 INFO L93 Difference]: Finished difference Result 30086 states and 35529 transitions. [2018-01-30 05:33:29,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:29,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 393 [2018-01-30 05:33:29,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:29,299 INFO L225 Difference]: With dead ends: 30086 [2018-01-30 05:33:29,299 INFO L226 Difference]: Without dead ends: 16042 [2018-01-30 05:33:29,310 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:29,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16042 states. [2018-01-30 05:33:29,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16042 to 15707. [2018-01-30 05:33:29,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15707 states. [2018-01-30 05:33:29,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15707 states to 15707 states and 18336 transitions. [2018-01-30 05:33:29,455 INFO L78 Accepts]: Start accepts. Automaton has 15707 states and 18336 transitions. Word has length 393 [2018-01-30 05:33:29,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:29,456 INFO L432 AbstractCegarLoop]: Abstraction has 15707 states and 18336 transitions. [2018-01-30 05:33:29,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:29,456 INFO L276 IsEmpty]: Start isEmpty. Operand 15707 states and 18336 transitions. [2018-01-30 05:33:29,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-01-30 05:33:29,465 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:29,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, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,465 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:29,466 INFO L82 PathProgramCache]: Analyzing trace with hash -2144793952, now seen corresponding path program 2 times [2018-01-30 05:33:29,466 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:29,466 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:29,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:29,467 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:29,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:29,475 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:29,619 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2018-01-30 05:33:29,620 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:29,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:29,620 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:29,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:29,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:29,620 INFO L87 Difference]: Start difference. First operand 15707 states and 18336 transitions. Second operand 3 states. [2018-01-30 05:33:29,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:29,867 INFO L93 Difference]: Finished difference Result 30416 states and 35562 transitions. [2018-01-30 05:33:29,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:29,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 396 [2018-01-30 05:33:29,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:29,878 INFO L225 Difference]: With dead ends: 30416 [2018-01-30 05:33:29,878 INFO L226 Difference]: Without dead ends: 17793 [2018-01-30 05:33:29,889 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:29,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17793 states. [2018-01-30 05:33:30,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17793 to 17793. [2018-01-30 05:33:30,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17793 states. [2018-01-30 05:33:30,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17793 states to 17793 states and 20771 transitions. [2018-01-30 05:33:30,049 INFO L78 Accepts]: Start accepts. Automaton has 17793 states and 20771 transitions. Word has length 396 [2018-01-30 05:33:30,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:30,050 INFO L432 AbstractCegarLoop]: Abstraction has 17793 states and 20771 transitions. [2018-01-30 05:33:30,050 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:30,050 INFO L276 IsEmpty]: Start isEmpty. Operand 17793 states and 20771 transitions. [2018-01-30 05:33:30,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-01-30 05:33:30,060 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:30,060 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, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,060 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:30,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1191690127, now seen corresponding path program 1 times [2018-01-30 05:33:30,060 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:30,061 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:30,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:30,061 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:33:30,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:30,069 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:30,170 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2018-01-30 05:33:30,170 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:30,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:30,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:30,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:30,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:30,171 INFO L87 Difference]: Start difference. First operand 17793 states and 20771 transitions. Second operand 3 states. [2018-01-30 05:33:30,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:30,694 INFO L93 Difference]: Finished difference Result 36197 states and 42969 transitions. [2018-01-30 05:33:30,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:30,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 400 [2018-01-30 05:33:30,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:30,707 INFO L225 Difference]: With dead ends: 36197 [2018-01-30 05:33:30,707 INFO L226 Difference]: Without dead ends: 19402 [2018-01-30 05:33:30,720 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:30,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19402 states. [2018-01-30 05:33:30,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19402 to 19123. [2018-01-30 05:33:30,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19123 states. [2018-01-30 05:33:30,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19123 states to 19123 states and 22129 transitions. [2018-01-30 05:33:30,892 INFO L78 Accepts]: Start accepts. Automaton has 19123 states and 22129 transitions. Word has length 400 [2018-01-30 05:33:30,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:30,892 INFO L432 AbstractCegarLoop]: Abstraction has 19123 states and 22129 transitions. [2018-01-30 05:33:30,892 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:30,892 INFO L276 IsEmpty]: Start isEmpty. Operand 19123 states and 22129 transitions. [2018-01-30 05:33:30,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2018-01-30 05:33:30,901 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:30,901 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, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,901 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:30,901 INFO L82 PathProgramCache]: Analyzing trace with hash -2096441400, now seen corresponding path program 2 times [2018-01-30 05:33:30,901 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:30,901 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:30,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:30,902 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:30,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:30,910 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:31,011 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2018-01-30 05:33:31,011 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:31,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:31,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:31,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:31,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:31,011 INFO L87 Difference]: Start difference. First operand 19123 states and 22129 transitions. Second operand 3 states. [2018-01-30 05:33:31,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:31,202 INFO L93 Difference]: Finished difference Result 37238 states and 43134 transitions. [2018-01-30 05:33:31,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:31,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 403 [2018-01-30 05:33:31,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:31,215 INFO L225 Difference]: With dead ends: 37238 [2018-01-30 05:33:31,216 INFO L226 Difference]: Without dead ends: 21374 [2018-01-30 05:33:31,226 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:31,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21374 states. [2018-01-30 05:33:31,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21374 to 21374. [2018-01-30 05:33:31,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21374 states. [2018-01-30 05:33:31,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21374 states to 21374 states and 24737 transitions. [2018-01-30 05:33:31,502 INFO L78 Accepts]: Start accepts. Automaton has 21374 states and 24737 transitions. Word has length 403 [2018-01-30 05:33:31,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:31,502 INFO L432 AbstractCegarLoop]: Abstraction has 21374 states and 24737 transitions. [2018-01-30 05:33:31,502 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:31,502 INFO L276 IsEmpty]: Start isEmpty. Operand 21374 states and 24737 transitions. [2018-01-30 05:33:31,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2018-01-30 05:33:31,513 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:31,513 INFO L350 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 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:31,513 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:31,514 INFO L82 PathProgramCache]: Analyzing trace with hash 2038307465, now seen corresponding path program 1 times [2018-01-30 05:33:31,514 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:31,514 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:31,514 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:31,514 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:33:31,514 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:31,523 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:31,610 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2018-01-30 05:33:31,611 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:31,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:31,611 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:31,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:31,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:31,611 INFO L87 Difference]: Start difference. First operand 21374 states and 24737 transitions. Second operand 3 states. [2018-01-30 05:33:31,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:31,845 INFO L93 Difference]: Finished difference Result 43636 states and 51392 transitions. [2018-01-30 05:33:31,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:31,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 440 [2018-01-30 05:33:31,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:31,860 INFO L225 Difference]: With dead ends: 43636 [2018-01-30 05:33:31,860 INFO L226 Difference]: Without dead ends: 23270 [2018-01-30 05:33:31,876 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:31,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23270 states. [2018-01-30 05:33:32,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23270 to 22959. [2018-01-30 05:33:32,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22959 states. [2018-01-30 05:33:32,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22959 states to 22959 states and 26353 transitions. [2018-01-30 05:33:32,082 INFO L78 Accepts]: Start accepts. Automaton has 22959 states and 26353 transitions. Word has length 440 [2018-01-30 05:33:32,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:32,083 INFO L432 AbstractCegarLoop]: Abstraction has 22959 states and 26353 transitions. [2018-01-30 05:33:32,083 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:32,083 INFO L276 IsEmpty]: Start isEmpty. Operand 22959 states and 26353 transitions. [2018-01-30 05:33:32,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2018-01-30 05:33:32,093 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:32,093 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, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,093 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:32,093 INFO L82 PathProgramCache]: Analyzing trace with hash -131779698, now seen corresponding path program 1 times [2018-01-30 05:33:32,093 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:32,093 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:32,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:32,094 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:32,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:32,103 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:32,288 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2018-01-30 05:33:32,288 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:32,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:32,289 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:32,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:32,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:32,289 INFO L87 Difference]: Start difference. First operand 22959 states and 26353 transitions. Second operand 3 states. [2018-01-30 05:33:32,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:32,515 INFO L93 Difference]: Finished difference Result 44900 states and 51568 transitions. [2018-01-30 05:33:32,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:32,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 445 [2018-01-30 05:33:32,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:32,532 INFO L225 Difference]: With dead ends: 44900 [2018-01-30 05:33:32,532 INFO L226 Difference]: Without dead ends: 25385 [2018-01-30 05:33:32,549 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:32,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25385 states. [2018-01-30 05:33:32,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25385 to 25385. [2018-01-30 05:33:32,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25385 states. [2018-01-30 05:33:32,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25385 states to 25385 states and 29144 transitions. [2018-01-30 05:33:32,776 INFO L78 Accepts]: Start accepts. Automaton has 25385 states and 29144 transitions. Word has length 445 [2018-01-30 05:33:32,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:32,777 INFO L432 AbstractCegarLoop]: Abstraction has 25385 states and 29144 transitions. [2018-01-30 05:33:32,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:32,777 INFO L276 IsEmpty]: Start isEmpty. Operand 25385 states and 29144 transitions. [2018-01-30 05:33:32,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2018-01-30 05:33:32,788 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:32,788 INFO L350 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,789 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:32,789 INFO L82 PathProgramCache]: Analyzing trace with hash 266531934, now seen corresponding path program 1 times [2018-01-30 05:33:32,789 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:32,789 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:32,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:32,789 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:32,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:32,799 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:32,929 INFO L134 CoverageAnalysis]: Checked inductivity of 902 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2018-01-30 05:33:32,929 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:32,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:32,930 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:32,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:32,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:32,930 INFO L87 Difference]: Start difference. First operand 25385 states and 29144 transitions. Second operand 3 states. [2018-01-30 05:33:33,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:33,507 INFO L93 Difference]: Finished difference Result 49702 states and 57075 transitions. [2018-01-30 05:33:33,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:33,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 480 [2018-01-30 05:33:33,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:33,524 INFO L225 Difference]: With dead ends: 49702 [2018-01-30 05:33:33,524 INFO L226 Difference]: Without dead ends: 27761 [2018-01-30 05:33:33,539 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:33,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27761 states. [2018-01-30 05:33:33,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27761 to 27761. [2018-01-30 05:33:33,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27761 states. [2018-01-30 05:33:33,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27761 states to 27761 states and 31835 transitions. [2018-01-30 05:33:33,787 INFO L78 Accepts]: Start accepts. Automaton has 27761 states and 31835 transitions. Word has length 480 [2018-01-30 05:33:33,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:33,787 INFO L432 AbstractCegarLoop]: Abstraction has 27761 states and 31835 transitions. [2018-01-30 05:33:33,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:33,788 INFO L276 IsEmpty]: Start isEmpty. Operand 27761 states and 31835 transitions. [2018-01-30 05:33:33,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2018-01-30 05:33:33,802 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:33,802 INFO L350 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,802 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:33,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1502489115, now seen corresponding path program 1 times [2018-01-30 05:33:33,802 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:33,802 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:33,803 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:33,803 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:33,803 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:33,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:33,813 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:33,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1149 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2018-01-30 05:33:33,989 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:33,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:33,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:33,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:33,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:33,990 INFO L87 Difference]: Start difference. First operand 27761 states and 31835 transitions. Second operand 3 states. [2018-01-30 05:33:34,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:34,405 INFO L93 Difference]: Finished difference Result 79530 states and 91277 transitions. [2018-01-30 05:33:34,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:34,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 523 [2018-01-30 05:33:34,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:34,436 INFO L225 Difference]: With dead ends: 79530 [2018-01-30 05:33:34,437 INFO L226 Difference]: Without dead ends: 52787 [2018-01-30 05:33:34,451 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:34,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52787 states. [2018-01-30 05:33:34,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52787 to 52785. [2018-01-30 05:33:34,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52785 states. [2018-01-30 05:33:34,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52785 states to 52785 states and 60524 transitions. [2018-01-30 05:33:34,924 INFO L78 Accepts]: Start accepts. Automaton has 52785 states and 60524 transitions. Word has length 523 [2018-01-30 05:33:34,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:34,924 INFO L432 AbstractCegarLoop]: Abstraction has 52785 states and 60524 transitions. [2018-01-30 05:33:34,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:34,925 INFO L276 IsEmpty]: Start isEmpty. Operand 52785 states and 60524 transitions. [2018-01-30 05:33:34,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2018-01-30 05:33:34,950 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:34,950 INFO L350 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,950 INFO L371 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:34,950 INFO L82 PathProgramCache]: Analyzing trace with hash 302761864, now seen corresponding path program 1 times [2018-01-30 05:33:34,950 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:34,950 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:34,951 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:34,951 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:34,951 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:34,961 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:35,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 817 trivial. 0 not checked. [2018-01-30 05:33:35,103 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:35,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:35,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:35,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:35,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:35,103 INFO L87 Difference]: Start difference. First operand 52785 states and 60524 transitions. Second operand 3 states. [2018-01-30 05:33:35,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:35,794 INFO L93 Difference]: Finished difference Result 107400 states and 126022 transitions. [2018-01-30 05:33:35,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:35,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 536 [2018-01-30 05:33:35,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:35,828 INFO L225 Difference]: With dead ends: 107400 [2018-01-30 05:33:35,828 INFO L226 Difference]: Without dead ends: 51066 [2018-01-30 05:33:35,853 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:35,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51066 states. [2018-01-30 05:33:36,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51066 to 50619. [2018-01-30 05:33:36,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50619 states. [2018-01-30 05:33:36,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50619 states to 50619 states and 57931 transitions. [2018-01-30 05:33:36,314 INFO L78 Accepts]: Start accepts. Automaton has 50619 states and 57931 transitions. Word has length 536 [2018-01-30 05:33:36,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:36,315 INFO L432 AbstractCegarLoop]: Abstraction has 50619 states and 57931 transitions. [2018-01-30 05:33:36,315 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:36,315 INFO L276 IsEmpty]: Start isEmpty. Operand 50619 states and 57931 transitions. [2018-01-30 05:33:36,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2018-01-30 05:33:36,340 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:36,340 INFO L350 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,340 INFO L371 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:36,340 INFO L82 PathProgramCache]: Analyzing trace with hash 683085494, now seen corresponding path program 1 times [2018-01-30 05:33:36,340 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:36,340 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:36,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:36,341 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:36,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:36,351 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:36,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2018-01-30 05:33:36,494 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:36,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:36,494 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:36,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:36,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:36,494 INFO L87 Difference]: Start difference. First operand 50619 states and 57931 transitions. Second operand 3 states. [2018-01-30 05:33:37,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:37,097 INFO L93 Difference]: Finished difference Result 82940 states and 94969 transitions. [2018-01-30 05:33:37,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:37,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 536 [2018-01-30 05:33:37,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:37,128 INFO L225 Difference]: With dead ends: 82940 [2018-01-30 05:33:37,129 INFO L226 Difference]: Without dead ends: 53550 [2018-01-30 05:33:37,151 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:37,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53550 states. [2018-01-30 05:33:37,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53550 to 53550. [2018-01-30 05:33:37,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53550 states. [2018-01-30 05:33:37,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53550 states to 53550 states and 61309 transitions. [2018-01-30 05:33:37,637 INFO L78 Accepts]: Start accepts. Automaton has 53550 states and 61309 transitions. Word has length 536 [2018-01-30 05:33:37,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:37,638 INFO L432 AbstractCegarLoop]: Abstraction has 53550 states and 61309 transitions. [2018-01-30 05:33:37,638 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:37,638 INFO L276 IsEmpty]: Start isEmpty. Operand 53550 states and 61309 transitions. [2018-01-30 05:33:37,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2018-01-30 05:33:37,666 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:37,667 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, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,667 INFO L371 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:37,667 INFO L82 PathProgramCache]: Analyzing trace with hash 187306611, now seen corresponding path program 1 times [2018-01-30 05:33:37,667 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:37,667 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:37,668 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:37,668 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:37,668 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:37,690 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:37,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1355 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2018-01-30 05:33:37,822 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:37,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:37,822 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:37,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:37,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:37,823 INFO L87 Difference]: Start difference. First operand 53550 states and 61309 transitions. Second operand 3 states. [2018-01-30 05:33:38,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:38,474 INFO L93 Difference]: Finished difference Result 88802 states and 101725 transitions. [2018-01-30 05:33:38,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:38,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 587 [2018-01-30 05:33:38,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:38,506 INFO L225 Difference]: With dead ends: 88802 [2018-01-30 05:33:38,506 INFO L226 Difference]: Without dead ends: 56481 [2018-01-30 05:33:38,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:33:38,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56481 states. [2018-01-30 05:33:38,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56481 to 56481. [2018-01-30 05:33:38,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56481 states. [2018-01-30 05:33:39,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56481 states to 56481 states and 64693 transitions. [2018-01-30 05:33:39,039 INFO L78 Accepts]: Start accepts. Automaton has 56481 states and 64693 transitions. Word has length 587 [2018-01-30 05:33:39,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:39,040 INFO L432 AbstractCegarLoop]: Abstraction has 56481 states and 64693 transitions. [2018-01-30 05:33:39,040 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:39,040 INFO L276 IsEmpty]: Start isEmpty. Operand 56481 states and 64693 transitions. [2018-01-30 05:33:39,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2018-01-30 05:33:39,071 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:39,071 INFO L350 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,071 INFO L371 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:39,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1004082674, now seen corresponding path program 1 times [2018-01-30 05:33:39,071 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:39,071 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:39,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:39,072 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:39,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:39,083 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:39,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 331 proven. 0 refuted. 0 times theorem prover too weak. 1350 trivial. 0 not checked. [2018-01-30 05:33:39,246 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:39,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:39,246 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:39,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:39,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:39,247 INFO L87 Difference]: Start difference. First operand 56481 states and 64693 transitions. Second operand 3 states. [2018-01-30 05:33:39,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:39,811 INFO L93 Difference]: Finished difference Result 94622 states and 108432 transitions. [2018-01-30 05:33:39,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:39,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 639 [2018-01-30 05:33:39,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:40,008 INFO L225 Difference]: With dead ends: 94622 [2018-01-30 05:33:40,008 INFO L226 Difference]: Without dead ends: 59370 [2018-01-30 05:33:40,020 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:40,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59370 states. [2018-01-30 05:33:40,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59370 to 59370. [2018-01-30 05:33:40,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59370 states. [2018-01-30 05:33:40,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59370 states to 59370 states and 67962 transitions. [2018-01-30 05:33:40,549 INFO L78 Accepts]: Start accepts. Automaton has 59370 states and 67962 transitions. Word has length 639 [2018-01-30 05:33:40,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:40,550 INFO L432 AbstractCegarLoop]: Abstraction has 59370 states and 67962 transitions. [2018-01-30 05:33:40,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:40,550 INFO L276 IsEmpty]: Start isEmpty. Operand 59370 states and 67962 transitions. [2018-01-30 05:33:40,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2018-01-30 05:33:40,586 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:40,586 INFO L350 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,586 INFO L371 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:40,586 INFO L82 PathProgramCache]: Analyzing trace with hash -119743561, now seen corresponding path program 1 times [2018-01-30 05:33:40,586 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:40,586 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:40,587 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:40,587 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:40,587 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:40,598 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:40,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2062 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 1681 trivial. 0 not checked. [2018-01-30 05:33:40,808 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:40,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:40,808 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:40,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:40,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:40,809 INFO L87 Difference]: Start difference. First operand 59370 states and 67962 transitions. Second operand 3 states. [2018-01-30 05:33:41,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:41,574 INFO L93 Difference]: Finished difference Result 100442 states and 115031 transitions. [2018-01-30 05:33:41,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:41,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 690 [2018-01-30 05:33:41,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:41,608 INFO L225 Difference]: With dead ends: 100442 [2018-01-30 05:33:41,608 INFO L226 Difference]: Without dead ends: 62301 [2018-01-30 05:33:41,630 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:41,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62301 states. [2018-01-30 05:33:42,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62301 to 62301. [2018-01-30 05:33:42,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62301 states. [2018-01-30 05:33:42,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62301 states to 62301 states and 71358 transitions. [2018-01-30 05:33:42,200 INFO L78 Accepts]: Start accepts. Automaton has 62301 states and 71358 transitions. Word has length 690 [2018-01-30 05:33:42,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:42,201 INFO L432 AbstractCegarLoop]: Abstraction has 62301 states and 71358 transitions. [2018-01-30 05:33:42,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:42,201 INFO L276 IsEmpty]: Start isEmpty. Operand 62301 states and 71358 transitions. [2018-01-30 05:33:42,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 743 [2018-01-30 05:33:42,233 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:42,234 INFO L350 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,234 INFO L371 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:42,234 INFO L82 PathProgramCache]: Analyzing trace with hash -643702057, now seen corresponding path program 1 times [2018-01-30 05:33:42,234 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:42,234 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:42,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:42,235 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:42,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:42,247 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:42,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2476 backedges. 419 proven. 0 refuted. 0 times theorem prover too weak. 2057 trivial. 0 not checked. [2018-01-30 05:33:42,479 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:42,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:42,480 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:42,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:42,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:42,480 INFO L87 Difference]: Start difference. First operand 62301 states and 71358 transitions. Second operand 3 states. [2018-01-30 05:33:43,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:43,319 INFO L93 Difference]: Finished difference Result 106304 states and 121823 transitions. [2018-01-30 05:33:43,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:43,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 742 [2018-01-30 05:33:43,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:43,361 INFO L225 Difference]: With dead ends: 106304 [2018-01-30 05:33:43,361 INFO L226 Difference]: Without dead ends: 65232 [2018-01-30 05:33:43,394 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:43,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65232 states. [2018-01-30 05:33:43,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65232 to 65232. [2018-01-30 05:33:43,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65232 states. [2018-01-30 05:33:44,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65232 states to 65232 states and 74760 transitions. [2018-01-30 05:33:44,015 INFO L78 Accepts]: Start accepts. Automaton has 65232 states and 74760 transitions. Word has length 742 [2018-01-30 05:33:44,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:44,016 INFO L432 AbstractCegarLoop]: Abstraction has 65232 states and 74760 transitions. [2018-01-30 05:33:44,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:44,016 INFO L276 IsEmpty]: Start isEmpty. Operand 65232 states and 74760 transitions. [2018-01-30 05:33:44,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2018-01-30 05:33:44,054 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:44,054 INFO L350 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,054 INFO L371 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:44,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1479385644, now seen corresponding path program 1 times [2018-01-30 05:33:44,055 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:44,055 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:44,055 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:44,055 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:44,055 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:44,067 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:45,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2931 backedges. 458 proven. 0 refuted. 0 times theorem prover too weak. 2473 trivial. 0 not checked. [2018-01-30 05:33:45,145 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:45,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:45,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:45,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:45,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:45,146 INFO L87 Difference]: Start difference. First operand 65232 states and 74760 transitions. Second operand 3 states. [2018-01-30 05:33:45,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:45,668 INFO L93 Difference]: Finished difference Result 112130 states and 128578 transitions. [2018-01-30 05:33:45,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:45,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 795 [2018-01-30 05:33:45,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:45,713 INFO L225 Difference]: With dead ends: 112130 [2018-01-30 05:33:45,713 INFO L226 Difference]: Without dead ends: 68127 [2018-01-30 05:33:45,748 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:45,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68127 states. [2018-01-30 05:33:46,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68127 to 68127. [2018-01-30 05:33:46,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68127 states. [2018-01-30 05:33:46,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68127 states to 68127 states and 78035 transitions. [2018-01-30 05:33:46,387 INFO L78 Accepts]: Start accepts. Automaton has 68127 states and 78035 transitions. Word has length 795 [2018-01-30 05:33:46,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:46,387 INFO L432 AbstractCegarLoop]: Abstraction has 68127 states and 78035 transitions. [2018-01-30 05:33:46,387 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:46,387 INFO L276 IsEmpty]: Start isEmpty. Operand 68127 states and 78035 transitions. [2018-01-30 05:33:46,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 848 [2018-01-30 05:33:46,426 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:46,426 INFO L350 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,426 INFO L371 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:46,427 INFO L82 PathProgramCache]: Analyzing trace with hash -457654029, now seen corresponding path program 1 times [2018-01-30 05:33:46,427 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:46,427 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:46,427 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:46,427 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:46,427 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:46,439 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:46,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3439 backedges. 508 proven. 0 refuted. 0 times theorem prover too weak. 2931 trivial. 0 not checked. [2018-01-30 05:33:46,854 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:46,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:46,855 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:46,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:46,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:46,855 INFO L87 Difference]: Start difference. First operand 68127 states and 78035 transitions. Second operand 3 states. [2018-01-30 05:33:47,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:47,488 INFO L93 Difference]: Finished difference Result 117956 states and 135177 transitions. [2018-01-30 05:33:47,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:47,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 847 [2018-01-30 05:33:47,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:47,535 INFO L225 Difference]: With dead ends: 117956 [2018-01-30 05:33:47,535 INFO L226 Difference]: Without dead ends: 71058 [2018-01-30 05:33:47,575 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:47,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71058 states. [2018-01-30 05:33:49,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71058 to 71058. [2018-01-30 05:33:49,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71058 states. [2018-01-30 05:33:49,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71058 states to 71058 states and 81449 transitions. [2018-01-30 05:33:49,089 INFO L78 Accepts]: Start accepts. Automaton has 71058 states and 81449 transitions. Word has length 847 [2018-01-30 05:33:49,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:49,090 INFO L432 AbstractCegarLoop]: Abstraction has 71058 states and 81449 transitions. [2018-01-30 05:33:49,090 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:49,090 INFO L276 IsEmpty]: Start isEmpty. Operand 71058 states and 81449 transitions. [2018-01-30 05:33:49,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 901 [2018-01-30 05:33:49,132 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:49,133 INFO L350 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,133 INFO L371 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:49,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1720012159, now seen corresponding path program 1 times [2018-01-30 05:33:49,133 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:49,133 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:49,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:49,134 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:49,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:49,146 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:49,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3982 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 3436 trivial. 0 not checked. [2018-01-30 05:33:49,539 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:49,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:49,540 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:49,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:49,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:49,540 INFO L87 Difference]: Start difference. First operand 71058 states and 81449 transitions. Second operand 3 states. [2018-01-30 05:33:50,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:50,145 INFO L93 Difference]: Finished difference Result 123818 states and 142005 transitions. [2018-01-30 05:33:50,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:50,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 900 [2018-01-30 05:33:50,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:50,193 INFO L225 Difference]: With dead ends: 123818 [2018-01-30 05:33:50,193 INFO L226 Difference]: Without dead ends: 73989 [2018-01-30 05:33:50,232 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:50,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73989 states. [2018-01-30 05:33:50,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73989 to 73989. [2018-01-30 05:33:50,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73989 states. [2018-01-30 05:33:50,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73989 states to 73989 states and 84869 transitions. [2018-01-30 05:33:50,939 INFO L78 Accepts]: Start accepts. Automaton has 73989 states and 84869 transitions. Word has length 900 [2018-01-30 05:33:50,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:50,939 INFO L432 AbstractCegarLoop]: Abstraction has 73989 states and 84869 transitions. [2018-01-30 05:33:50,939 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:50,939 INFO L276 IsEmpty]: Start isEmpty. Operand 73989 states and 84869 transitions. [2018-01-30 05:33:50,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 955 [2018-01-30 05:33:50,979 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:50,979 INFO L350 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,979 INFO L371 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:50,980 INFO L82 PathProgramCache]: Analyzing trace with hash 173912210, now seen corresponding path program 1 times [2018-01-30 05:33:50,980 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:50,980 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:50,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:50,980 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:50,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:50,993 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:52,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4567 backedges. 586 proven. 0 refuted. 0 times theorem prover too weak. 3981 trivial. 0 not checked. [2018-01-30 05:33:52,173 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:52,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:52,173 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:52,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:52,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:52,174 INFO L87 Difference]: Start difference. First operand 73989 states and 84869 transitions. Second operand 3 states. [2018-01-30 05:33:52,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:52,800 INFO L93 Difference]: Finished difference Result 129650 states and 148808 transitions. [2018-01-30 05:33:52,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:52,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 954 [2018-01-30 05:33:52,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:52,852 INFO L225 Difference]: With dead ends: 129650 [2018-01-30 05:33:52,852 INFO L226 Difference]: Without dead ends: 76890 [2018-01-30 05:33:52,976 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:52,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76890 states. [2018-01-30 05:33:53,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76890 to 76890. [2018-01-30 05:33:53,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76890 states. [2018-01-30 05:33:53,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76890 states to 76890 states and 88150 transitions. [2018-01-30 05:33:53,679 INFO L78 Accepts]: Start accepts. Automaton has 76890 states and 88150 transitions. Word has length 954 [2018-01-30 05:33:53,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:53,680 INFO L432 AbstractCegarLoop]: Abstraction has 76890 states and 88150 transitions. [2018-01-30 05:33:53,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:53,680 INFO L276 IsEmpty]: Start isEmpty. Operand 76890 states and 88150 transitions. [2018-01-30 05:33:53,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1008 [2018-01-30 05:33:53,725 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:53,725 INFO L350 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 12, 12, 11, 11, 6, 6, 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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,725 INFO L371 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:53,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1568267588, now seen corresponding path program 1 times [2018-01-30 05:33:53,726 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:53,726 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:53,726 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:53,726 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:53,726 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:53,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:33:54,204 INFO L134 CoverageAnalysis]: Checked inductivity of 5203 backedges. 636 proven. 0 refuted. 0 times theorem prover too weak. 4567 trivial. 0 not checked. [2018-01-30 05:33:54,204 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:54,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:54,205 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:54,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:54,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:54,205 INFO L87 Difference]: Start difference. First operand 76890 states and 88150 transitions. Second operand 3 states. [2018-01-30 05:33:54,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:54,886 INFO L93 Difference]: Finished difference Result 135482 states and 155407 transitions. [2018-01-30 05:33:54,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:54,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1007 [2018-01-30 05:33:54,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:54,938 INFO L225 Difference]: With dead ends: 135482 [2018-01-30 05:33:54,938 INFO L226 Difference]: Without dead ends: 79821 [2018-01-30 05:33:54,984 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:55,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79821 states. [2018-01-30 05:33:55,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79821 to 79821. [2018-01-30 05:33:55,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79821 states. [2018-01-30 05:33:55,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79821 states to 79821 states and 91582 transitions. [2018-01-30 05:33:55,979 INFO L78 Accepts]: Start accepts. Automaton has 79821 states and 91582 transitions. Word has length 1007 [2018-01-30 05:33:55,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:55,980 INFO L432 AbstractCegarLoop]: Abstraction has 79821 states and 91582 transitions. [2018-01-30 05:33:55,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:55,980 INFO L276 IsEmpty]: Start isEmpty. Operand 79821 states and 91582 transitions. [2018-01-30 05:33:56,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1062 [2018-01-30 05:33:56,024 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:56,024 INFO L350 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 17, 17, 16, 16, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,024 INFO L371 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:56,025 INFO L82 PathProgramCache]: Analyzing trace with hash -192315355, now seen corresponding path program 1 times [2018-01-30 05:33:56,025 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:56,025 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:56,025 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:56,025 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:56,025 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:56,039 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:57,395 INFO L134 CoverageAnalysis]: Checked inductivity of 5876 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 5202 trivial. 0 not checked. [2018-01-30 05:33:57,395 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:57,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:33:57,396 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:33:57,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:33:57,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:33:57,396 INFO L87 Difference]: Start difference. First operand 79821 states and 91582 transitions. Second operand 3 states. [2018-01-30 05:33:57,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:33:57,948 INFO L93 Difference]: Finished difference Result 82754 states and 95027 transitions. [2018-01-30 05:33:57,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:33:57,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1061 [2018-01-30 05:33:57,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:33:58,001 INFO L225 Difference]: With dead ends: 82754 [2018-01-30 05:33:58,001 INFO L226 Difference]: Without dead ends: 82752 [2018-01-30 05:33:58,018 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:58,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82752 states. [2018-01-30 05:33:58,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82752 to 82752. [2018-01-30 05:33:58,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82752 states. [2018-01-30 05:33:58,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82752 states to 82752 states and 95020 transitions. [2018-01-30 05:33:58,932 INFO L78 Accepts]: Start accepts. Automaton has 82752 states and 95020 transitions. Word has length 1061 [2018-01-30 05:33:58,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:33:58,932 INFO L432 AbstractCegarLoop]: Abstraction has 82752 states and 95020 transitions. [2018-01-30 05:33:58,932 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:33:58,932 INFO L276 IsEmpty]: Start isEmpty. Operand 82752 states and 95020 transitions. [2018-01-30 05:33:58,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1117 [2018-01-30 05:33:58,979 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:33:58,979 INFO L350 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 13, 13, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,979 INFO L371 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:33:58,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1418361962, now seen corresponding path program 1 times [2018-01-30 05:33:58,980 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:33:58,980 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:33:58,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:58,980 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:33:58,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:33:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:33:58,995 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:59,711 INFO L134 CoverageAnalysis]: Checked inductivity of 6592 backedges. 335 proven. 0 refuted. 0 times theorem prover too weak. 6257 trivial. 0 not checked. [2018-01-30 05:33:59,711 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:33:59,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 05:33:59,712 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 05:33:59,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 05:33:59,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:33:59,712 INFO L87 Difference]: Start difference. First operand 82752 states and 95020 transitions. Second operand 5 states. [2018-01-30 05:34:00,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:34:00,474 INFO L93 Difference]: Finished difference Result 116352 states and 133298 transitions. [2018-01-30 05:34:00,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 05:34:00,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1116 [2018-01-30 05:34:00,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:34:00,535 INFO L225 Difference]: With dead ends: 116352 [2018-01-30 05:34:00,535 INFO L226 Difference]: Without dead ends: 92666 [2018-01-30 05:34:00,705 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:34:00,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92666 states. [2018-01-30 05:34:01,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92666 to 83196. [2018-01-30 05:34:01,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83196 states. [2018-01-30 05:34:01,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83196 states to 83196 states and 95508 transitions. [2018-01-30 05:34:01,567 INFO L78 Accepts]: Start accepts. Automaton has 83196 states and 95508 transitions. Word has length 1116 [2018-01-30 05:34:01,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:34:01,567 INFO L432 AbstractCegarLoop]: Abstraction has 83196 states and 95508 transitions. [2018-01-30 05:34:01,567 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 05:34:01,567 INFO L276 IsEmpty]: Start isEmpty. Operand 83196 states and 95508 transitions. [2018-01-30 05:34:01,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1118 [2018-01-30 05:34:01,617 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:34:01,617 INFO L350 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 13, 13, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:01,617 INFO L371 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:34:01,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1736089195, now seen corresponding path program 1 times [2018-01-30 05:34:01,618 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:34:01,618 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:34:01,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:34:01,618 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:34:01,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:34:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:34:01,637 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:34:02,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 6352 trivial. 0 not checked. [2018-01-30 05:34:02,317 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:34:02,317 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 05:34:02,317 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 05:34:02,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 05:34:02,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 05:34:02,318 INFO L87 Difference]: Start difference. First operand 83196 states and 95508 transitions. Second operand 6 states. [2018-01-30 05:34:03,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:34:03,805 INFO L93 Difference]: Finished difference Result 175391 states and 204902 transitions. [2018-01-30 05:34:03,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 05:34:03,806 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1117 [2018-01-30 05:34:03,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:34:03,869 INFO L225 Difference]: With dead ends: 175391 [2018-01-30 05:34:03,869 INFO L226 Difference]: Without dead ends: 90741 [2018-01-30 05:34:03,933 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-30 05:34:03,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90741 states. [2018-01-30 05:34:05,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90741 to 87125. [2018-01-30 05:34:05,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87125 states. [2018-01-30 05:34:05,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87125 states to 87125 states and 99943 transitions. [2018-01-30 05:34:05,076 INFO L78 Accepts]: Start accepts. Automaton has 87125 states and 99943 transitions. Word has length 1117 [2018-01-30 05:34:05,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:34:05,076 INFO L432 AbstractCegarLoop]: Abstraction has 87125 states and 99943 transitions. [2018-01-30 05:34:05,076 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 05:34:05,076 INFO L276 IsEmpty]: Start isEmpty. Operand 87125 states and 99943 transitions. [2018-01-30 05:34:05,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1120 [2018-01-30 05:34:05,124 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:34:05,124 INFO L350 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 14, 13, 13, 8, 8, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:05,124 INFO L371 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:34:05,125 INFO L82 PathProgramCache]: Analyzing trace with hash 219620833, now seen corresponding path program 2 times [2018-01-30 05:34:05,125 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:34:05,125 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:34:05,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:34:05,125 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:34:05,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:34:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:34:05,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:34:05,963 INFO L134 CoverageAnalysis]: Checked inductivity of 6607 backedges. 741 proven. 0 refuted. 0 times theorem prover too weak. 5866 trivial. 0 not checked. [2018-01-30 05:34:05,963 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:34:05,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 05:34:05,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 05:34:05,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 05:34:05,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:34:05,964 INFO L87 Difference]: Start difference. First operand 87125 states and 99943 transitions. Second operand 5 states. [2018-01-30 05:34:07,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:34:07,654 INFO L93 Difference]: Finished difference Result 109387 states and 125003 transitions. [2018-01-30 05:34:07,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 05:34:07,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1119 [2018-01-30 05:34:07,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:34:07,707 INFO L225 Difference]: With dead ends: 109387 [2018-01-30 05:34:07,707 INFO L226 Difference]: Without dead ends: 96233 [2018-01-30 05:34:07,719 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:34:07,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96233 states. [2018-01-30 05:34:08,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96233 to 87435. [2018-01-30 05:34:08,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87435 states. [2018-01-30 05:34:08,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87435 states to 87435 states and 100309 transitions. [2018-01-30 05:34:08,712 INFO L78 Accepts]: Start accepts. Automaton has 87435 states and 100309 transitions. Word has length 1119 [2018-01-30 05:34:08,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:34:08,713 INFO L432 AbstractCegarLoop]: Abstraction has 87435 states and 100309 transitions. [2018-01-30 05:34:08,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 05:34:08,713 INFO L276 IsEmpty]: Start isEmpty. Operand 87435 states and 100309 transitions. [2018-01-30 05:34:08,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1121 [2018-01-30 05:34:08,759 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:34:08,759 INFO L350 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 14, 13, 13, 8, 8, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:08,759 INFO L371 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:34:08,760 INFO L82 PathProgramCache]: Analyzing trace with hash -264128820, now seen corresponding path program 1 times [2018-01-30 05:34:08,760 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:34:08,760 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:34:08,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:34:08,760 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 05:34:08,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:34:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:34:08,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:34:09,567 INFO L134 CoverageAnalysis]: Checked inductivity of 6626 backedges. 673 proven. 0 refuted. 0 times theorem prover too weak. 5953 trivial. 0 not checked. [2018-01-30 05:34:09,567 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:34:09,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 05:34:09,567 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 05:34:09,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 05:34:09,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 05:34:09,568 INFO L87 Difference]: Start difference. First operand 87435 states and 100309 transitions. Second operand 4 states. [2018-01-30 05:34:10,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:34:10,895 INFO L93 Difference]: Finished difference Result 197067 states and 231389 transitions. [2018-01-30 05:34:10,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 05:34:10,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1120 [2018-01-30 05:34:10,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:34:10,980 INFO L225 Difference]: With dead ends: 197067 [2018-01-30 05:34:10,980 INFO L226 Difference]: Without dead ends: 121153 [2018-01-30 05:34:11,048 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:34:11,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121153 states. [2018-01-30 05:34:12,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121153 to 90721. [2018-01-30 05:34:12,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90721 states. [2018-01-30 05:34:12,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90721 states to 90721 states and 104901 transitions. [2018-01-30 05:34:12,351 INFO L78 Accepts]: Start accepts. Automaton has 90721 states and 104901 transitions. Word has length 1120 [2018-01-30 05:34:12,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:34:12,352 INFO L432 AbstractCegarLoop]: Abstraction has 90721 states and 104901 transitions. [2018-01-30 05:34:12,352 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 05:34:12,352 INFO L276 IsEmpty]: Start isEmpty. Operand 90721 states and 104901 transitions. [2018-01-30 05:34:12,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1167 [2018-01-30 05:34:12,401 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:34:12,402 INFO L350 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 24, 24, 23, 23, 22, 22, 21, 21, 21, 21, 16, 15, 15, 14, 14, 13, 13, 8, 8, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:12,402 INFO L371 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:34:12,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1419900997, now seen corresponding path program 1 times [2018-01-30 05:34:12,402 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:34:12,402 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:34:12,402 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:34:12,402 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:34:12,403 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:34:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:34:12,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:34:14,134 INFO L134 CoverageAnalysis]: Checked inductivity of 8712 backedges. 5074 proven. 27 refuted. 0 times theorem prover too weak. 3611 trivial. 0 not checked. [2018-01-30 05:34:14,134 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 05:34:14,134 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:34:14,139 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:34:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:34:14,270 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 05:34:14,694 INFO L134 CoverageAnalysis]: Checked inductivity of 8712 backedges. 5074 proven. 27 refuted. 0 times theorem prover too weak. 3611 trivial. 0 not checked. [2018-01-30 05:34:14,713 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 05:34:14,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-01-30 05:34:14,714 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 05:34:14,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 05:34:14,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 05:34:14,715 INFO L87 Difference]: Start difference. First operand 90721 states and 104901 transitions. Second operand 4 states. [2018-01-30 05:34:17,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:34:17,309 INFO L93 Difference]: Finished difference Result 148021 states and 172777 transitions. [2018-01-30 05:34:17,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 05:34:17,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1166 [2018-01-30 05:34:17,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:34:17,394 INFO L225 Difference]: With dead ends: 148021 [2018-01-30 05:34:17,394 INFO L226 Difference]: Without dead ends: 42665 [2018-01-30 05:34:17,497 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 1171 GetRequests, 1168 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:34:17,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42665 states. [2018-01-30 05:34:18,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42665 to 40896. [2018-01-30 05:34:18,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40896 states. [2018-01-30 05:34:18,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40896 states to 40896 states and 47886 transitions. [2018-01-30 05:34:18,272 INFO L78 Accepts]: Start accepts. Automaton has 40896 states and 47886 transitions. Word has length 1166 [2018-01-30 05:34:18,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:34:18,272 INFO L432 AbstractCegarLoop]: Abstraction has 40896 states and 47886 transitions. [2018-01-30 05:34:18,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 05:34:18,272 INFO L276 IsEmpty]: Start isEmpty. Operand 40896 states and 47886 transitions. [2018-01-30 05:34:18,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1281 [2018-01-30 05:34:18,315 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:34:18,315 INFO L350 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 20, 20, 19, 19, 18, 18, 17, 17, 17, 17, 16, 15, 15, 15, 14, 14, 13, 13, 10, 10, 10, 10, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:18,315 INFO L371 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:34:18,316 INFO L82 PathProgramCache]: Analyzing trace with hash -514660778, now seen corresponding path program 1 times [2018-01-30 05:34:18,316 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:34:18,316 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:34:18,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:34:18,317 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:34:18,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:34:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:34:18,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:34:19,058 INFO L134 CoverageAnalysis]: Checked inductivity of 9315 backedges. 4517 proven. 0 refuted. 0 times theorem prover too weak. 4798 trivial. 0 not checked. [2018-01-30 05:34:19,058 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:34:19,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:34:19,059 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:34:19,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:34:19,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:34:19,059 INFO L87 Difference]: Start difference. First operand 40896 states and 47886 transitions. Second operand 3 states. [2018-01-30 05:34:19,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:34:19,552 INFO L93 Difference]: Finished difference Result 69551 states and 81369 transitions. [2018-01-30 05:34:19,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:34:19,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1280 [2018-01-30 05:34:19,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:34:19,605 INFO L225 Difference]: With dead ends: 69551 [2018-01-30 05:34:19,605 INFO L226 Difference]: Without dead ends: 42104 [2018-01-30 05:34:19,626 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:34:19,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42104 states. [2018-01-30 05:34:20,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42104 to 41969. [2018-01-30 05:34:20,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41969 states. [2018-01-30 05:34:20,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41969 states to 41969 states and 49060 transitions. [2018-01-30 05:34:20,293 INFO L78 Accepts]: Start accepts. Automaton has 41969 states and 49060 transitions. Word has length 1280 [2018-01-30 05:34:20,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:34:20,294 INFO L432 AbstractCegarLoop]: Abstraction has 41969 states and 49060 transitions. [2018-01-30 05:34:20,294 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:34:20,294 INFO L276 IsEmpty]: Start isEmpty. Operand 41969 states and 49060 transitions. [2018-01-30 05:34:20,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1281 [2018-01-30 05:34:20,322 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:34:20,323 INFO L350 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 20, 20, 19, 19, 18, 18, 17, 17, 17, 17, 16, 15, 15, 15, 14, 14, 13, 13, 10, 10, 10, 10, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:20,323 INFO L371 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 05:34:20,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1350787638, now seen corresponding path program 1 times [2018-01-30 05:34:20,323 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:34:20,323 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:34:20,324 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:34:20,324 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:34:20,324 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:34:20,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:34:20,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-01-30 05:34:21,267 INFO L134 CoverageAnalysis]: Checked inductivity of 9319 backedges. 1491 proven. 0 refuted. 0 times theorem prover too weak. 7828 trivial. 0 not checked. [2018-01-30 05:34:21,267 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:34:21,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 05:34:21,268 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 05:34:21,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 05:34:21,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 05:34:21,268 INFO L87 Difference]: Start difference. First operand 41969 states and 49060 transitions. Second operand 5 states. [2018-01-30 05:34:21,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-30 05:34:21,269 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 05:34:21,273 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 05:34:21,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 05:34:21 BasicIcfg [2018-01-30 05:34:21,273 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 05:34:21,273 INFO L168 Benchmark]: Toolchain (without parser) took 62197.58 ms. Allocated memory was 151.0 MB in the beginning and 2.5 GB in the end (delta: 2.4 GB). Free memory was 115.5 MB in the beginning and 693.1 MB in the end (delta: -577.7 MB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. [2018-01-30 05:34:21,274 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 151.0 MB. Free memory is still 120.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 05:34:21,274 INFO L168 Benchmark]: CACSL2BoogieTranslator took 210.13 ms. Allocated memory is still 151.0 MB. Free memory was 115.3 MB in the beginning and 100.6 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. [2018-01-30 05:34:21,274 INFO L168 Benchmark]: Boogie Preprocessor took 24.57 ms. Allocated memory is still 151.0 MB. Free memory was 100.6 MB in the beginning and 98.6 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:34:21,275 INFO L168 Benchmark]: RCFGBuilder took 1061.22 ms. Allocated memory is still 151.0 MB. Free memory was 98.3 MB in the beginning and 84.0 MB in the end (delta: 14.4 MB). Peak memory consumption was 37.5 MB. Max. memory is 5.3 GB. [2018-01-30 05:34:21,275 INFO L168 Benchmark]: IcfgTransformer took 20.38 ms. Allocated memory is still 151.0 MB. Free memory was 84.0 MB in the beginning and 80.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 5.3 GB. [2018-01-30 05:34:21,277 INFO L168 Benchmark]: TraceAbstraction took 60878.64 ms. Allocated memory was 151.0 MB in the beginning and 2.5 GB in the end (delta: 2.4 GB). Free memory was 80.6 MB in the beginning and 693.1 MB in the end (delta: -612.5 MB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. [2018-01-30 05:34:21,278 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.12 ms. Allocated memory is still 151.0 MB. Free memory is still 120.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 210.13 ms. Allocated memory is still 151.0 MB. Free memory was 115.3 MB in the beginning and 100.6 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.57 ms. Allocated memory is still 151.0 MB. Free memory was 100.6 MB in the beginning and 98.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 1061.22 ms. Allocated memory is still 151.0 MB. Free memory was 98.3 MB in the beginning and 84.0 MB in the end (delta: 14.4 MB). Peak memory consumption was 37.5 MB. Max. memory is 5.3 GB. * IcfgTransformer took 20.38 ms. Allocated memory is still 151.0 MB. Free memory was 84.0 MB in the beginning and 80.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 60878.64 ms. Allocated memory was 151.0 MB in the beginning and 2.5 GB in the end (delta: 2.4 GB). Free memory was 80.6 MB in the beginning and 693.1 MB in the end (delta: -612.5 MB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 668]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 668). Cancelled while BasicCegarLoop was constructing difference of abstraction (41969states) and interpolant automaton (currently 2 states, 5 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 444 locations, 1 error locations. TIMEOUT Result, 60.8s OverallTime, 45 OverallIterations, 26 TraceHistogramMax, 25.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 25116 SDtfs, 11183 SDslu, 20282 SDs, 0 SdLazy, 4067 SolverSat, 996 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1325 GetRequests, 1260 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90721occurred in iteration=42, 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: 17.5s AutomataMinimizationTime, 44 MinimizatonAttempts, 63405 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 27044 NumberOfCodeBlocks, 27044 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 26998 ConstructedInterpolants, 0 QuantifiedInterpolants, 25807289 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1482 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 46 InterpolantComputations, 44 PerfectInterpolantSequences, 105569/105623 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_6_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-34-21-283.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_6_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-34-21-283.csv Completed graceful shutdown