java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 04:09:10,419 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 04:09:10,422 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 04:09:10,434 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 04:09:10,434 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 04:09:10,435 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 04:09:10,437 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 04:09:10,439 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 04:09:10,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 04:09:10,441 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 04:09:10,442 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 04:09:10,444 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 04:09:10,444 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 04:09:10,445 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 04:09:10,446 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 04:09:10,447 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 04:09:10,448 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 04:09:10,449 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 04:09:10,451 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 04:09:10,453 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 04:09:10,455 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 04:09:10,456 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 04:09:10,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 04:09:10,458 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 04:09:10,461 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 04:09:10,461 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 04:09:10,461 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 04:09:10,462 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 04:09:10,463 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 04:09:10,464 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 04:09:10,464 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 04:09:10,465 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 04:09:10,466 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 04:09:10,467 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 04:09:10,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 04:09:10,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 04:09:10,469 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 04:09:10,469 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 04:09:10,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 04:09:10,470 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 04:09:10,471 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 04:09:10,472 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 04:09:10,501 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 04:09:10,502 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 04:09:10,502 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 04:09:10,502 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 04:09:10,503 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 04:09:10,503 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 04:09:10,503 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 04:09:10,504 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 04:09:10,504 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 04:09:10,504 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 04:09:10,505 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 04:09:10,505 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 04:09:10,505 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 04:09:10,506 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 04:09:10,506 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 04:09:10,506 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 04:09:10,506 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 04:09:10,506 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 04:09:10,507 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 04:09:10,507 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 04:09:10,507 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 04:09:10,507 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 04:09:10,507 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 04:09:10,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 04:09:10,508 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 04:09:10,508 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 04:09:10,508 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 04:09:10,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 04:09:10,509 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 04:09:10,509 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 04:09:10,538 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 04:09:10,550 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 04:09:10,554 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 04:09:10,555 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 04:09:10,556 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 04:09:10,556 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_2.cil-1.c [2019-10-03 04:09:10,621 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65086b036/dd76ba00d37b4c879f6ba73b6ede4e7f/FLAG1dfd8425c [2019-10-03 04:09:11,124 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 04:09:11,125 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_2.cil-1.c [2019-10-03 04:09:11,136 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65086b036/dd76ba00d37b4c879f6ba73b6ede4e7f/FLAG1dfd8425c [2019-10-03 04:09:11,467 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65086b036/dd76ba00d37b4c879f6ba73b6ede4e7f [2019-10-03 04:09:11,476 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 04:09:11,478 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 04:09:11,479 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 04:09:11,479 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 04:09:11,483 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 04:09:11,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 04:09:11" (1/1) ... [2019-10-03 04:09:11,487 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37dec9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:11, skipping insertion in model container [2019-10-03 04:09:11,487 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 04:09:11" (1/1) ... [2019-10-03 04:09:11,494 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 04:09:11,556 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 04:09:11,942 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 04:09:11,947 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 04:09:12,013 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 04:09:12,027 INFO L192 MainTranslator]: Completed translation [2019-10-03 04:09:12,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:12 WrapperNode [2019-10-03 04:09:12,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 04:09:12,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 04:09:12,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 04:09:12,028 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 04:09:12,041 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:12" (1/1) ... [2019-10-03 04:09:12,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:12" (1/1) ... [2019-10-03 04:09:12,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:12" (1/1) ... [2019-10-03 04:09:12,051 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:12" (1/1) ... [2019-10-03 04:09:12,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:12" (1/1) ... [2019-10-03 04:09:12,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:12" (1/1) ... [2019-10-03 04:09:12,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:12" (1/1) ... [2019-10-03 04:09:12,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 04:09:12,090 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 04:09:12,090 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 04:09:12,090 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 04:09:12,091 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:12" (1/1) ... No working directory specified, using /storage/repos/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 [2019-10-03 04:09:12,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 04:09:12,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 04:09:12,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-03 04:09:12,152 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 04:09:12,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 04:09:12,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-03 04:09:12,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 04:09:12,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-03 04:09:12,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-03 04:09:12,153 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-03 04:09:12,153 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 04:09:12,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 04:09:12,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 04:09:12,398 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 04:09:12,959 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-03 04:09:12,960 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-03 04:09:12,963 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 04:09:12,963 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-03 04:09:12,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 04:09:12 BoogieIcfgContainer [2019-10-03 04:09:12,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 04:09:12,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 04:09:12,967 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 04:09:12,971 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 04:09:12,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 04:09:11" (1/3) ... [2019-10-03 04:09:12,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@487a2271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 04:09:12, skipping insertion in model container [2019-10-03 04:09:12,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:12" (2/3) ... [2019-10-03 04:09:12,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@487a2271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 04:09:12, skipping insertion in model container [2019-10-03 04:09:12,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 04:09:12" (3/3) ... [2019-10-03 04:09:12,977 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_2.cil-1.c [2019-10-03 04:09:12,988 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 04:09:13,000 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 04:09:13,018 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 04:09:13,044 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 04:09:13,044 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 04:09:13,044 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 04:09:13,044 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 04:09:13,044 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 04:09:13,044 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 04:09:13,045 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 04:09:13,045 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 04:09:13,064 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-10-03 04:09:13,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-03 04:09:13,078 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:13,079 INFO L411 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] [2019-10-03 04:09:13,081 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:13,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:13,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1127072202, now seen corresponding path program 1 times [2019-10-03 04:09:13,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:13,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:13,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:13,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:13,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:13,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:13,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:13,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:13,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:13,433 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:13,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:13,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:13,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:13,469 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 5 states. [2019-10-03 04:09:13,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:13,927 INFO L93 Difference]: Finished difference Result 201 states and 337 transitions. [2019-10-03 04:09:13,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:13,929 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-10-03 04:09:13,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:13,942 INFO L225 Difference]: With dead ends: 201 [2019-10-03 04:09:13,943 INFO L226 Difference]: Without dead ends: 180 [2019-10-03 04:09:13,944 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:13,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-03 04:09:13,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 175. [2019-10-03 04:09:13,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-03 04:09:13,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 280 transitions. [2019-10-03 04:09:13,999 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 280 transitions. Word has length 49 [2019-10-03 04:09:14,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:14,000 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 280 transitions. [2019-10-03 04:09:14,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:14,000 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 280 transitions. [2019-10-03 04:09:14,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-03 04:09:14,003 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:14,004 INFO L411 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] [2019-10-03 04:09:14,004 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:14,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:14,007 INFO L82 PathProgramCache]: Analyzing trace with hash 572375021, now seen corresponding path program 1 times [2019-10-03 04:09:14,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:14,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:14,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:14,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:14,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:14,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:14,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:14,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:14,160 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:14,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:14,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:14,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:14,163 INFO L87 Difference]: Start difference. First operand 175 states and 280 transitions. Second operand 5 states. [2019-10-03 04:09:14,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:14,473 INFO L93 Difference]: Finished difference Result 223 states and 365 transitions. [2019-10-03 04:09:14,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:14,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-10-03 04:09:14,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:14,477 INFO L225 Difference]: With dead ends: 223 [2019-10-03 04:09:14,477 INFO L226 Difference]: Without dead ends: 221 [2019-10-03 04:09:14,478 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:14,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-10-03 04:09:14,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 216. [2019-10-03 04:09:14,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-10-03 04:09:14,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 357 transitions. [2019-10-03 04:09:14,500 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 357 transitions. Word has length 50 [2019-10-03 04:09:14,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:14,500 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 357 transitions. [2019-10-03 04:09:14,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:14,501 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 357 transitions. [2019-10-03 04:09:14,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-03 04:09:14,509 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:14,509 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:14,511 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:14,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:14,512 INFO L82 PathProgramCache]: Analyzing trace with hash -2018770907, now seen corresponding path program 1 times [2019-10-03 04:09:14,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:14,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:14,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:14,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:14,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:14,652 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:14,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:14,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:14,653 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:14,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:14,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:14,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:14,654 INFO L87 Difference]: Start difference. First operand 216 states and 357 transitions. Second operand 5 states. [2019-10-03 04:09:14,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:14,938 INFO L93 Difference]: Finished difference Result 247 states and 413 transitions. [2019-10-03 04:09:14,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:14,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-03 04:09:14,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:14,941 INFO L225 Difference]: With dead ends: 247 [2019-10-03 04:09:14,942 INFO L226 Difference]: Without dead ends: 247 [2019-10-03 04:09:14,942 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:14,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-10-03 04:09:14,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-10-03 04:09:14,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-10-03 04:09:14,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 413 transitions. [2019-10-03 04:09:14,956 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 413 transitions. Word has length 77 [2019-10-03 04:09:14,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:14,957 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 413 transitions. [2019-10-03 04:09:14,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:14,957 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 413 transitions. [2019-10-03 04:09:14,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-03 04:09:14,961 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:14,962 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:14,962 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:14,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:14,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1670289669, now seen corresponding path program 1 times [2019-10-03 04:09:14,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:14,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:14,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:14,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:14,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:15,056 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 04:09:15,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:15,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:15,057 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:15,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:15,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:15,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:15,060 INFO L87 Difference]: Start difference. First operand 247 states and 413 transitions. Second operand 5 states. [2019-10-03 04:09:15,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:15,267 INFO L93 Difference]: Finished difference Result 264 states and 438 transitions. [2019-10-03 04:09:15,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:15,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-03 04:09:15,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:15,272 INFO L225 Difference]: With dead ends: 264 [2019-10-03 04:09:15,272 INFO L226 Difference]: Without dead ends: 264 [2019-10-03 04:09:15,273 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:15,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-10-03 04:09:15,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-10-03 04:09:15,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-10-03 04:09:15,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 436 transitions. [2019-10-03 04:09:15,296 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 436 transitions. Word has length 89 [2019-10-03 04:09:15,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:15,297 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 436 transitions. [2019-10-03 04:09:15,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:15,297 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 436 transitions. [2019-10-03 04:09:15,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-03 04:09:15,310 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:15,310 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:15,311 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:15,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:15,311 INFO L82 PathProgramCache]: Analyzing trace with hash -288738650, now seen corresponding path program 1 times [2019-10-03 04:09:15,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:15,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:15,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:15,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:15,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:15,437 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:15,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:15,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:15,438 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:15,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:15,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:15,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:15,440 INFO L87 Difference]: Start difference. First operand 262 states and 436 transitions. Second operand 5 states. [2019-10-03 04:09:15,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:15,686 INFO L93 Difference]: Finished difference Result 308 states and 515 transitions. [2019-10-03 04:09:15,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:15,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-03 04:09:15,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:15,689 INFO L225 Difference]: With dead ends: 308 [2019-10-03 04:09:15,689 INFO L226 Difference]: Without dead ends: 308 [2019-10-03 04:09:15,690 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:15,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-10-03 04:09:15,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 304. [2019-10-03 04:09:15,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-03 04:09:15,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 510 transitions. [2019-10-03 04:09:15,701 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 510 transitions. Word has length 89 [2019-10-03 04:09:15,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:15,702 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 510 transitions. [2019-10-03 04:09:15,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:15,702 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 510 transitions. [2019-10-03 04:09:15,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-03 04:09:15,704 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:15,704 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:15,704 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:15,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:15,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1782320931, now seen corresponding path program 1 times [2019-10-03 04:09:15,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:15,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:15,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:15,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:15,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:15,789 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 04:09:15,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:15,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:15,790 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:15,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:15,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:15,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:15,792 INFO L87 Difference]: Start difference. First operand 304 states and 510 transitions. Second operand 5 states. [2019-10-03 04:09:16,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:16,002 INFO L93 Difference]: Finished difference Result 306 states and 508 transitions. [2019-10-03 04:09:16,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:16,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-03 04:09:16,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:16,006 INFO L225 Difference]: With dead ends: 306 [2019-10-03 04:09:16,007 INFO L226 Difference]: Without dead ends: 306 [2019-10-03 04:09:16,007 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:16,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-03 04:09:16,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-10-03 04:09:16,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-03 04:09:16,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 506 transitions. [2019-10-03 04:09:16,016 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 506 transitions. Word has length 90 [2019-10-03 04:09:16,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:16,016 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 506 transitions. [2019-10-03 04:09:16,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:16,016 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 506 transitions. [2019-10-03 04:09:16,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-03 04:09:16,017 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:16,018 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:16,018 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:16,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:16,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1133000297, now seen corresponding path program 1 times [2019-10-03 04:09:16,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:16,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:16,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:16,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:16,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:16,077 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:16,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:16,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:16,078 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:16,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:16,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:16,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:16,079 INFO L87 Difference]: Start difference. First operand 304 states and 506 transitions. Second operand 5 states. [2019-10-03 04:09:16,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:16,335 INFO L93 Difference]: Finished difference Result 308 states and 509 transitions. [2019-10-03 04:09:16,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:16,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-03 04:09:16,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:16,338 INFO L225 Difference]: With dead ends: 308 [2019-10-03 04:09:16,338 INFO L226 Difference]: Without dead ends: 306 [2019-10-03 04:09:16,338 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:16,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-03 04:09:16,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 302. [2019-10-03 04:09:16,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-10-03 04:09:16,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 501 transitions. [2019-10-03 04:09:16,347 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 501 transitions. Word has length 90 [2019-10-03 04:09:16,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:16,347 INFO L475 AbstractCegarLoop]: Abstraction has 302 states and 501 transitions. [2019-10-03 04:09:16,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:16,347 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 501 transitions. [2019-10-03 04:09:16,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-03 04:09:16,349 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:16,349 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:16,349 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:16,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:16,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1158896476, now seen corresponding path program 1 times [2019-10-03 04:09:16,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:16,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:16,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:16,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:16,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-03 04:09:16,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:16,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:16,438 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:16,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:16,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:16,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:16,439 INFO L87 Difference]: Start difference. First operand 302 states and 501 transitions. Second operand 5 states. [2019-10-03 04:09:16,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:16,634 INFO L93 Difference]: Finished difference Result 311 states and 507 transitions. [2019-10-03 04:09:16,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:16,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-03 04:09:16,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:16,637 INFO L225 Difference]: With dead ends: 311 [2019-10-03 04:09:16,637 INFO L226 Difference]: Without dead ends: 311 [2019-10-03 04:09:16,638 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:16,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-10-03 04:09:16,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2019-10-03 04:09:16,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-10-03 04:09:16,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 507 transitions. [2019-10-03 04:09:16,646 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 507 transitions. Word has length 102 [2019-10-03 04:09:16,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:16,647 INFO L475 AbstractCegarLoop]: Abstraction has 311 states and 507 transitions. [2019-10-03 04:09:16,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:16,647 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 507 transitions. [2019-10-03 04:09:16,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-03 04:09:16,649 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:16,649 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:16,649 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:16,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:16,650 INFO L82 PathProgramCache]: Analyzing trace with hash 344707902, now seen corresponding path program 1 times [2019-10-03 04:09:16,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:16,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:16,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:16,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:16,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:16,739 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 04:09:16,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:16,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:16,740 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:16,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:16,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:16,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:16,741 INFO L87 Difference]: Start difference. First operand 311 states and 507 transitions. Second operand 5 states. [2019-10-03 04:09:17,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:17,004 INFO L93 Difference]: Finished difference Result 342 states and 556 transitions. [2019-10-03 04:09:17,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:17,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-10-03 04:09:17,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:17,007 INFO L225 Difference]: With dead ends: 342 [2019-10-03 04:09:17,007 INFO L226 Difference]: Without dead ends: 342 [2019-10-03 04:09:17,008 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:17,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-10-03 04:09:17,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-10-03 04:09:17,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-10-03 04:09:17,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 554 transitions. [2019-10-03 04:09:17,017 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 554 transitions. Word has length 103 [2019-10-03 04:09:17,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:17,019 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 554 transitions. [2019-10-03 04:09:17,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:17,019 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 554 transitions. [2019-10-03 04:09:17,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-03 04:09:17,020 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:17,021 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:17,021 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:17,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:17,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1538356794, now seen corresponding path program 1 times [2019-10-03 04:09:17,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:17,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:17,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:17,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:17,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:17,091 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 04:09:17,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:17,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:17,092 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:17,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:17,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:17,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:17,093 INFO L87 Difference]: Start difference. First operand 340 states and 554 transitions. Second operand 5 states. [2019-10-03 04:09:17,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:17,277 INFO L93 Difference]: Finished difference Result 342 states and 552 transitions. [2019-10-03 04:09:17,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:17,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-03 04:09:17,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:17,283 INFO L225 Difference]: With dead ends: 342 [2019-10-03 04:09:17,284 INFO L226 Difference]: Without dead ends: 342 [2019-10-03 04:09:17,284 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:17,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-10-03 04:09:17,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-10-03 04:09:17,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-10-03 04:09:17,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 550 transitions. [2019-10-03 04:09:17,298 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 550 transitions. Word has length 104 [2019-10-03 04:09:17,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:17,298 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 550 transitions. [2019-10-03 04:09:17,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:17,299 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 550 transitions. [2019-10-03 04:09:17,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-03 04:09:17,300 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:17,300 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:17,301 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:17,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:17,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1488538894, now seen corresponding path program 1 times [2019-10-03 04:09:17,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:17,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:17,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:17,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:17,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:17,369 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 04:09:17,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:17,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:17,370 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:17,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:17,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:17,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:17,371 INFO L87 Difference]: Start difference. First operand 340 states and 550 transitions. Second operand 5 states. [2019-10-03 04:09:17,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:17,562 INFO L93 Difference]: Finished difference Result 375 states and 605 transitions. [2019-10-03 04:09:17,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:17,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-03 04:09:17,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:17,565 INFO L225 Difference]: With dead ends: 375 [2019-10-03 04:09:17,565 INFO L226 Difference]: Without dead ends: 375 [2019-10-03 04:09:17,565 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:17,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-03 04:09:17,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-10-03 04:09:17,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-03 04:09:17,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 592 transitions. [2019-10-03 04:09:17,575 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 592 transitions. Word has length 105 [2019-10-03 04:09:17,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:17,575 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 592 transitions. [2019-10-03 04:09:17,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:17,576 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 592 transitions. [2019-10-03 04:09:17,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-03 04:09:17,577 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:17,578 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:17,578 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:17,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:17,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1690820362, now seen corresponding path program 1 times [2019-10-03 04:09:17,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:17,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:17,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:17,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:17,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:17,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:17,641 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 04:09:17,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:17,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:17,641 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:17,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:17,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:17,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:17,643 INFO L87 Difference]: Start difference. First operand 367 states and 592 transitions. Second operand 5 states. [2019-10-03 04:09:17,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:17,905 INFO L93 Difference]: Finished difference Result 375 states and 600 transitions. [2019-10-03 04:09:17,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:17,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-03 04:09:17,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:17,909 INFO L225 Difference]: With dead ends: 375 [2019-10-03 04:09:17,909 INFO L226 Difference]: Without dead ends: 375 [2019-10-03 04:09:17,909 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:17,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-03 04:09:17,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-10-03 04:09:17,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-03 04:09:17,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 587 transitions. [2019-10-03 04:09:17,924 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 587 transitions. Word has length 106 [2019-10-03 04:09:17,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:17,925 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 587 transitions. [2019-10-03 04:09:17,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:17,925 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 587 transitions. [2019-10-03 04:09:17,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-03 04:09:17,928 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:17,928 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:17,931 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:17,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:17,932 INFO L82 PathProgramCache]: Analyzing trace with hash 478955993, now seen corresponding path program 1 times [2019-10-03 04:09:17,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:17,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:17,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:17,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:17,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:18,041 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-03 04:09:18,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:18,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:18,042 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:18,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:18,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:18,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:18,044 INFO L87 Difference]: Start difference. First operand 367 states and 587 transitions. Second operand 5 states. [2019-10-03 04:09:18,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:18,232 INFO L93 Difference]: Finished difference Result 393 states and 624 transitions. [2019-10-03 04:09:18,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:18,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-10-03 04:09:18,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:18,235 INFO L225 Difference]: With dead ends: 393 [2019-10-03 04:09:18,235 INFO L226 Difference]: Without dead ends: 393 [2019-10-03 04:09:18,236 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:18,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-10-03 04:09:18,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 388. [2019-10-03 04:09:18,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-03 04:09:18,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 616 transitions. [2019-10-03 04:09:18,245 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 616 transitions. Word has length 110 [2019-10-03 04:09:18,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:18,246 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 616 transitions. [2019-10-03 04:09:18,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:18,246 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 616 transitions. [2019-10-03 04:09:18,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-03 04:09:18,248 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:18,248 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:18,248 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:18,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:18,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1822469329, now seen corresponding path program 1 times [2019-10-03 04:09:18,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:18,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:18,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:18,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:18,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:18,303 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-03 04:09:18,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:18,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:18,304 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:18,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:18,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:18,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:18,305 INFO L87 Difference]: Start difference. First operand 388 states and 616 transitions. Second operand 5 states. [2019-10-03 04:09:18,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:18,494 INFO L93 Difference]: Finished difference Result 393 states and 618 transitions. [2019-10-03 04:09:18,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:18,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-10-03 04:09:18,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:18,497 INFO L225 Difference]: With dead ends: 393 [2019-10-03 04:09:18,497 INFO L226 Difference]: Without dead ends: 393 [2019-10-03 04:09:18,497 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:18,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-10-03 04:09:18,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 388. [2019-10-03 04:09:18,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-03 04:09:18,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 610 transitions. [2019-10-03 04:09:18,508 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 610 transitions. Word has length 111 [2019-10-03 04:09:18,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:18,509 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 610 transitions. [2019-10-03 04:09:18,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:18,509 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 610 transitions. [2019-10-03 04:09:18,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-03 04:09:18,511 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:18,511 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:18,512 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:18,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:18,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1681254182, now seen corresponding path program 1 times [2019-10-03 04:09:18,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:18,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:18,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:18,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:18,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:18,580 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 04:09:18,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:18,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:18,581 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:18,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:18,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:18,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:18,583 INFO L87 Difference]: Start difference. First operand 388 states and 610 transitions. Second operand 3 states. [2019-10-03 04:09:18,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:18,617 INFO L93 Difference]: Finished difference Result 761 states and 1201 transitions. [2019-10-03 04:09:18,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:18,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-10-03 04:09:18,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:18,622 INFO L225 Difference]: With dead ends: 761 [2019-10-03 04:09:18,622 INFO L226 Difference]: Without dead ends: 761 [2019-10-03 04:09:18,624 INFO L640 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 [2019-10-03 04:09:18,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2019-10-03 04:09:18,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2019-10-03 04:09:18,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-10-03 04:09:18,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1201 transitions. [2019-10-03 04:09:18,645 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1201 transitions. Word has length 126 [2019-10-03 04:09:18,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:18,646 INFO L475 AbstractCegarLoop]: Abstraction has 761 states and 1201 transitions. [2019-10-03 04:09:18,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:18,646 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1201 transitions. [2019-10-03 04:09:18,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-03 04:09:18,650 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:18,651 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:18,651 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:18,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:18,652 INFO L82 PathProgramCache]: Analyzing trace with hash -837527912, now seen corresponding path program 1 times [2019-10-03 04:09:18,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:18,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:18,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:18,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:18,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:18,715 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-03 04:09:18,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:18,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:18,718 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:18,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:18,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:18,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:18,719 INFO L87 Difference]: Start difference. First operand 761 states and 1201 transitions. Second operand 3 states. [2019-10-03 04:09:18,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:18,761 INFO L93 Difference]: Finished difference Result 1129 states and 1782 transitions. [2019-10-03 04:09:18,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:18,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-10-03 04:09:18,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:18,771 INFO L225 Difference]: With dead ends: 1129 [2019-10-03 04:09:18,771 INFO L226 Difference]: Without dead ends: 1129 [2019-10-03 04:09:18,771 INFO L640 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 [2019-10-03 04:09:18,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-10-03 04:09:18,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1129. [2019-10-03 04:09:18,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1129 states. [2019-10-03 04:09:18,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1782 transitions. [2019-10-03 04:09:18,807 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1782 transitions. Word has length 127 [2019-10-03 04:09:18,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:18,808 INFO L475 AbstractCegarLoop]: Abstraction has 1129 states and 1782 transitions. [2019-10-03 04:09:18,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:18,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1782 transitions. [2019-10-03 04:09:18,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-03 04:09:18,813 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:18,814 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:18,814 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:18,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:18,815 INFO L82 PathProgramCache]: Analyzing trace with hash 551766102, now seen corresponding path program 1 times [2019-10-03 04:09:18,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:18,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:18,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:18,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:18,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:18,876 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-03 04:09:18,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:18,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:18,877 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:18,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:18,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:18,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:18,878 INFO L87 Difference]: Start difference. First operand 1129 states and 1782 transitions. Second operand 3 states. [2019-10-03 04:09:18,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:18,920 INFO L93 Difference]: Finished difference Result 1480 states and 2333 transitions. [2019-10-03 04:09:18,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:18,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-10-03 04:09:18,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:18,932 INFO L225 Difference]: With dead ends: 1480 [2019-10-03 04:09:18,933 INFO L226 Difference]: Without dead ends: 1480 [2019-10-03 04:09:18,933 INFO L640 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 [2019-10-03 04:09:18,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2019-10-03 04:09:18,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1480. [2019-10-03 04:09:18,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2019-10-03 04:09:19,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2333 transitions. [2019-10-03 04:09:19,009 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2333 transitions. Word has length 127 [2019-10-03 04:09:19,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:19,010 INFO L475 AbstractCegarLoop]: Abstraction has 1480 states and 2333 transitions. [2019-10-03 04:09:19,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:19,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2333 transitions. [2019-10-03 04:09:19,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-03 04:09:19,021 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:19,021 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:19,022 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:19,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:19,022 INFO L82 PathProgramCache]: Analyzing trace with hash -923211894, now seen corresponding path program 1 times [2019-10-03 04:09:19,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:19,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:19,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:19,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:19,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:19,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:19,101 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-03 04:09:19,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:19,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:19,102 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:19,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:19,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:19,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:19,103 INFO L87 Difference]: Start difference. First operand 1480 states and 2333 transitions. Second operand 3 states. [2019-10-03 04:09:19,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:19,281 INFO L93 Difference]: Finished difference Result 1520 states and 2237 transitions. [2019-10-03 04:09:19,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:19,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-10-03 04:09:19,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:19,290 INFO L225 Difference]: With dead ends: 1520 [2019-10-03 04:09:19,291 INFO L226 Difference]: Without dead ends: 1520 [2019-10-03 04:09:19,291 INFO L640 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 [2019-10-03 04:09:19,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2019-10-03 04:09:19,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1480. [2019-10-03 04:09:19,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2019-10-03 04:09:19,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2189 transitions. [2019-10-03 04:09:19,325 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2189 transitions. Word has length 164 [2019-10-03 04:09:19,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:19,325 INFO L475 AbstractCegarLoop]: Abstraction has 1480 states and 2189 transitions. [2019-10-03 04:09:19,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:19,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2189 transitions. [2019-10-03 04:09:19,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-03 04:09:19,330 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:19,330 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:19,330 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:19,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:19,331 INFO L82 PathProgramCache]: Analyzing trace with hash -2015847096, now seen corresponding path program 1 times [2019-10-03 04:09:19,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:19,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:19,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:19,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:19,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:19,380 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-03 04:09:19,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:19,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:19,381 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:19,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:19,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:19,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:19,384 INFO L87 Difference]: Start difference. First operand 1480 states and 2189 transitions. Second operand 3 states. [2019-10-03 04:09:19,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:19,595 INFO L93 Difference]: Finished difference Result 1676 states and 2417 transitions. [2019-10-03 04:09:19,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:19,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-10-03 04:09:19,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:19,606 INFO L225 Difference]: With dead ends: 1676 [2019-10-03 04:09:19,606 INFO L226 Difference]: Without dead ends: 1676 [2019-10-03 04:09:19,607 INFO L640 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 [2019-10-03 04:09:19,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2019-10-03 04:09:19,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1560. [2019-10-03 04:09:19,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-10-03 04:09:19,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2249 transitions. [2019-10-03 04:09:19,650 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2249 transitions. Word has length 164 [2019-10-03 04:09:19,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:19,651 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2249 transitions. [2019-10-03 04:09:19,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:19,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2249 transitions. [2019-10-03 04:09:19,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-03 04:09:19,659 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:19,660 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:19,660 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:19,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:19,661 INFO L82 PathProgramCache]: Analyzing trace with hash 154922403, now seen corresponding path program 1 times [2019-10-03 04:09:19,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:19,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:19,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:19,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:19,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:19,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:19,734 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-10-03 04:09:19,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:19,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:19,735 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:19,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:19,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:19,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:19,737 INFO L87 Difference]: Start difference. First operand 1560 states and 2249 transitions. Second operand 3 states. [2019-10-03 04:09:19,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:19,954 INFO L93 Difference]: Finished difference Result 1648 states and 2304 transitions. [2019-10-03 04:09:19,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:19,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-10-03 04:09:19,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:19,963 INFO L225 Difference]: With dead ends: 1648 [2019-10-03 04:09:19,963 INFO L226 Difference]: Without dead ends: 1648 [2019-10-03 04:09:19,964 INFO L640 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 [2019-10-03 04:09:19,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2019-10-03 04:09:19,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1566. [2019-10-03 04:09:19,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2019-10-03 04:09:20,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2196 transitions. [2019-10-03 04:09:20,008 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2196 transitions. Word has length 178 [2019-10-03 04:09:20,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:20,008 INFO L475 AbstractCegarLoop]: Abstraction has 1566 states and 2196 transitions. [2019-10-03 04:09:20,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:20,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2196 transitions. [2019-10-03 04:09:20,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-03 04:09:20,014 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:20,015 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:20,015 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:20,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:20,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1961792037, now seen corresponding path program 1 times [2019-10-03 04:09:20,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:20,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:20,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:20,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:20,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:20,112 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-03 04:09:20,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:20,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:20,113 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:20,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:20,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:20,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:20,115 INFO L87 Difference]: Start difference. First operand 1566 states and 2196 transitions. Second operand 3 states. [2019-10-03 04:09:20,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:20,246 INFO L93 Difference]: Finished difference Result 1651 states and 2300 transitions. [2019-10-03 04:09:20,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:20,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-10-03 04:09:20,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:20,254 INFO L225 Difference]: With dead ends: 1651 [2019-10-03 04:09:20,254 INFO L226 Difference]: Without dead ends: 1651 [2019-10-03 04:09:20,255 INFO L640 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 [2019-10-03 04:09:20,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2019-10-03 04:09:20,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1635. [2019-10-03 04:09:20,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1635 states. [2019-10-03 04:09:20,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2280 transitions. [2019-10-03 04:09:20,291 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2280 transitions. Word has length 194 [2019-10-03 04:09:20,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:20,291 INFO L475 AbstractCegarLoop]: Abstraction has 1635 states and 2280 transitions. [2019-10-03 04:09:20,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:20,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2280 transitions. [2019-10-03 04:09:20,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-10-03 04:09:20,297 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:20,297 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:20,297 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:20,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:20,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1023005408, now seen corresponding path program 1 times [2019-10-03 04:09:20,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:20,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:20,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:20,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:20,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:20,374 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-10-03 04:09:20,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:20,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:20,375 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:20,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:20,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:20,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:20,377 INFO L87 Difference]: Start difference. First operand 1635 states and 2280 transitions. Second operand 3 states. [2019-10-03 04:09:20,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:20,561 INFO L93 Difference]: Finished difference Result 1787 states and 2484 transitions. [2019-10-03 04:09:20,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:20,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2019-10-03 04:09:20,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:20,573 INFO L225 Difference]: With dead ends: 1787 [2019-10-03 04:09:20,573 INFO L226 Difference]: Without dead ends: 1787 [2019-10-03 04:09:20,575 INFO L640 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 [2019-10-03 04:09:20,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2019-10-03 04:09:20,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1735. [2019-10-03 04:09:20,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2019-10-03 04:09:20,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2400 transitions. [2019-10-03 04:09:20,634 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2400 transitions. Word has length 215 [2019-10-03 04:09:20,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:20,635 INFO L475 AbstractCegarLoop]: Abstraction has 1735 states and 2400 transitions. [2019-10-03 04:09:20,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:20,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2400 transitions. [2019-10-03 04:09:20,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-03 04:09:20,643 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:20,644 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:20,644 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:20,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:20,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1880660095, now seen corresponding path program 1 times [2019-10-03 04:09:20,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:20,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:20,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:20,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:20,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:20,737 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-03 04:09:20,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:20,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:20,738 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:20,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:20,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:20,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:20,740 INFO L87 Difference]: Start difference. First operand 1735 states and 2400 transitions. Second operand 3 states. [2019-10-03 04:09:20,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:20,935 INFO L93 Difference]: Finished difference Result 1815 states and 2496 transitions. [2019-10-03 04:09:20,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:20,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-10-03 04:09:20,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:20,943 INFO L225 Difference]: With dead ends: 1815 [2019-10-03 04:09:20,944 INFO L226 Difference]: Without dead ends: 1815 [2019-10-03 04:09:20,944 INFO L640 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 [2019-10-03 04:09:20,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2019-10-03 04:09:20,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1735. [2019-10-03 04:09:20,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2019-10-03 04:09:20,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2392 transitions. [2019-10-03 04:09:20,999 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2392 transitions. Word has length 218 [2019-10-03 04:09:20,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:20,999 INFO L475 AbstractCegarLoop]: Abstraction has 1735 states and 2392 transitions. [2019-10-03 04:09:21,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:21,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2392 transitions. [2019-10-03 04:09:21,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-10-03 04:09:21,006 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:21,006 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 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] [2019-10-03 04:09:21,007 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:21,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:21,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1809038977, now seen corresponding path program 1 times [2019-10-03 04:09:21,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:21,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:21,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:21,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:21,010 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-10-03 04:09:21,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:21,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:21,106 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:21,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:21,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:21,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:21,108 INFO L87 Difference]: Start difference. First operand 1735 states and 2392 transitions. Second operand 3 states. [2019-10-03 04:09:21,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:21,275 INFO L93 Difference]: Finished difference Result 1931 states and 2588 transitions. [2019-10-03 04:09:21,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:21,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-10-03 04:09:21,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:21,284 INFO L225 Difference]: With dead ends: 1931 [2019-10-03 04:09:21,284 INFO L226 Difference]: Without dead ends: 1831 [2019-10-03 04:09:21,289 INFO L640 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 [2019-10-03 04:09:21,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2019-10-03 04:09:21,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1791. [2019-10-03 04:09:21,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1791 states. [2019-10-03 04:09:21,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2436 transitions. [2019-10-03 04:09:21,332 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2436 transitions. Word has length 239 [2019-10-03 04:09:21,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:21,333 INFO L475 AbstractCegarLoop]: Abstraction has 1791 states and 2436 transitions. [2019-10-03 04:09:21,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:21,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2436 transitions. [2019-10-03 04:09:21,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-10-03 04:09:21,341 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:21,342 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 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] [2019-10-03 04:09:21,342 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:21,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:21,343 INFO L82 PathProgramCache]: Analyzing trace with hash -940069451, now seen corresponding path program 1 times [2019-10-03 04:09:21,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:21,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:21,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:21,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:21,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:21,456 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-10-03 04:09:21,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:21,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:21,457 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:21,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:21,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:21,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:21,458 INFO L87 Difference]: Start difference. First operand 1791 states and 2436 transitions. Second operand 3 states. [2019-10-03 04:09:21,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:21,640 INFO L93 Difference]: Finished difference Result 1823 states and 2468 transitions. [2019-10-03 04:09:21,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:21,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-10-03 04:09:21,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:21,653 INFO L225 Difference]: With dead ends: 1823 [2019-10-03 04:09:21,653 INFO L226 Difference]: Without dead ends: 1823 [2019-10-03 04:09:21,653 INFO L640 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 [2019-10-03 04:09:21,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2019-10-03 04:09:21,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1791. [2019-10-03 04:09:21,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1791 states. [2019-10-03 04:09:21,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2416 transitions. [2019-10-03 04:09:21,700 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2416 transitions. Word has length 241 [2019-10-03 04:09:21,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:21,700 INFO L475 AbstractCegarLoop]: Abstraction has 1791 states and 2416 transitions. [2019-10-03 04:09:21,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:21,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2416 transitions. [2019-10-03 04:09:21,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-10-03 04:09:21,712 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:21,712 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 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] [2019-10-03 04:09:21,712 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:21,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:21,713 INFO L82 PathProgramCache]: Analyzing trace with hash -275540929, now seen corresponding path program 1 times [2019-10-03 04:09:21,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:21,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:21,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:21,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:21,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:21,860 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 425 proven. 16 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-10-03 04:09:21,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:09:21,861 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:09:21,863 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 252 with the following transitions: [2019-10-03 04:09:21,867 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [115], [117], [122], [125], [127], [132], [135], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [192], [197], [200], [202], [207], [210], [281], [284], [292], [294], [297], [299], [302], [310], [313], [315], [317], [319], [322], [331], [333], [336], [342], [372], [377], [387], [391], [402], [404], [414], [416], [421], [443], [445], [493], [498], [503], [509], [514], [516], [519], [587], [589], [601], [604], [605], [606], [608] [2019-10-03 04:09:21,916 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:09:21,917 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:09:22,247 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 04:09:22,640 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:09:22,644 INFO L272 AbstractInterpreter]: Visited 90 different actions 508 times. Merged at 76 different actions 371 times. Widened at 8 different actions 15 times. Performed 1237 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1237 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 38 fixpoints after 15 different actions. Largest state had 96 variables. [2019-10-03 04:09:22,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:22,649 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:09:23,059 INFO L227 lantSequenceWeakener]: Weakened 6 states. On average, predicates are now at 93.85% of their original sizes. [2019-10-03 04:09:23,060 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:09:29,629 INFO L420 sIntCurrentIteration]: We unified 250 AI predicates to 250 [2019-10-03 04:09:29,629 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:09:29,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:09:29,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [42] imperfect sequences [4] total 44 [2019-10-03 04:09:29,631 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:29,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-03 04:09:29,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-03 04:09:29,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=1383, Unknown=0, NotChecked=0, Total=1722 [2019-10-03 04:09:29,634 INFO L87 Difference]: Start difference. First operand 1791 states and 2416 transitions. Second operand 42 states. [2019-10-03 04:10:17,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:17,333 INFO L93 Difference]: Finished difference Result 3426 states and 4548 transitions. [2019-10-03 04:10:17,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-03 04:10:17,334 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 251 [2019-10-03 04:10:17,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:17,348 INFO L225 Difference]: With dead ends: 3426 [2019-10-03 04:10:17,348 INFO L226 Difference]: Without dead ends: 3426 [2019-10-03 04:10:17,350 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 166 SyntacticMatches, 44 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3006 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=1123, Invalid=4729, Unknown=0, NotChecked=0, Total=5852 [2019-10-03 04:10:17,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3426 states. [2019-10-03 04:10:17,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3426 to 3194. [2019-10-03 04:10:17,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3194 states. [2019-10-03 04:10:17,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3194 states to 3194 states and 4275 transitions. [2019-10-03 04:10:17,416 INFO L78 Accepts]: Start accepts. Automaton has 3194 states and 4275 transitions. Word has length 251 [2019-10-03 04:10:17,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:17,417 INFO L475 AbstractCegarLoop]: Abstraction has 3194 states and 4275 transitions. [2019-10-03 04:10:17,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-03 04:10:17,417 INFO L276 IsEmpty]: Start isEmpty. Operand 3194 states and 4275 transitions. [2019-10-03 04:10:17,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-03 04:10:17,426 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:17,426 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:17,426 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:17,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:17,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1797967949, now seen corresponding path program 1 times [2019-10-03 04:10:17,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:17,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:17,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:17,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:17,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:17,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:17,548 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-03 04:10:17,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:10:17,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:10:17,549 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 259 with the following transitions: [2019-10-03 04:10:17,550 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [117], [122], [127], [132], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [192], [197], [200], [202], [207], [210], [281], [284], [292], [294], [297], [299], [302], [310], [313], [317], [443], [445], [493], [498], [501], [503], [509], [514], [516], [519], [521], [526], [529], [533], [587], [589], [601], [604], [605], [606], [608] [2019-10-03 04:10:17,554 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:10:17,554 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:10:18,269 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:10:18,270 INFO L272 AbstractInterpreter]: Visited 77 different actions 1265 times. Merged at 66 different actions 1060 times. Widened at 11 different actions 102 times. Performed 2961 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2961 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 123 fixpoints after 14 different actions. Largest state had 94 variables. [2019-10-03 04:10:18,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:18,271 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:10:18,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:10:18,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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 [2019-10-03 04:10:18,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:18,302 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:10:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:18,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:10:18,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:10:18,492 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-03 04:10:18,492 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:10:18,568 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-03 04:10:18,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 04:10:18,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-03 04:10:18,578 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 04:10:18,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:10:18,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:10:18,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:18,581 INFO L87 Difference]: Start difference. First operand 3194 states and 4275 transitions. Second operand 4 states. [2019-10-03 04:10:18,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:18,941 INFO L93 Difference]: Finished difference Result 6682 states and 8681 transitions. [2019-10-03 04:10:18,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:10:18,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 258 [2019-10-03 04:10:18,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:18,957 INFO L225 Difference]: With dead ends: 6682 [2019-10-03 04:10:18,957 INFO L226 Difference]: Without dead ends: 6682 [2019-10-03 04:10:18,957 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 516 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:10:18,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6682 states. [2019-10-03 04:10:19,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6682 to 3957. [2019-10-03 04:10:19,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3957 states. [2019-10-03 04:10:19,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3957 states to 3957 states and 5180 transitions. [2019-10-03 04:10:19,033 INFO L78 Accepts]: Start accepts. Automaton has 3957 states and 5180 transitions. Word has length 258 [2019-10-03 04:10:19,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:19,034 INFO L475 AbstractCegarLoop]: Abstraction has 3957 states and 5180 transitions. [2019-10-03 04:10:19,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:10:19,034 INFO L276 IsEmpty]: Start isEmpty. Operand 3957 states and 5180 transitions. [2019-10-03 04:10:19,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-03 04:10:19,043 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:19,044 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:19,044 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:19,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:19,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1509148559, now seen corresponding path program 1 times [2019-10-03 04:10:19,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:19,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:19,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:19,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:19,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:19,139 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-10-03 04:10:19,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:19,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:10:19,139 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:19,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:10:19,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:10:19,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:10:19,140 INFO L87 Difference]: Start difference. First operand 3957 states and 5180 transitions. Second operand 3 states. [2019-10-03 04:10:19,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:19,175 INFO L93 Difference]: Finished difference Result 6803 states and 8966 transitions. [2019-10-03 04:10:19,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:10:19,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2019-10-03 04:10:19,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:19,189 INFO L225 Difference]: With dead ends: 6803 [2019-10-03 04:10:19,189 INFO L226 Difference]: Without dead ends: 6803 [2019-10-03 04:10:19,190 INFO L640 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 [2019-10-03 04:10:19,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6803 states. [2019-10-03 04:10:19,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6803 to 6801. [2019-10-03 04:10:19,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6801 states. [2019-10-03 04:10:19,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6801 states to 6801 states and 8965 transitions. [2019-10-03 04:10:19,284 INFO L78 Accepts]: Start accepts. Automaton has 6801 states and 8965 transitions. Word has length 258 [2019-10-03 04:10:19,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:19,285 INFO L475 AbstractCegarLoop]: Abstraction has 6801 states and 8965 transitions. [2019-10-03 04:10:19,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:10:19,285 INFO L276 IsEmpty]: Start isEmpty. Operand 6801 states and 8965 transitions. [2019-10-03 04:10:19,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-10-03 04:10:19,300 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:19,301 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:19,301 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:19,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:19,301 INFO L82 PathProgramCache]: Analyzing trace with hash -718445864, now seen corresponding path program 1 times [2019-10-03 04:10:19,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:19,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:19,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:19,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:19,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:19,384 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-10-03 04:10:19,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:19,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:10:19,385 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:19,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:10:19,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:10:19,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:10:19,387 INFO L87 Difference]: Start difference. First operand 6801 states and 8965 transitions. Second operand 3 states. [2019-10-03 04:10:19,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:19,632 INFO L93 Difference]: Finished difference Result 6957 states and 9058 transitions. [2019-10-03 04:10:19,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:10:19,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-10-03 04:10:19,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:19,653 INFO L225 Difference]: With dead ends: 6957 [2019-10-03 04:10:19,653 INFO L226 Difference]: Without dead ends: 6957 [2019-10-03 04:10:19,655 INFO L640 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 [2019-10-03 04:10:19,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6957 states. [2019-10-03 04:10:19,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6957 to 6802. [2019-10-03 04:10:19,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6802 states. [2019-10-03 04:10:19,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6802 states to 6802 states and 8862 transitions. [2019-10-03 04:10:19,786 INFO L78 Accepts]: Start accepts. Automaton has 6802 states and 8862 transitions. Word has length 261 [2019-10-03 04:10:19,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:19,787 INFO L475 AbstractCegarLoop]: Abstraction has 6802 states and 8862 transitions. [2019-10-03 04:10:19,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:10:19,787 INFO L276 IsEmpty]: Start isEmpty. Operand 6802 states and 8862 transitions. [2019-10-03 04:10:19,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-10-03 04:10:19,807 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:19,807 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:19,808 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:19,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:19,808 INFO L82 PathProgramCache]: Analyzing trace with hash -571590843, now seen corresponding path program 1 times [2019-10-03 04:10:19,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:19,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:19,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:19,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:19,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:19,976 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 518 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-10-03 04:10:19,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:10:19,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:10:19,977 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 288 with the following transitions: [2019-10-03 04:10:19,978 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [50], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [117], [122], [127], [132], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [192], [197], [200], [202], [207], [210], [225], [227], [230], [234], [238], [253], [259], [269], [281], [284], [286], [292], [294], [297], [299], [302], [310], [313], [317], [443], [445], [493], [498], [501], [503], [509], [514], [516], [519], [521], [526], [529], [533], [587], [589], [601], [604], [605], [606], [608] [2019-10-03 04:10:19,985 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:10:19,985 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:10:20,873 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:10:20,873 INFO L272 AbstractInterpreter]: Visited 87 different actions 1468 times. Merged at 76 different actions 1208 times. Widened at 14 different actions 118 times. Performed 3541 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3541 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 157 fixpoints after 17 different actions. Largest state had 95 variables. [2019-10-03 04:10:20,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:20,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:10:20,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:10:20,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:10:20,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:20,914 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:10:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:20,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:10:20,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:10:21,050 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2019-10-03 04:10:21,050 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:10:21,098 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-03 04:10:21,102 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:10:21,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-03 04:10:21,103 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:21,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:10:21,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:10:21,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:21,104 INFO L87 Difference]: Start difference. First operand 6802 states and 8862 transitions. Second operand 3 states. [2019-10-03 04:10:21,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:21,240 INFO L93 Difference]: Finished difference Result 6828 states and 8876 transitions. [2019-10-03 04:10:21,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:10:21,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 287 [2019-10-03 04:10:21,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:21,252 INFO L225 Difference]: With dead ends: 6828 [2019-10-03 04:10:21,253 INFO L226 Difference]: Without dead ends: 6828 [2019-10-03 04:10:21,253 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 574 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:21,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6828 states. [2019-10-03 04:10:21,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6828 to 6802. [2019-10-03 04:10:21,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6802 states. [2019-10-03 04:10:21,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6802 states to 6802 states and 8850 transitions. [2019-10-03 04:10:21,339 INFO L78 Accepts]: Start accepts. Automaton has 6802 states and 8850 transitions. Word has length 287 [2019-10-03 04:10:21,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:21,340 INFO L475 AbstractCegarLoop]: Abstraction has 6802 states and 8850 transitions. [2019-10-03 04:10:21,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:10:21,340 INFO L276 IsEmpty]: Start isEmpty. Operand 6802 states and 8850 transitions. [2019-10-03 04:10:21,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-10-03 04:10:21,359 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:21,360 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:21,360 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:21,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:21,361 INFO L82 PathProgramCache]: Analyzing trace with hash 232140181, now seen corresponding path program 1 times [2019-10-03 04:10:21,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:21,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:21,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:21,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:21,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:21,483 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 518 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-10-03 04:10:21,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:10:21,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:10:21,484 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 289 with the following transitions: [2019-10-03 04:10:21,484 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [50], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [117], [122], [127], [132], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [192], [197], [200], [202], [207], [210], [225], [227], [230], [234], [238], [253], [259], [262], [267], [281], [284], [286], [292], [294], [297], [299], [302], [310], [313], [317], [443], [445], [493], [498], [501], [503], [509], [514], [516], [519], [521], [526], [529], [533], [587], [589], [601], [604], [605], [606], [608] [2019-10-03 04:10:21,491 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:10:21,491 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:10:22,447 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:10:22,447 INFO L272 AbstractInterpreter]: Visited 87 different actions 1369 times. Merged at 75 different actions 1120 times. Widened at 12 different actions 108 times. Performed 3232 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3232 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 136 fixpoints after 17 different actions. Largest state had 95 variables. [2019-10-03 04:10:22,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:22,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:10:22,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:10:22,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:10:22,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:22,481 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:10:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:22,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:10:22,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:10:22,606 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 421 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-10-03 04:10:22,606 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:10:22,642 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 421 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-10-03 04:10:22,646 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:10:22,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-03 04:10:22,646 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:22,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:10:22,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:10:22,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:22,647 INFO L87 Difference]: Start difference. First operand 6802 states and 8850 transitions. Second operand 3 states. [2019-10-03 04:10:22,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:22,763 INFO L93 Difference]: Finished difference Result 6802 states and 8838 transitions. [2019-10-03 04:10:22,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:10:22,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 288 [2019-10-03 04:10:22,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:22,775 INFO L225 Difference]: With dead ends: 6802 [2019-10-03 04:10:22,776 INFO L226 Difference]: Without dead ends: 6802 [2019-10-03 04:10:22,776 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 576 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:22,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6802 states. [2019-10-03 04:10:22,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6802 to 6802. [2019-10-03 04:10:22,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6802 states. [2019-10-03 04:10:22,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6802 states to 6802 states and 8838 transitions. [2019-10-03 04:10:22,857 INFO L78 Accepts]: Start accepts. Automaton has 6802 states and 8838 transitions. Word has length 288 [2019-10-03 04:10:22,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:22,858 INFO L475 AbstractCegarLoop]: Abstraction has 6802 states and 8838 transitions. [2019-10-03 04:10:22,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:10:22,858 INFO L276 IsEmpty]: Start isEmpty. Operand 6802 states and 8838 transitions. [2019-10-03 04:10:22,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-10-03 04:10:22,872 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:22,872 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:22,872 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:22,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:22,873 INFO L82 PathProgramCache]: Analyzing trace with hash -2074361303, now seen corresponding path program 1 times [2019-10-03 04:10:22,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:22,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:22,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:22,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:22,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:22,967 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-10-03 04:10:22,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:10:22,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:10:22,968 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 289 with the following transitions: [2019-10-03 04:10:22,970 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [55], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [117], [122], [127], [132], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [192], [197], [200], [202], [207], [210], [227], [230], [234], [238], [253], [259], [262], [267], [281], [284], [286], [292], [294], [297], [299], [302], [310], [313], [317], [443], [445], [493], [498], [501], [503], [509], [514], [516], [519], [521], [526], [529], [533], [587], [589], [601], [604], [605], [606], [608] [2019-10-03 04:10:22,977 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:10:22,977 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:10:23,969 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:10:23,969 INFO L272 AbstractInterpreter]: Visited 87 different actions 1517 times. Merged at 76 different actions 1251 times. Widened at 12 different actions 116 times. Performed 3764 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3764 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 163 fixpoints after 18 different actions. Largest state had 95 variables. [2019-10-03 04:10:23,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:23,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:10:23,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:10:23,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:10:24,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:24,001 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:10:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:24,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:10:24,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:10:24,132 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-10-03 04:10:24,133 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:10:24,190 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-10-03 04:10:24,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 04:10:24,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-03 04:10:24,195 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 04:10:24,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:10:24,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:10:24,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:24,196 INFO L87 Difference]: Start difference. First operand 6802 states and 8838 transitions. Second operand 4 states. [2019-10-03 04:10:24,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:24,537 INFO L93 Difference]: Finished difference Result 9794 states and 12459 transitions. [2019-10-03 04:10:24,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:10:24,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 288 [2019-10-03 04:10:24,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:24,566 INFO L225 Difference]: With dead ends: 9794 [2019-10-03 04:10:24,567 INFO L226 Difference]: Without dead ends: 9702 [2019-10-03 04:10:24,570 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 576 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:10:24,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9702 states. [2019-10-03 04:10:24,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9702 to 6068. [2019-10-03 04:10:24,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6068 states. [2019-10-03 04:10:24,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6068 states to 6068 states and 7777 transitions. [2019-10-03 04:10:24,661 INFO L78 Accepts]: Start accepts. Automaton has 6068 states and 7777 transitions. Word has length 288 [2019-10-03 04:10:24,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:24,661 INFO L475 AbstractCegarLoop]: Abstraction has 6068 states and 7777 transitions. [2019-10-03 04:10:24,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:10:24,661 INFO L276 IsEmpty]: Start isEmpty. Operand 6068 states and 7777 transitions. [2019-10-03 04:10:24,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-10-03 04:10:24,679 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:24,679 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:24,679 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:24,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:24,680 INFO L82 PathProgramCache]: Analyzing trace with hash 924837848, now seen corresponding path program 1 times [2019-10-03 04:10:24,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:24,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:24,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:24,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:24,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:24,781 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-10-03 04:10:24,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:24,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:10:24,782 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:24,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:10:24,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:10:24,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:10:24,783 INFO L87 Difference]: Start difference. First operand 6068 states and 7777 transitions. Second operand 3 states. [2019-10-03 04:10:24,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:24,894 INFO L93 Difference]: Finished difference Result 4408 states and 5485 transitions. [2019-10-03 04:10:24,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:10:24,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-10-03 04:10:24,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:24,903 INFO L225 Difference]: With dead ends: 4408 [2019-10-03 04:10:24,903 INFO L226 Difference]: Without dead ends: 3204 [2019-10-03 04:10:24,904 INFO L640 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 [2019-10-03 04:10:24,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3204 states. [2019-10-03 04:10:24,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3204 to 3204. [2019-10-03 04:10:24,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3204 states. [2019-10-03 04:10:24,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3204 states to 3204 states and 4059 transitions. [2019-10-03 04:10:24,947 INFO L78 Accepts]: Start accepts. Automaton has 3204 states and 4059 transitions. Word has length 326 [2019-10-03 04:10:24,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:24,948 INFO L475 AbstractCegarLoop]: Abstraction has 3204 states and 4059 transitions. [2019-10-03 04:10:24,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:10:24,948 INFO L276 IsEmpty]: Start isEmpty. Operand 3204 states and 4059 transitions. [2019-10-03 04:10:24,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-10-03 04:10:24,957 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:24,957 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:24,957 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:24,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:24,958 INFO L82 PathProgramCache]: Analyzing trace with hash 4925057, now seen corresponding path program 1 times [2019-10-03 04:10:24,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:24,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:24,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:24,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:24,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:25,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-10-03 04:10:25,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:25,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:10:25,106 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:25,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:10:25,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:10:25,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:10:25,110 INFO L87 Difference]: Start difference. First operand 3204 states and 4059 transitions. Second operand 3 states. [2019-10-03 04:10:25,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:25,268 INFO L93 Difference]: Finished difference Result 3218 states and 4038 transitions. [2019-10-03 04:10:25,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:10:25,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 365 [2019-10-03 04:10:25,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:25,282 INFO L225 Difference]: With dead ends: 3218 [2019-10-03 04:10:25,282 INFO L226 Difference]: Without dead ends: 3218 [2019-10-03 04:10:25,282 INFO L640 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 [2019-10-03 04:10:25,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3218 states. [2019-10-03 04:10:25,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3218 to 3204. [2019-10-03 04:10:25,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3204 states. [2019-10-03 04:10:25,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3204 states to 3204 states and 4024 transitions. [2019-10-03 04:10:25,320 INFO L78 Accepts]: Start accepts. Automaton has 3204 states and 4024 transitions. Word has length 365 [2019-10-03 04:10:25,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:25,320 INFO L475 AbstractCegarLoop]: Abstraction has 3204 states and 4024 transitions. [2019-10-03 04:10:25,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:10:25,321 INFO L276 IsEmpty]: Start isEmpty. Operand 3204 states and 4024 transitions. [2019-10-03 04:10:25,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-10-03 04:10:25,328 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:25,328 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:25,328 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:25,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:25,329 INFO L82 PathProgramCache]: Analyzing trace with hash 85240782, now seen corresponding path program 1 times [2019-10-03 04:10:25,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:25,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:25,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:25,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:25,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:25,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-10-03 04:10:25,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:10:25,483 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:10:25,483 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 399 with the following transitions: [2019-10-03 04:10:25,484 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [115], [117], [122], [125], [127], [132], [135], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [190], [192], [197], [200], [202], [207], [210], [281], [284], [292], [294], [297], [299], [302], [310], [313], [315], [317], [319], [322], [331], [333], [336], [342], [372], [377], [387], [391], [402], [404], [414], [416], [421], [443], [445], [479], [484], [489], [491], [493], [498], [501], [503], [509], [514], [516], [519], [521], [526], [531], [533], [587], [589], [601], [604], [605], [606], [608] [2019-10-03 04:10:25,487 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:10:25,487 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:10:25,545 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 04:10:26,780 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:10:26,780 INFO L272 AbstractInterpreter]: Visited 101 different actions 2436 times. Merged at 89 different actions 2025 times. Widened at 20 different actions 308 times. Performed 5757 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5757 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 298 fixpoints after 36 different actions. Largest state had 97 variables. [2019-10-03 04:10:26,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:26,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:10:26,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:10:26,781 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:10:26,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:26,812 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:10:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:26,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:10:26,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:10:27,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2019-10-03 04:10:27,045 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:10:27,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2019-10-03 04:10:27,166 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:10:27,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-03 04:10:27,167 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:27,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:10:27,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:10:27,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:27,168 INFO L87 Difference]: Start difference. First operand 3204 states and 4024 transitions. Second operand 3 states. [2019-10-03 04:10:27,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:27,182 INFO L93 Difference]: Finished difference Result 3757 states and 4757 transitions. [2019-10-03 04:10:27,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:10:27,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 398 [2019-10-03 04:10:27,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:27,188 INFO L225 Difference]: With dead ends: 3757 [2019-10-03 04:10:27,189 INFO L226 Difference]: Without dead ends: 3757 [2019-10-03 04:10:27,189 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 796 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:27,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3757 states. [2019-10-03 04:10:27,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3757 to 3114. [2019-10-03 04:10:27,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2019-10-03 04:10:27,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 3923 transitions. [2019-10-03 04:10:27,225 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 3923 transitions. Word has length 398 [2019-10-03 04:10:27,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:27,226 INFO L475 AbstractCegarLoop]: Abstraction has 3114 states and 3923 transitions. [2019-10-03 04:10:27,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:10:27,226 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 3923 transitions. [2019-10-03 04:10:27,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2019-10-03 04:10:27,234 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:27,235 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-03 04:10:27,235 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:27,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:27,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1661102763, now seen corresponding path program 1 times [2019-10-03 04:10:27,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:27,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:27,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:27,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:27,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:27,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2019-10-03 04:10:27,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:10:27,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:10:27,457 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 539 with the following transitions: [2019-10-03 04:10:27,457 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [115], [117], [122], [125], [127], [132], [135], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [190], [192], [197], [200], [202], [207], [210], [281], [284], [292], [294], [297], [299], [302], [310], [315], [317], [319], [322], [331], [333], [336], [342], [372], [377], [387], [391], [402], [404], [414], [416], [421], [443], [445], [479], [484], [489], [491], [493], [498], [501], [503], [509], [514], [516], [519], [521], [526], [531], [533], [587], [589], [601], [604], [605], [606], [608] [2019-10-03 04:10:27,459 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:10:27,459 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:10:27,506 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 04:10:28,329 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:10:28,329 INFO L272 AbstractInterpreter]: Visited 100 different actions 2117 times. Merged at 86 different actions 1752 times. Widened at 18 different actions 251 times. Performed 4872 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4872 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 232 fixpoints after 27 different actions. Largest state had 97 variables. [2019-10-03 04:10:28,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:28,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:10:28,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:10:28,330 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:10:28,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:28,358 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:10:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:28,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:10:28,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:10:28,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2019-10-03 04:10:28,596 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:10:28,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2019-10-03 04:10:28,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 04:10:28,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-03 04:10:28,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 04:10:28,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:10:28,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:10:28,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:28,728 INFO L87 Difference]: Start difference. First operand 3114 states and 3923 transitions. Second operand 4 states. [2019-10-03 04:10:29,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:29,065 INFO L93 Difference]: Finished difference Result 4271 states and 5347 transitions. [2019-10-03 04:10:29,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:10:29,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 538 [2019-10-03 04:10:29,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:29,072 INFO L225 Difference]: With dead ends: 4271 [2019-10-03 04:10:29,072 INFO L226 Difference]: Without dead ends: 4217 [2019-10-03 04:10:29,072 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1081 GetRequests, 1076 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:10:29,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4217 states. [2019-10-03 04:10:29,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4217 to 3198. [2019-10-03 04:10:29,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3198 states. [2019-10-03 04:10:29,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3198 states to 3198 states and 4035 transitions. [2019-10-03 04:10:29,110 INFO L78 Accepts]: Start accepts. Automaton has 3198 states and 4035 transitions. Word has length 538 [2019-10-03 04:10:29,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:29,111 INFO L475 AbstractCegarLoop]: Abstraction has 3198 states and 4035 transitions. [2019-10-03 04:10:29,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:10:29,111 INFO L276 IsEmpty]: Start isEmpty. Operand 3198 states and 4035 transitions. [2019-10-03 04:10:29,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2019-10-03 04:10:29,119 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:29,120 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 11, 11, 8, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:29,120 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:29,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:29,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1238623897, now seen corresponding path program 1 times [2019-10-03 04:10:29,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:29,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:29,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:29,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:29,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:29,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 2066 proven. 0 refuted. 0 times theorem prover too weak. 1910 trivial. 0 not checked. [2019-10-03 04:10:29,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:29,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:10:29,401 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:29,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:10:29,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:10:29,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:10:29,402 INFO L87 Difference]: Start difference. First operand 3198 states and 4035 transitions. Second operand 3 states. [2019-10-03 04:10:29,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:29,531 INFO L93 Difference]: Finished difference Result 3450 states and 4321 transitions. [2019-10-03 04:10:29,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:10:29,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 600 [2019-10-03 04:10:29,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:29,537 INFO L225 Difference]: With dead ends: 3450 [2019-10-03 04:10:29,537 INFO L226 Difference]: Without dead ends: 3450 [2019-10-03 04:10:29,537 INFO L640 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 [2019-10-03 04:10:29,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3450 states. [2019-10-03 04:10:29,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3450 to 3436. [2019-10-03 04:10:29,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3436 states. [2019-10-03 04:10:29,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3436 states to 3436 states and 4307 transitions. [2019-10-03 04:10:29,573 INFO L78 Accepts]: Start accepts. Automaton has 3436 states and 4307 transitions. Word has length 600 [2019-10-03 04:10:29,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:29,574 INFO L475 AbstractCegarLoop]: Abstraction has 3436 states and 4307 transitions. [2019-10-03 04:10:29,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:10:29,575 INFO L276 IsEmpty]: Start isEmpty. Operand 3436 states and 4307 transitions. [2019-10-03 04:10:29,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2019-10-03 04:10:29,583 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:29,584 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 10, 8, 8, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-03 04:10:29,584 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:29,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:29,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1437228011, now seen corresponding path program 1 times [2019-10-03 04:10:29,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:29,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:29,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:29,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:29,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:29,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4945 backedges. 2605 proven. 0 refuted. 0 times theorem prover too weak. 2340 trivial. 0 not checked. [2019-10-03 04:10:29,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:29,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:10:29,897 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:29,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:10:29,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:10:29,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:10:29,898 INFO L87 Difference]: Start difference. First operand 3436 states and 4307 transitions. Second operand 3 states. [2019-10-03 04:10:30,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:30,041 INFO L93 Difference]: Finished difference Result 3431 states and 4232 transitions. [2019-10-03 04:10:30,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:10:30,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 662 [2019-10-03 04:10:30,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:30,047 INFO L225 Difference]: With dead ends: 3431 [2019-10-03 04:10:30,047 INFO L226 Difference]: Without dead ends: 3431 [2019-10-03 04:10:30,047 INFO L640 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 [2019-10-03 04:10:30,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3431 states. [2019-10-03 04:10:30,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3431 to 3429. [2019-10-03 04:10:30,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3429 states. [2019-10-03 04:10:30,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3429 states to 3429 states and 4230 transitions. [2019-10-03 04:10:30,082 INFO L78 Accepts]: Start accepts. Automaton has 3429 states and 4230 transitions. Word has length 662 [2019-10-03 04:10:30,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:30,083 INFO L475 AbstractCegarLoop]: Abstraction has 3429 states and 4230 transitions. [2019-10-03 04:10:30,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:10:30,083 INFO L276 IsEmpty]: Start isEmpty. Operand 3429 states and 4230 transitions. [2019-10-03 04:10:30,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2019-10-03 04:10:30,092 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:30,092 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 21, 21, 19, 19, 17, 17, 15, 15, 15, 15, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-03 04:10:30,093 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:30,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:30,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1078284281, now seen corresponding path program 1 times [2019-10-03 04:10:30,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:30,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:30,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:30,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:30,096 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:30,518 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2019-10-03 04:10:30,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:10:30,518 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:10:30,519 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 729 with the following transitions: [2019-10-03 04:10:30,519 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [115], [117], [122], [125], [127], [132], [135], [137], [142], [147], [152], [155], [157], [160], [162], [167], [170], [172], [177], [180], [182], [187], [190], [192], [197], [200], [202], [207], [210], [281], [284], [292], [294], [297], [299], [302], [310], [315], [317], [319], [322], [331], [333], [336], [342], [372], [377], [387], [391], [402], [404], [414], [416], [421], [443], [445], [447], [452], [457], [462], [465], [470], [472], [477], [479], [484], [489], [491], [493], [498], [501], [503], [509], [514], [516], [519], [521], [526], [531], [533], [587], [589], [601], [604], [605], [606], [608] [2019-10-03 04:10:30,521 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:10:30,521 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:10:30,574 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 04:10:31,392 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:10:31,392 INFO L272 AbstractInterpreter]: Visited 111 different actions 2336 times. Merged at 94 different actions 1882 times. Widened at 21 different actions 288 times. Performed 5547 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5547 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 286 fixpoints after 33 different actions. Largest state had 101 variables. [2019-10-03 04:10:31,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:31,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:10:31,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:10:31,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:10:31,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:31,427 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:10:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:31,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 1139 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:10:31,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:10:31,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2019-10-03 04:10:31,753 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:10:32,002 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2019-10-03 04:10:32,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 04:10:32,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-03 04:10:32,007 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 04:10:32,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:10:32,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:10:32,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:32,008 INFO L87 Difference]: Start difference. First operand 3429 states and 4230 transitions. Second operand 4 states. [2019-10-03 04:10:32,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:32,203 INFO L93 Difference]: Finished difference Result 2908 states and 3540 transitions. [2019-10-03 04:10:32,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:10:32,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 728 [2019-10-03 04:10:32,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:32,208 INFO L225 Difference]: With dead ends: 2908 [2019-10-03 04:10:32,209 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 04:10:32,209 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1461 GetRequests, 1456 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:10:32,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 04:10:32,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 04:10:32,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 04:10:32,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 04:10:32,210 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 728 [2019-10-03 04:10:32,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:32,210 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 04:10:32,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:10:32,210 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 04:10:32,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 04:10:32,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 04:10:32 BoogieIcfgContainer [2019-10-03 04:10:32,215 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 04:10:32,218 INFO L168 Benchmark]: Toolchain (without parser) took 80739.30 ms. Allocated memory was 132.1 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 86.4 MB in the beginning and 838.0 MB in the end (delta: -751.6 MB). Peak memory consumption was 479.4 MB. Max. memory is 7.1 GB. [2019-10-03 04:10:32,219 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 132.1 MB. Free memory was 105.1 MB in the beginning and 104.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 04:10:32,219 INFO L168 Benchmark]: CACSL2BoogieTranslator took 548.86 ms. Allocated memory was 132.1 MB in the beginning and 199.2 MB in the end (delta: 67.1 MB). Free memory was 86.2 MB in the beginning and 170.4 MB in the end (delta: -84.2 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2019-10-03 04:10:32,220 INFO L168 Benchmark]: Boogie Preprocessor took 61.80 ms. Allocated memory is still 199.2 MB. Free memory was 170.4 MB in the beginning and 167.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-10-03 04:10:32,221 INFO L168 Benchmark]: RCFGBuilder took 874.95 ms. Allocated memory is still 199.2 MB. Free memory was 167.9 MB in the beginning and 117.4 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-10-03 04:10:32,221 INFO L168 Benchmark]: TraceAbstraction took 79249.21 ms. Allocated memory was 199.2 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 116.7 MB in the beginning and 838.0 MB in the end (delta: -721.2 MB). Peak memory consumption was 442.7 MB. Max. memory is 7.1 GB. [2019-10-03 04:10:32,224 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 132.1 MB. Free memory was 105.1 MB in the beginning and 104.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 548.86 ms. Allocated memory was 132.1 MB in the beginning and 199.2 MB in the end (delta: 67.1 MB). Free memory was 86.2 MB in the beginning and 170.4 MB in the end (delta: -84.2 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.80 ms. Allocated memory is still 199.2 MB. Free memory was 170.4 MB in the beginning and 167.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 874.95 ms. Allocated memory is still 199.2 MB. Free memory was 167.9 MB in the beginning and 117.4 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 79249.21 ms. Allocated memory was 199.2 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 116.7 MB in the beginning and 838.0 MB in the end (delta: -721.2 MB). Peak memory consumption was 442.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 608]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 149 locations, 1 error locations. SAFE Result, 79.1s OverallTime, 39 OverallIterations, 24 TraceHistogramMax, 55.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7873 SDtfs, 10182 SDslu, 6591 SDs, 0 SdLazy, 10791 SolverSat, 1485 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6020 GetRequests, 5798 SyntacticMatches, 45 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3010 ImplicationChecksByTransitivity, 9.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6802occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 7.4s AbstIntTime, 8 AbstIntIterations, 1 AbstIntStrong, 0.750554499478248 AbsIntWeakeningRatio, 0.46 AbsIntAvgWeakeningVarsNumRemoved, 36.176 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 39 MinimizatonAttempts, 8976 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 11561 NumberOfCodeBlocks, 11561 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 14293 ConstructedInterpolants, 0 QuantifiedInterpolants, 7000364 SizeOfPredicates, 8 NumberOfNonLiveVariables, 4842 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 53 InterpolantComputations, 37 PerfectInterpolantSequences, 57446/57690 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...