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/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:57:15,403 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:57:15,406 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:57:15,418 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:57:15,419 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:57:15,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:57:15,421 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:57:15,423 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:57:15,425 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:57:15,426 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:57:15,427 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:57:15,428 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:57:15,428 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:57:15,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:57:15,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:57:15,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:57:15,432 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:57:15,433 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:57:15,434 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:57:15,437 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:57:15,438 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:57:15,439 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:57:15,440 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:57:15,441 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:57:15,444 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:57:15,444 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:57:15,444 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:57:15,445 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:57:15,446 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:57:15,447 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:57:15,447 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:57:15,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:57:15,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:57:15,449 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:57:15,450 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:57:15,451 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:57:15,451 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:57:15,451 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:57:15,452 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:57:15,453 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:57:15,453 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:57:15,454 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-09-10 06:57:15,470 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:57:15,470 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:57:15,470 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:57:15,471 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:57:15,471 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:57:15,472 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:57:15,472 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:57:15,472 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:57:15,472 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:57:15,473 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:57:15,473 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:57:15,474 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:57:15,474 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:57:15,474 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:57:15,474 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:57:15,474 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:57:15,475 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:57:15,475 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:57:15,475 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:57:15,475 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:57:15,475 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:57:15,476 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:57:15,476 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:57:15,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:57:15,476 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:57:15,477 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:57:15,477 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:57:15,477 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:57:15,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:57:15,477 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:57:15,506 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:57:15,520 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:57:15,524 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:57:15,525 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:57:15,526 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:57:15,527 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 06:57:15,608 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db0db86c0/6c87cbc151884cde8722548b345da7d6/FLAGdeeffe8d7 [2019-09-10 06:57:16,160 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:57:16,164 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 06:57:16,181 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db0db86c0/6c87cbc151884cde8722548b345da7d6/FLAGdeeffe8d7 [2019-09-10 06:57:16,436 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db0db86c0/6c87cbc151884cde8722548b345da7d6 [2019-09-10 06:57:16,445 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:57:16,447 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:57:16,448 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:57:16,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:57:16,452 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:57:16,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:57:16" (1/1) ... [2019-09-10 06:57:16,456 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68fee3b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:57:16, skipping insertion in model container [2019-09-10 06:57:16,456 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:57:16" (1/1) ... [2019-09-10 06:57:16,464 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:57:16,511 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:57:16,965 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:57:16,981 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:57:17,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:57:17,113 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:57:17,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:57:17 WrapperNode [2019-09-10 06:57:17,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:57:17,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:57:17,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:57:17,115 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:57:17,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:57:17" (1/1) ... [2019-09-10 06:57:17,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:57:17" (1/1) ... [2019-09-10 06:57:17,144 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:57:17" (1/1) ... [2019-09-10 06:57:17,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:57:17" (1/1) ... [2019-09-10 06:57:17,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:57:17" (1/1) ... [2019-09-10 06:57:17,174 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:57:17" (1/1) ... [2019-09-10 06:57:17,178 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:57:17" (1/1) ... [2019-09-10 06:57:17,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:57:17,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:57:17,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:57:17,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:57:17,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:57:17" (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-09-10 06:57:17,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:57:17,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:57:17,262 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:57:17,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:57:17,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:57:17,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:57:17,262 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:57:17,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:57:17,262 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:57:17,263 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:57:17,263 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:57:17,263 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:57:17,263 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:57:17,263 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:57:17,263 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:57:17,264 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:57:17,264 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:57:17,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:57:17,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:57:18,239 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:57:18,240 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:57:18,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:57:18 BoogieIcfgContainer [2019-09-10 06:57:18,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:57:18,243 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:57:18,243 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:57:18,246 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:57:18,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:57:16" (1/3) ... [2019-09-10 06:57:18,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@759fd138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:57:18, skipping insertion in model container [2019-09-10 06:57:18,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:57:17" (2/3) ... [2019-09-10 06:57:18,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@759fd138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:57:18, skipping insertion in model container [2019-09-10 06:57:18,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:57:18" (3/3) ... [2019-09-10 06:57:18,250 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 06:57:18,260 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:57:18,268 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:57:18,286 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:57:18,313 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:57:18,313 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:57:18,313 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:57:18,314 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:57:18,314 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:57:18,314 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:57:18,314 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:57:18,314 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:57:18,334 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states. [2019-09-10 06:57:18,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:57:18,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:18,349 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:57:18,351 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:18,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:18,356 INFO L82 PathProgramCache]: Analyzing trace with hash 683550828, now seen corresponding path program 1 times [2019-09-10 06:57:18,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:18,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:18,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:18,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:18,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:18,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:18,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:18,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:57:18,982 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:18,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:57:19,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:57:19,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:57:19,008 INFO L87 Difference]: Start difference. First operand 176 states. Second operand 7 states. [2019-09-10 06:57:19,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:19,516 INFO L93 Difference]: Finished difference Result 1014 states and 1583 transitions. [2019-09-10 06:57:19,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:57:19,518 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-09-10 06:57:19,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:19,550 INFO L225 Difference]: With dead ends: 1014 [2019-09-10 06:57:19,550 INFO L226 Difference]: Without dead ends: 966 [2019-09-10 06:57:19,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:57:19,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2019-09-10 06:57:19,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 486. [2019-09-10 06:57:19,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2019-09-10 06:57:19,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 744 transitions. [2019-09-10 06:57:19,672 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 744 transitions. Word has length 68 [2019-09-10 06:57:19,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:19,673 INFO L475 AbstractCegarLoop]: Abstraction has 486 states and 744 transitions. [2019-09-10 06:57:19,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:57:19,673 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 744 transitions. [2019-09-10 06:57:19,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:57:19,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:19,677 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:57:19,677 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:19,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:19,678 INFO L82 PathProgramCache]: Analyzing trace with hash -544332480, now seen corresponding path program 1 times [2019-09-10 06:57:19,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:19,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:19,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:19,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:19,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:19,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:19,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:19,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:57:19,958 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:19,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:57:19,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:57:19,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:57:19,969 INFO L87 Difference]: Start difference. First operand 486 states and 744 transitions. Second operand 6 states. [2019-09-10 06:57:20,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:20,205 INFO L93 Difference]: Finished difference Result 1323 states and 2025 transitions. [2019-09-10 06:57:20,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:57:20,205 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-10 06:57:20,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:20,212 INFO L225 Difference]: With dead ends: 1323 [2019-09-10 06:57:20,213 INFO L226 Difference]: Without dead ends: 1323 [2019-09-10 06:57:20,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:57:20,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2019-09-10 06:57:20,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1317. [2019-09-10 06:57:20,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1317 states. [2019-09-10 06:57:20,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 2022 transitions. [2019-09-10 06:57:20,256 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 2022 transitions. Word has length 69 [2019-09-10 06:57:20,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:20,256 INFO L475 AbstractCegarLoop]: Abstraction has 1317 states and 2022 transitions. [2019-09-10 06:57:20,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:57:20,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 2022 transitions. [2019-09-10 06:57:20,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:57:20,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:20,261 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:57:20,261 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:20,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:20,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1350032547, now seen corresponding path program 1 times [2019-09-10 06:57:20,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:20,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:20,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:20,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:20,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:20,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:20,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:20,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:57:20,420 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:20,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:57:20,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:57:20,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:57:20,422 INFO L87 Difference]: Start difference. First operand 1317 states and 2022 transitions. Second operand 6 states. [2019-09-10 06:57:20,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:20,803 INFO L93 Difference]: Finished difference Result 3446 states and 5305 transitions. [2019-09-10 06:57:20,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:57:20,804 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-10 06:57:20,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:20,826 INFO L225 Difference]: With dead ends: 3446 [2019-09-10 06:57:20,826 INFO L226 Difference]: Without dead ends: 3446 [2019-09-10 06:57:20,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:57:20,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3446 states. [2019-09-10 06:57:20,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3446 to 3442. [2019-09-10 06:57:20,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3442 states. [2019-09-10 06:57:20,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3442 states to 3442 states and 5303 transitions. [2019-09-10 06:57:20,911 INFO L78 Accepts]: Start accepts. Automaton has 3442 states and 5303 transitions. Word has length 70 [2019-09-10 06:57:20,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:20,912 INFO L475 AbstractCegarLoop]: Abstraction has 3442 states and 5303 transitions. [2019-09-10 06:57:20,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:57:20,913 INFO L276 IsEmpty]: Start isEmpty. Operand 3442 states and 5303 transitions. [2019-09-10 06:57:20,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:57:20,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:20,916 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:57:20,916 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:20,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:20,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1943826305, now seen corresponding path program 1 times [2019-09-10 06:57:20,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:20,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:20,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:20,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:20,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:21,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:21,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:21,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:57:21,055 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:21,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:57:21,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:57:21,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:57:21,057 INFO L87 Difference]: Start difference. First operand 3442 states and 5303 transitions. Second operand 6 states. [2019-09-10 06:57:21,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:21,426 INFO L93 Difference]: Finished difference Result 9320 states and 14350 transitions. [2019-09-10 06:57:21,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:57:21,427 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-10 06:57:21,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:21,485 INFO L225 Difference]: With dead ends: 9320 [2019-09-10 06:57:21,485 INFO L226 Difference]: Without dead ends: 9320 [2019-09-10 06:57:21,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:57:21,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9320 states. [2019-09-10 06:57:21,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9320 to 8301. [2019-09-10 06:57:21,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8301 states. [2019-09-10 06:57:21,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8301 states to 8301 states and 12771 transitions. [2019-09-10 06:57:21,785 INFO L78 Accepts]: Start accepts. Automaton has 8301 states and 12771 transitions. Word has length 70 [2019-09-10 06:57:21,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:21,788 INFO L475 AbstractCegarLoop]: Abstraction has 8301 states and 12771 transitions. [2019-09-10 06:57:21,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:57:21,789 INFO L276 IsEmpty]: Start isEmpty. Operand 8301 states and 12771 transitions. [2019-09-10 06:57:21,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:57:21,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:21,792 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:57:21,793 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:21,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:21,793 INFO L82 PathProgramCache]: Analyzing trace with hash -109542418, now seen corresponding path program 1 times [2019-09-10 06:57:21,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:21,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:21,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:21,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:21,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:21,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:21,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:21,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:57:21,979 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:21,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:57:21,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:57:21,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:57:21,983 INFO L87 Difference]: Start difference. First operand 8301 states and 12771 transitions. Second operand 6 states. [2019-09-10 06:57:22,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:22,409 INFO L93 Difference]: Finished difference Result 23591 states and 36103 transitions. [2019-09-10 06:57:22,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:57:22,410 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-10 06:57:22,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:22,523 INFO L225 Difference]: With dead ends: 23591 [2019-09-10 06:57:22,524 INFO L226 Difference]: Without dead ends: 23591 [2019-09-10 06:57:22,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:57:22,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23591 states. [2019-09-10 06:57:23,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23591 to 23587. [2019-09-10 06:57:23,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23587 states. [2019-09-10 06:57:23,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23587 states to 23587 states and 36101 transitions. [2019-09-10 06:57:23,288 INFO L78 Accepts]: Start accepts. Automaton has 23587 states and 36101 transitions. Word has length 70 [2019-09-10 06:57:23,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:23,288 INFO L475 AbstractCegarLoop]: Abstraction has 23587 states and 36101 transitions. [2019-09-10 06:57:23,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:57:23,288 INFO L276 IsEmpty]: Start isEmpty. Operand 23587 states and 36101 transitions. [2019-09-10 06:57:23,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:57:23,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:23,291 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:57:23,292 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:23,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:23,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1108561564, now seen corresponding path program 1 times [2019-09-10 06:57:23,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:23,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:23,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:23,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:23,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:23,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:23,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:23,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:57:23,389 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:23,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:57:23,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:57:23,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:57:23,390 INFO L87 Difference]: Start difference. First operand 23587 states and 36101 transitions. Second operand 5 states. [2019-09-10 06:57:23,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:23,791 INFO L93 Difference]: Finished difference Result 41437 states and 63031 transitions. [2019-09-10 06:57:23,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:57:23,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 06:57:23,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:24,573 INFO L225 Difference]: With dead ends: 41437 [2019-09-10 06:57:24,574 INFO L226 Difference]: Without dead ends: 41437 [2019-09-10 06:57:24,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-09-10 06:57:24,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41437 states. [2019-09-10 06:57:25,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41437 to 41435. [2019-09-10 06:57:25,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41435 states. [2019-09-10 06:57:25,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41435 states to 41435 states and 63030 transitions. [2019-09-10 06:57:25,347 INFO L78 Accepts]: Start accepts. Automaton has 41435 states and 63030 transitions. Word has length 71 [2019-09-10 06:57:25,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:25,349 INFO L475 AbstractCegarLoop]: Abstraction has 41435 states and 63030 transitions. [2019-09-10 06:57:25,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:57:25,350 INFO L276 IsEmpty]: Start isEmpty. Operand 41435 states and 63030 transitions. [2019-09-10 06:57:25,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:57:25,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:25,360 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:57:25,361 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:25,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:25,367 INFO L82 PathProgramCache]: Analyzing trace with hash -303530613, now seen corresponding path program 1 times [2019-09-10 06:57:25,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:25,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:25,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:25,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:25,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:25,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:25,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:25,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:57:25,468 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:25,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:57:25,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:57:25,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:57:25,470 INFO L87 Difference]: Start difference. First operand 41435 states and 63030 transitions. Second operand 5 states. [2019-09-10 06:57:25,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:25,707 INFO L93 Difference]: Finished difference Result 69245 states and 104178 transitions. [2019-09-10 06:57:25,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:57:25,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 06:57:25,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:25,880 INFO L225 Difference]: With dead ends: 69245 [2019-09-10 06:57:25,880 INFO L226 Difference]: Without dead ends: 69245 [2019-09-10 06:57:25,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-09-10 06:57:25,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69245 states. [2019-09-10 06:57:26,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69245 to 42119. [2019-09-10 06:57:26,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42119 states. [2019-09-10 06:57:28,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42119 states to 42119 states and 63507 transitions. [2019-09-10 06:57:28,436 INFO L78 Accepts]: Start accepts. Automaton has 42119 states and 63507 transitions. Word has length 71 [2019-09-10 06:57:28,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:28,438 INFO L475 AbstractCegarLoop]: Abstraction has 42119 states and 63507 transitions. [2019-09-10 06:57:28,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:57:28,438 INFO L276 IsEmpty]: Start isEmpty. Operand 42119 states and 63507 transitions. [2019-09-10 06:57:28,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:57:28,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:28,450 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:57:28,450 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:28,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:28,451 INFO L82 PathProgramCache]: Analyzing trace with hash -561080171, now seen corresponding path program 1 times [2019-09-10 06:57:28,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:28,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:28,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:28,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:28,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:28,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:28,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:28,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:57:28,602 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:28,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:57:28,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:57:28,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:57:28,604 INFO L87 Difference]: Start difference. First operand 42119 states and 63507 transitions. Second operand 4 states. [2019-09-10 06:57:28,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:28,862 INFO L93 Difference]: Finished difference Result 68638 states and 102520 transitions. [2019-09-10 06:57:28,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:57:28,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-09-10 06:57:28,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:29,108 INFO L225 Difference]: With dead ends: 68638 [2019-09-10 06:57:29,109 INFO L226 Difference]: Without dead ends: 68638 [2019-09-10 06:57:29,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:57:29,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68638 states. [2019-09-10 06:57:30,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68638 to 68636. [2019-09-10 06:57:30,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68636 states. [2019-09-10 06:57:30,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68636 states to 68636 states and 102519 transitions. [2019-09-10 06:57:30,220 INFO L78 Accepts]: Start accepts. Automaton has 68636 states and 102519 transitions. Word has length 72 [2019-09-10 06:57:30,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:30,221 INFO L475 AbstractCegarLoop]: Abstraction has 68636 states and 102519 transitions. [2019-09-10 06:57:30,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:57:30,221 INFO L276 IsEmpty]: Start isEmpty. Operand 68636 states and 102519 transitions. [2019-09-10 06:57:30,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:57:30,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:30,225 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:57:30,226 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:30,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:30,226 INFO L82 PathProgramCache]: Analyzing trace with hash 2048899875, now seen corresponding path program 1 times [2019-09-10 06:57:30,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:30,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:30,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:30,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:30,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:30,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:30,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:30,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:57:30,319 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:30,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:57:30,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:57:30,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:57:30,320 INFO L87 Difference]: Start difference. First operand 68636 states and 102519 transitions. Second operand 7 states. [2019-09-10 06:57:34,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:34,615 INFO L93 Difference]: Finished difference Result 433851 states and 642636 transitions. [2019-09-10 06:57:34,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:57:34,616 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-09-10 06:57:34,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:35,836 INFO L225 Difference]: With dead ends: 433851 [2019-09-10 06:57:35,836 INFO L226 Difference]: Without dead ends: 433851 [2019-09-10 06:57:35,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:57:36,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433851 states. [2019-09-10 06:57:40,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433851 to 68750. [2019-09-10 06:57:40,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68750 states. [2019-09-10 06:57:40,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68750 states to 68750 states and 102669 transitions. [2019-09-10 06:57:40,925 INFO L78 Accepts]: Start accepts. Automaton has 68750 states and 102669 transitions. Word has length 73 [2019-09-10 06:57:40,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:40,926 INFO L475 AbstractCegarLoop]: Abstraction has 68750 states and 102669 transitions. [2019-09-10 06:57:40,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:57:40,926 INFO L276 IsEmpty]: Start isEmpty. Operand 68750 states and 102669 transitions. [2019-09-10 06:57:40,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:57:40,931 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:40,931 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:57:40,932 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:40,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:40,932 INFO L82 PathProgramCache]: Analyzing trace with hash 238965989, now seen corresponding path program 1 times [2019-09-10 06:57:40,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:40,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:40,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:40,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:40,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:40,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:40,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:40,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:57:40,989 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:40,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:57:40,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:57:40,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:57:40,991 INFO L87 Difference]: Start difference. First operand 68750 states and 102669 transitions. Second operand 3 states. [2019-09-10 06:57:41,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:41,258 INFO L93 Difference]: Finished difference Result 91446 states and 133936 transitions. [2019-09-10 06:57:41,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:57:41,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-10 06:57:41,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:41,400 INFO L225 Difference]: With dead ends: 91446 [2019-09-10 06:57:41,401 INFO L226 Difference]: Without dead ends: 91446 [2019-09-10 06:57:41,401 INFO L628 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-09-10 06:57:41,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91446 states. [2019-09-10 06:57:42,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91446 to 90109. [2019-09-10 06:57:42,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90109 states. [2019-09-10 06:57:42,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90109 states to 90109 states and 132600 transitions. [2019-09-10 06:57:42,693 INFO L78 Accepts]: Start accepts. Automaton has 90109 states and 132600 transitions. Word has length 73 [2019-09-10 06:57:42,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:42,696 INFO L475 AbstractCegarLoop]: Abstraction has 90109 states and 132600 transitions. [2019-09-10 06:57:42,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:57:42,697 INFO L276 IsEmpty]: Start isEmpty. Operand 90109 states and 132600 transitions. [2019-09-10 06:57:42,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:57:42,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:42,702 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:57:42,703 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:42,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:42,703 INFO L82 PathProgramCache]: Analyzing trace with hash -346722011, now seen corresponding path program 1 times [2019-09-10 06:57:42,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:42,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:42,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:42,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:42,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:42,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:42,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:42,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:42,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:57:42,755 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:42,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:57:42,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:57:42,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:57:42,756 INFO L87 Difference]: Start difference. First operand 90109 states and 132600 transitions. Second operand 3 states. [2019-09-10 06:57:43,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:43,118 INFO L93 Difference]: Finished difference Result 122975 states and 177984 transitions. [2019-09-10 06:57:43,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:57:43,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-10 06:57:43,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:43,262 INFO L225 Difference]: With dead ends: 122975 [2019-09-10 06:57:43,262 INFO L226 Difference]: Without dead ends: 122975 [2019-09-10 06:57:43,262 INFO L628 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-09-10 06:57:43,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122975 states. [2019-09-10 06:57:46,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122975 to 87305. [2019-09-10 06:57:46,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87305 states. [2019-09-10 06:57:46,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87305 states to 87305 states and 126690 transitions. [2019-09-10 06:57:46,674 INFO L78 Accepts]: Start accepts. Automaton has 87305 states and 126690 transitions. Word has length 73 [2019-09-10 06:57:46,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:46,674 INFO L475 AbstractCegarLoop]: Abstraction has 87305 states and 126690 transitions. [2019-09-10 06:57:46,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:57:46,674 INFO L276 IsEmpty]: Start isEmpty. Operand 87305 states and 126690 transitions. [2019-09-10 06:57:46,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:57:46,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:46,679 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:57:46,679 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:46,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:46,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1044647045, now seen corresponding path program 1 times [2019-09-10 06:57:46,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:46,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:46,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:46,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:46,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:46,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:46,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:46,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:57:46,765 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:46,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:57:46,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:57:46,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:57:46,766 INFO L87 Difference]: Start difference. First operand 87305 states and 126690 transitions. Second operand 7 states. [2019-09-10 06:57:48,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:48,636 INFO L93 Difference]: Finished difference Result 455583 states and 653363 transitions. [2019-09-10 06:57:48,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:57:48,637 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-09-10 06:57:48,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:49,320 INFO L225 Difference]: With dead ends: 455583 [2019-09-10 06:57:49,320 INFO L226 Difference]: Without dead ends: 455583 [2019-09-10 06:57:49,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:57:52,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455583 states. [2019-09-10 06:57:54,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455583 to 87541. [2019-09-10 06:57:54,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87541 states. [2019-09-10 06:57:54,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87541 states to 87541 states and 127010 transitions. [2019-09-10 06:57:54,958 INFO L78 Accepts]: Start accepts. Automaton has 87541 states and 127010 transitions. Word has length 73 [2019-09-10 06:57:54,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:54,958 INFO L475 AbstractCegarLoop]: Abstraction has 87541 states and 127010 transitions. [2019-09-10 06:57:54,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:57:54,958 INFO L276 IsEmpty]: Start isEmpty. Operand 87541 states and 127010 transitions. [2019-09-10 06:57:54,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:57:54,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:54,963 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:57:54,963 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:54,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:54,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1268901397, now seen corresponding path program 1 times [2019-09-10 06:57:54,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:54,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:54,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:54,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:54,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:55,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:55,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:55,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:57:55,020 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:55,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:57:55,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:57:55,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:57:55,021 INFO L87 Difference]: Start difference. First operand 87541 states and 127010 transitions. Second operand 3 states. [2019-09-10 06:57:55,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:55,349 INFO L93 Difference]: Finished difference Result 109563 states and 154784 transitions. [2019-09-10 06:57:55,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:57:55,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-10 06:57:55,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:55,482 INFO L225 Difference]: With dead ends: 109563 [2019-09-10 06:57:55,482 INFO L226 Difference]: Without dead ends: 109563 [2019-09-10 06:57:55,482 INFO L628 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-09-10 06:57:55,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109563 states. [2019-09-10 06:57:56,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109563 to 108257. [2019-09-10 06:57:56,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108257 states. [2019-09-10 06:57:57,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108257 states to 108257 states and 153474 transitions. [2019-09-10 06:57:57,031 INFO L78 Accepts]: Start accepts. Automaton has 108257 states and 153474 transitions. Word has length 74 [2019-09-10 06:57:57,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:57,031 INFO L475 AbstractCegarLoop]: Abstraction has 108257 states and 153474 transitions. [2019-09-10 06:57:57,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:57:57,031 INFO L276 IsEmpty]: Start isEmpty. Operand 108257 states and 153474 transitions. [2019-09-10 06:57:57,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:57:57,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:57,037 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:57:57,038 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:57,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:57,038 INFO L82 PathProgramCache]: Analyzing trace with hash 630444013, now seen corresponding path program 1 times [2019-09-10 06:57:57,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:57,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:57,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:57,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:57,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:57,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:57,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:57,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:57:57,149 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:57,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:57:57,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:57:57,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:57:57,151 INFO L87 Difference]: Start difference. First operand 108257 states and 153474 transitions. Second operand 7 states. [2019-09-10 06:57:58,305 WARN L188 SmtUtils]: Spent 686.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-09-10 06:57:59,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:59,448 INFO L93 Difference]: Finished difference Result 394044 states and 548946 transitions. [2019-09-10 06:57:59,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:57:59,449 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-10 06:57:59,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:00,073 INFO L225 Difference]: With dead ends: 394044 [2019-09-10 06:58:00,073 INFO L226 Difference]: Without dead ends: 394044 [2019-09-10 06:58:00,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:58:00,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394044 states. [2019-09-10 06:58:07,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394044 to 108307. [2019-09-10 06:58:07,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108307 states. [2019-09-10 06:58:07,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108307 states to 108307 states and 153534 transitions. [2019-09-10 06:58:07,665 INFO L78 Accepts]: Start accepts. Automaton has 108307 states and 153534 transitions. Word has length 74 [2019-09-10 06:58:07,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:07,665 INFO L475 AbstractCegarLoop]: Abstraction has 108307 states and 153534 transitions. [2019-09-10 06:58:07,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:58:07,665 INFO L276 IsEmpty]: Start isEmpty. Operand 108307 states and 153534 transitions. [2019-09-10 06:58:07,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:58:07,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:07,672 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:07,672 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:07,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:07,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1809008464, now seen corresponding path program 1 times [2019-09-10 06:58:07,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:07,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:07,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:07,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:07,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:07,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:07,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:07,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:58:07,754 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:07,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:58:07,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:58:07,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:58:07,756 INFO L87 Difference]: Start difference. First operand 108307 states and 153534 transitions. Second operand 6 states. [2019-09-10 06:58:08,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:08,409 INFO L93 Difference]: Finished difference Result 222853 states and 316316 transitions. [2019-09-10 06:58:08,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:58:08,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-09-10 06:58:08,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:08,786 INFO L225 Difference]: With dead ends: 222853 [2019-09-10 06:58:08,786 INFO L226 Difference]: Without dead ends: 222853 [2019-09-10 06:58:08,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:58:08,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222853 states. [2019-09-10 06:58:11,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222853 to 125662. [2019-09-10 06:58:11,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125662 states. [2019-09-10 06:58:11,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125662 states to 125662 states and 178514 transitions. [2019-09-10 06:58:11,456 INFO L78 Accepts]: Start accepts. Automaton has 125662 states and 178514 transitions. Word has length 75 [2019-09-10 06:58:11,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:11,457 INFO L475 AbstractCegarLoop]: Abstraction has 125662 states and 178514 transitions. [2019-09-10 06:58:11,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:58:11,457 INFO L276 IsEmpty]: Start isEmpty. Operand 125662 states and 178514 transitions. [2019-09-10 06:58:11,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:58:11,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:11,463 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:11,464 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:11,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:11,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1271972534, now seen corresponding path program 1 times [2019-09-10 06:58:11,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:11,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:11,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:11,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:11,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:11,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:11,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:11,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:58:11,547 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:11,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:58:11,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:58:11,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:58:11,548 INFO L87 Difference]: Start difference. First operand 125662 states and 178514 transitions. Second operand 6 states. [2019-09-10 06:58:12,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:12,221 INFO L93 Difference]: Finished difference Result 232925 states and 330773 transitions. [2019-09-10 06:58:12,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:58:12,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-09-10 06:58:12,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:12,567 INFO L225 Difference]: With dead ends: 232925 [2019-09-10 06:58:12,567 INFO L226 Difference]: Without dead ends: 232925 [2019-09-10 06:58:12,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:58:12,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232925 states. [2019-09-10 06:58:15,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232925 to 142133. [2019-09-10 06:58:15,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142133 states. [2019-09-10 06:58:19,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142133 states to 142133 states and 202212 transitions. [2019-09-10 06:58:19,349 INFO L78 Accepts]: Start accepts. Automaton has 142133 states and 202212 transitions. Word has length 76 [2019-09-10 06:58:19,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:19,350 INFO L475 AbstractCegarLoop]: Abstraction has 142133 states and 202212 transitions. [2019-09-10 06:58:19,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:58:19,350 INFO L276 IsEmpty]: Start isEmpty. Operand 142133 states and 202212 transitions. [2019-09-10 06:58:19,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:58:19,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:19,356 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:19,356 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:19,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:19,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1040570376, now seen corresponding path program 1 times [2019-09-10 06:58:19,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:19,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:19,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:19,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:19,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:19,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:19,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:19,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:58:19,432 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:19,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:58:19,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:58:19,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:58:19,433 INFO L87 Difference]: Start difference. First operand 142133 states and 202212 transitions. Second operand 6 states. [2019-09-10 06:58:20,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:20,089 INFO L93 Difference]: Finished difference Result 244170 states and 347035 transitions. [2019-09-10 06:58:20,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:58:20,090 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-09-10 06:58:20,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:20,396 INFO L225 Difference]: With dead ends: 244170 [2019-09-10 06:58:20,396 INFO L226 Difference]: Without dead ends: 244170 [2019-09-10 06:58:20,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:58:20,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244170 states. [2019-09-10 06:58:22,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244170 to 157729. [2019-09-10 06:58:22,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157729 states. [2019-09-10 06:58:22,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157729 states to 157729 states and 224582 transitions. [2019-09-10 06:58:22,772 INFO L78 Accepts]: Start accepts. Automaton has 157729 states and 224582 transitions. Word has length 76 [2019-09-10 06:58:22,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:22,772 INFO L475 AbstractCegarLoop]: Abstraction has 157729 states and 224582 transitions. [2019-09-10 06:58:22,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:58:22,773 INFO L276 IsEmpty]: Start isEmpty. Operand 157729 states and 224582 transitions. [2019-09-10 06:58:22,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 06:58:22,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:22,779 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:22,780 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:22,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:22,780 INFO L82 PathProgramCache]: Analyzing trace with hash -742087564, now seen corresponding path program 1 times [2019-09-10 06:58:22,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:22,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:22,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:22,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:22,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:22,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:22,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:22,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:58:22,830 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:22,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:58:22,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:58:22,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:58:22,831 INFO L87 Difference]: Start difference. First operand 157729 states and 224582 transitions. Second operand 3 states. [2019-09-10 06:58:23,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:23,447 INFO L93 Difference]: Finished difference Result 182467 states and 254289 transitions. [2019-09-10 06:58:23,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:58:23,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-10 06:58:23,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:23,966 INFO L225 Difference]: With dead ends: 182467 [2019-09-10 06:58:23,966 INFO L226 Difference]: Without dead ends: 181288 [2019-09-10 06:58:23,966 INFO L628 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-09-10 06:58:24,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181288 states. [2019-09-10 06:58:26,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181288 to 161442. [2019-09-10 06:58:26,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161442 states. [2019-09-10 06:58:26,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161442 states to 161442 states and 226404 transitions. [2019-09-10 06:58:26,447 INFO L78 Accepts]: Start accepts. Automaton has 161442 states and 226404 transitions. Word has length 78 [2019-09-10 06:58:26,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:26,447 INFO L475 AbstractCegarLoop]: Abstraction has 161442 states and 226404 transitions. [2019-09-10 06:58:26,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:58:26,448 INFO L276 IsEmpty]: Start isEmpty. Operand 161442 states and 226404 transitions. [2019-09-10 06:58:26,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 06:58:26,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:26,455 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:26,455 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:26,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:26,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1778262732, now seen corresponding path program 1 times [2019-09-10 06:58:26,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:26,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:26,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:26,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:26,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:26,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:26,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:26,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:58:26,558 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:26,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:58:26,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:58:26,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:58:26,560 INFO L87 Difference]: Start difference. First operand 161442 states and 226404 transitions. Second operand 7 states. [2019-09-10 06:58:28,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:28,832 INFO L93 Difference]: Finished difference Result 670902 states and 925501 transitions. [2019-09-10 06:58:28,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:58:28,833 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2019-09-10 06:58:28,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:31,263 INFO L225 Difference]: With dead ends: 670902 [2019-09-10 06:58:31,264 INFO L226 Difference]: Without dead ends: 670902 [2019-09-10 06:58:31,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:58:31,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670902 states. [2019-09-10 06:58:39,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670902 to 161778. [2019-09-10 06:58:39,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161778 states. [2019-09-10 06:58:40,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161778 states to 161778 states and 226815 transitions. [2019-09-10 06:58:40,152 INFO L78 Accepts]: Start accepts. Automaton has 161778 states and 226815 transitions. Word has length 79 [2019-09-10 06:58:40,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:40,153 INFO L475 AbstractCegarLoop]: Abstraction has 161778 states and 226815 transitions. [2019-09-10 06:58:40,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:58:40,153 INFO L276 IsEmpty]: Start isEmpty. Operand 161778 states and 226815 transitions. [2019-09-10 06:58:40,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 06:58:40,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:40,161 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:40,161 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:40,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:40,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1452335433, now seen corresponding path program 1 times [2019-09-10 06:58:40,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:40,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:40,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:40,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:40,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:40,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:40,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:40,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:58:40,377 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:40,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:58:40,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:58:40,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:58:40,378 INFO L87 Difference]: Start difference. First operand 161778 states and 226815 transitions. Second operand 10 states. [2019-09-10 06:58:44,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:44,316 INFO L93 Difference]: Finished difference Result 613940 states and 857170 transitions. [2019-09-10 06:58:44,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 06:58:44,317 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 80 [2019-09-10 06:58:44,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:45,376 INFO L225 Difference]: With dead ends: 613940 [2019-09-10 06:58:45,376 INFO L226 Difference]: Without dead ends: 613940 [2019-09-10 06:58:45,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=300, Invalid=890, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 06:58:45,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613940 states. [2019-09-10 06:58:54,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613940 to 161778. [2019-09-10 06:58:54,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161778 states. [2019-09-10 06:58:54,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161778 states to 161778 states and 226801 transitions. [2019-09-10 06:58:54,421 INFO L78 Accepts]: Start accepts. Automaton has 161778 states and 226801 transitions. Word has length 80 [2019-09-10 06:58:54,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:54,422 INFO L475 AbstractCegarLoop]: Abstraction has 161778 states and 226801 transitions. [2019-09-10 06:58:54,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:58:54,422 INFO L276 IsEmpty]: Start isEmpty. Operand 161778 states and 226801 transitions. [2019-09-10 06:58:54,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:58:54,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:54,430 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:54,430 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:54,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:54,430 INFO L82 PathProgramCache]: Analyzing trace with hash -295195487, now seen corresponding path program 1 times [2019-09-10 06:58:54,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:54,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:54,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:54,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:54,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:54,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:54,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:54,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:58:54,661 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:54,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:58:54,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:58:54,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:58:54,663 INFO L87 Difference]: Start difference. First operand 161778 states and 226801 transitions. Second operand 10 states. [2019-09-10 06:58:58,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:58,548 INFO L93 Difference]: Finished difference Result 718399 states and 998985 transitions. [2019-09-10 06:58:58,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 06:58:58,549 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2019-09-10 06:58:58,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:01,120 INFO L225 Difference]: With dead ends: 718399 [2019-09-10 06:59:01,121 INFO L226 Difference]: Without dead ends: 718399 [2019-09-10 06:59:01,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=287, Invalid=903, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 06:59:01,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718399 states. [2019-09-10 06:59:10,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718399 to 161619. [2019-09-10 06:59:10,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161619 states. [2019-09-10 06:59:11,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161619 states to 161619 states and 226548 transitions. [2019-09-10 06:59:11,634 INFO L78 Accepts]: Start accepts. Automaton has 161619 states and 226548 transitions. Word has length 81 [2019-09-10 06:59:11,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:11,634 INFO L475 AbstractCegarLoop]: Abstraction has 161619 states and 226548 transitions. [2019-09-10 06:59:11,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:59:11,634 INFO L276 IsEmpty]: Start isEmpty. Operand 161619 states and 226548 transitions. [2019-09-10 06:59:11,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:59:11,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:11,640 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:11,641 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:11,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:11,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1352363845, now seen corresponding path program 1 times [2019-09-10 06:59:11,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:11,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:11,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:11,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:11,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:11,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:11,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:11,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:59:11,841 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:11,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:59:11,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:59:11,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:59:11,842 INFO L87 Difference]: Start difference. First operand 161619 states and 226548 transitions. Second operand 10 states. [2019-09-10 06:59:15,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:15,907 INFO L93 Difference]: Finished difference Result 690021 states and 959371 transitions. [2019-09-10 06:59:15,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 06:59:15,908 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2019-09-10 06:59:15,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:17,972 INFO L225 Difference]: With dead ends: 690021 [2019-09-10 06:59:17,973 INFO L226 Difference]: Without dead ends: 689976 [2019-09-10 06:59:17,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=345, Invalid=1061, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:59:18,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689976 states. [2019-09-10 06:59:24,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689976 to 161574. [2019-09-10 06:59:24,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161574 states. [2019-09-10 06:59:24,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161574 states to 161574 states and 226398 transitions. [2019-09-10 06:59:24,271 INFO L78 Accepts]: Start accepts. Automaton has 161574 states and 226398 transitions. Word has length 81 [2019-09-10 06:59:24,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:24,272 INFO L475 AbstractCegarLoop]: Abstraction has 161574 states and 226398 transitions. [2019-09-10 06:59:24,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:59:24,272 INFO L276 IsEmpty]: Start isEmpty. Operand 161574 states and 226398 transitions. [2019-09-10 06:59:24,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:59:24,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:24,278 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:24,278 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:24,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:24,278 INFO L82 PathProgramCache]: Analyzing trace with hash 358108481, now seen corresponding path program 1 times [2019-09-10 06:59:24,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:24,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:24,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:24,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:24,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:24,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:24,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:24,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:59:24,455 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:24,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:59:24,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:59:24,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:59:24,456 INFO L87 Difference]: Start difference. First operand 161574 states and 226398 transitions. Second operand 10 states. [2019-09-10 06:59:27,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:27,794 INFO L93 Difference]: Finished difference Result 471304 states and 656981 transitions. [2019-09-10 06:59:27,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 06:59:27,794 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2019-09-10 06:59:27,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:28,537 INFO L225 Difference]: With dead ends: 471304 [2019-09-10 06:59:28,537 INFO L226 Difference]: Without dead ends: 471304 [2019-09-10 06:59:28,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:59:28,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471304 states. [2019-09-10 06:59:35,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471304 to 161333. [2019-09-10 06:59:35,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161333 states. [2019-09-10 06:59:35,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161333 states to 161333 states and 226066 transitions. [2019-09-10 06:59:35,880 INFO L78 Accepts]: Start accepts. Automaton has 161333 states and 226066 transitions. Word has length 81 [2019-09-10 06:59:35,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:35,880 INFO L475 AbstractCegarLoop]: Abstraction has 161333 states and 226066 transitions. [2019-09-10 06:59:35,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:59:35,880 INFO L276 IsEmpty]: Start isEmpty. Operand 161333 states and 226066 transitions. [2019-09-10 06:59:35,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:59:35,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:35,885 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:35,885 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:35,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:35,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1148934946, now seen corresponding path program 1 times [2019-09-10 06:59:35,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:35,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:35,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:35,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:35,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:35,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:36,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:36,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:36,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 06:59:36,298 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:36,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:59:36,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:59:36,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:59:36,299 INFO L87 Difference]: Start difference. First operand 161333 states and 226066 transitions. Second operand 13 states. [2019-09-10 06:59:36,845 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 06:59:37,001 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 06:59:37,209 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 06:59:37,433 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-10 06:59:37,663 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-10 06:59:37,788 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 06:59:38,040 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-09-10 06:59:38,605 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-10 06:59:39,641 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-10 06:59:42,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:42,302 INFO L93 Difference]: Finished difference Result 887914 states and 1237721 transitions. [2019-09-10 06:59:42,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 06:59:42,303 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2019-09-10 06:59:42,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:45,699 INFO L225 Difference]: With dead ends: 887914 [2019-09-10 06:59:45,700 INFO L226 Difference]: Without dead ends: 887914 [2019-09-10 06:59:45,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=338, Invalid=1144, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 06:59:46,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887914 states. [2019-09-10 06:59:58,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887914 to 161268. [2019-09-10 06:59:58,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161268 states. [2019-09-10 06:59:58,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161268 states to 161268 states and 225980 transitions. [2019-09-10 06:59:58,773 INFO L78 Accepts]: Start accepts. Automaton has 161268 states and 225980 transitions. Word has length 81 [2019-09-10 06:59:58,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:58,774 INFO L475 AbstractCegarLoop]: Abstraction has 161268 states and 225980 transitions. [2019-09-10 06:59:58,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:59:58,774 INFO L276 IsEmpty]: Start isEmpty. Operand 161268 states and 225980 transitions. [2019-09-10 06:59:58,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 06:59:58,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:58,780 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:58,780 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:58,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:58,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1069988994, now seen corresponding path program 1 times [2019-09-10 06:59:58,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:58,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:58,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:58,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:58,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:59,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:59,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:59,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 06:59:59,277 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:59,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:59:59,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:59:59,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:59:59,278 INFO L87 Difference]: Start difference. First operand 161268 states and 225980 transitions. Second operand 13 states. [2019-09-10 06:59:59,740 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 06:59:59,900 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 07:00:00,061 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 07:00:00,227 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 07:00:00,480 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 07:00:00,674 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 07:00:00,881 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 07:00:04,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:04,055 INFO L93 Difference]: Finished difference Result 690801 states and 964588 transitions. [2019-09-10 07:00:04,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 07:00:04,055 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 82 [2019-09-10 07:00:04,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:05,065 INFO L225 Difference]: With dead ends: 690801 [2019-09-10 07:00:05,065 INFO L226 Difference]: Without dead ends: 690801 [2019-09-10 07:00:05,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=219, Invalid=593, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:00:05,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690801 states. [2019-09-10 07:00:15,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690801 to 158600. [2019-09-10 07:00:15,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158600 states. [2019-09-10 07:00:15,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158600 states to 158600 states and 222342 transitions. [2019-09-10 07:00:15,553 INFO L78 Accepts]: Start accepts. Automaton has 158600 states and 222342 transitions. Word has length 82 [2019-09-10 07:00:15,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:15,554 INFO L475 AbstractCegarLoop]: Abstraction has 158600 states and 222342 transitions. [2019-09-10 07:00:15,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:00:15,554 INFO L276 IsEmpty]: Start isEmpty. Operand 158600 states and 222342 transitions. [2019-09-10 07:00:15,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:00:15,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:15,557 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:15,558 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:15,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:15,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1540805673, now seen corresponding path program 1 times [2019-09-10 07:00:15,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:15,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:15,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:15,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:15,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:15,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:15,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:15,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:00:15,594 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:15,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:00:15,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:00:15,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:15,595 INFO L87 Difference]: Start difference. First operand 158600 states and 222342 transitions. Second operand 3 states. [2019-09-10 07:00:16,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:16,278 INFO L93 Difference]: Finished difference Result 248024 states and 346820 transitions. [2019-09-10 07:00:16,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:00:16,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-10 07:00:16,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:16,597 INFO L225 Difference]: With dead ends: 248024 [2019-09-10 07:00:16,598 INFO L226 Difference]: Without dead ends: 248024 [2019-09-10 07:00:16,598 INFO L628 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-09-10 07:00:16,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248024 states. [2019-09-10 07:00:19,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248024 to 195468. [2019-09-10 07:00:19,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195468 states. [2019-09-10 07:00:24,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195468 states to 195468 states and 274259 transitions. [2019-09-10 07:00:24,036 INFO L78 Accepts]: Start accepts. Automaton has 195468 states and 274259 transitions. Word has length 82 [2019-09-10 07:00:24,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:24,036 INFO L475 AbstractCegarLoop]: Abstraction has 195468 states and 274259 transitions. [2019-09-10 07:00:24,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:00:24,036 INFO L276 IsEmpty]: Start isEmpty. Operand 195468 states and 274259 transitions. [2019-09-10 07:00:24,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:00:24,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:24,041 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:24,041 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:24,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:24,041 INFO L82 PathProgramCache]: Analyzing trace with hash -2133748491, now seen corresponding path program 1 times [2019-09-10 07:00:24,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:24,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:24,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:24,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:24,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:24,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:24,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:24,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:00:24,086 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:24,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:00:24,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:00:24,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:24,087 INFO L87 Difference]: Start difference. First operand 195468 states and 274259 transitions. Second operand 3 states. [2019-09-10 07:00:24,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:24,824 INFO L93 Difference]: Finished difference Result 290208 states and 406988 transitions. [2019-09-10 07:00:24,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:00:24,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-10 07:00:24,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:25,240 INFO L225 Difference]: With dead ends: 290208 [2019-09-10 07:00:25,241 INFO L226 Difference]: Without dead ends: 290208 [2019-09-10 07:00:25,241 INFO L628 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-09-10 07:00:25,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290208 states. [2019-09-10 07:00:27,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290208 to 181998. [2019-09-10 07:00:27,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181998 states. [2019-09-10 07:00:27,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181998 states to 181998 states and 255235 transitions. [2019-09-10 07:00:27,973 INFO L78 Accepts]: Start accepts. Automaton has 181998 states and 255235 transitions. Word has length 83 [2019-09-10 07:00:27,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:27,974 INFO L475 AbstractCegarLoop]: Abstraction has 181998 states and 255235 transitions. [2019-09-10 07:00:27,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:00:27,974 INFO L276 IsEmpty]: Start isEmpty. Operand 181998 states and 255235 transitions. [2019-09-10 07:00:27,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:00:27,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:27,978 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:27,978 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:27,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:27,979 INFO L82 PathProgramCache]: Analyzing trace with hash -941393586, now seen corresponding path program 1 times [2019-09-10 07:00:27,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:27,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:27,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:27,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:27,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:28,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:28,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:28,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:00:28,034 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:28,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:00:28,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:00:28,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:28,035 INFO L87 Difference]: Start difference. First operand 181998 states and 255235 transitions. Second operand 3 states. [2019-09-10 07:00:29,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:29,364 INFO L93 Difference]: Finished difference Result 174143 states and 241034 transitions. [2019-09-10 07:00:29,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:00:29,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-09-10 07:00:29,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:29,574 INFO L225 Difference]: With dead ends: 174143 [2019-09-10 07:00:29,574 INFO L226 Difference]: Without dead ends: 174143 [2019-09-10 07:00:29,574 INFO L628 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-09-10 07:00:29,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174143 states. [2019-09-10 07:00:30,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174143 to 174141. [2019-09-10 07:00:30,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174141 states. [2019-09-10 07:00:32,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174141 states to 174141 states and 241033 transitions. [2019-09-10 07:00:32,070 INFO L78 Accepts]: Start accepts. Automaton has 174141 states and 241033 transitions. Word has length 85 [2019-09-10 07:00:32,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:32,070 INFO L475 AbstractCegarLoop]: Abstraction has 174141 states and 241033 transitions. [2019-09-10 07:00:32,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:00:32,070 INFO L276 IsEmpty]: Start isEmpty. Operand 174141 states and 241033 transitions. [2019-09-10 07:00:32,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:00:32,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:32,074 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:32,074 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:32,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:32,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1030441745, now seen corresponding path program 1 times [2019-09-10 07:00:32,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:32,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:32,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:32,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:32,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:32,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:32,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:32,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:00:32,128 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:32,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:00:32,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:00:32,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:32,129 INFO L87 Difference]: Start difference. First operand 174141 states and 241033 transitions. Second operand 3 states. [2019-09-10 07:00:32,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:32,539 INFO L93 Difference]: Finished difference Result 165221 states and 225719 transitions. [2019-09-10 07:00:32,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:00:32,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-09-10 07:00:32,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:32,720 INFO L225 Difference]: With dead ends: 165221 [2019-09-10 07:00:32,720 INFO L226 Difference]: Without dead ends: 165221 [2019-09-10 07:00:32,721 INFO L628 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-09-10 07:00:32,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165221 states. [2019-09-10 07:00:37,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165221 to 165219. [2019-09-10 07:00:37,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165219 states. [2019-09-10 07:00:37,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165219 states to 165219 states and 225718 transitions. [2019-09-10 07:00:37,713 INFO L78 Accepts]: Start accepts. Automaton has 165219 states and 225718 transitions. Word has length 86 [2019-09-10 07:00:37,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:37,713 INFO L475 AbstractCegarLoop]: Abstraction has 165219 states and 225718 transitions. [2019-09-10 07:00:37,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:00:37,714 INFO L276 IsEmpty]: Start isEmpty. Operand 165219 states and 225718 transitions. [2019-09-10 07:00:37,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:00:37,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:37,718 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:37,718 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:37,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:37,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1412671193, now seen corresponding path program 1 times [2019-09-10 07:00:37,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:37,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:37,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:37,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:37,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:37,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:37,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:37,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:00:37,759 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:37,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:00:37,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:00:37,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:37,760 INFO L87 Difference]: Start difference. First operand 165219 states and 225718 transitions. Second operand 3 states. [2019-09-10 07:00:38,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:38,312 INFO L93 Difference]: Finished difference Result 258600 states and 352578 transitions. [2019-09-10 07:00:38,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:00:38,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-09-10 07:00:38,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:38,636 INFO L225 Difference]: With dead ends: 258600 [2019-09-10 07:00:38,636 INFO L226 Difference]: Without dead ends: 258600 [2019-09-10 07:00:38,637 INFO L628 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-09-10 07:00:38,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258600 states. [2019-09-10 07:00:40,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258600 to 165013. [2019-09-10 07:00:40,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165013 states. [2019-09-10 07:00:41,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165013 states to 165013 states and 224984 transitions. [2019-09-10 07:00:41,206 INFO L78 Accepts]: Start accepts. Automaton has 165013 states and 224984 transitions. Word has length 87 [2019-09-10 07:00:41,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:41,206 INFO L475 AbstractCegarLoop]: Abstraction has 165013 states and 224984 transitions. [2019-09-10 07:00:41,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:00:41,206 INFO L276 IsEmpty]: Start isEmpty. Operand 165013 states and 224984 transitions. [2019-09-10 07:00:41,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:00:41,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:41,210 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:41,210 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:41,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:41,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1696226700, now seen corresponding path program 1 times [2019-09-10 07:00:41,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:41,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:41,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:41,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:41,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:42,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:42,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:42,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 07:00:42,139 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:42,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 07:00:42,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 07:00:42,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:00:42,140 INFO L87 Difference]: Start difference. First operand 165013 states and 224984 transitions. Second operand 19 states. [2019-09-10 07:00:42,816 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-09-10 07:00:43,009 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-10 07:00:43,334 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 80 [2019-09-10 07:00:43,653 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 87 [2019-09-10 07:00:43,881 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 07:00:44,107 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-10 07:00:44,614 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 07:00:44,841 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 07:00:45,034 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 07:00:47,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:47,413 INFO L93 Difference]: Finished difference Result 281384 states and 383439 transitions. [2019-09-10 07:00:47,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 07:00:47,414 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 87 [2019-09-10 07:00:47,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:47,815 INFO L225 Difference]: With dead ends: 281384 [2019-09-10 07:00:47,815 INFO L226 Difference]: Without dead ends: 281384 [2019-09-10 07:00:47,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=336, Invalid=1224, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 07:00:48,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281384 states. [2019-09-10 07:00:50,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281384 to 164999. [2019-09-10 07:00:50,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164999 states. [2019-09-10 07:00:50,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164999 states to 164999 states and 224966 transitions. [2019-09-10 07:00:50,639 INFO L78 Accepts]: Start accepts. Automaton has 164999 states and 224966 transitions. Word has length 87 [2019-09-10 07:00:50,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:50,640 INFO L475 AbstractCegarLoop]: Abstraction has 164999 states and 224966 transitions. [2019-09-10 07:00:50,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 07:00:50,640 INFO L276 IsEmpty]: Start isEmpty. Operand 164999 states and 224966 transitions. [2019-09-10 07:00:50,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:00:50,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:50,644 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:50,644 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:50,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:50,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1278450960, now seen corresponding path program 1 times [2019-09-10 07:00:50,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:50,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:50,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:50,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:50,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:51,206 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-10 07:00:51,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:51,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:51,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 07:00:51,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:51,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:00:51,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:00:51,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:00:51,561 INFO L87 Difference]: Start difference. First operand 164999 states and 224966 transitions. Second operand 18 states. [2019-09-10 07:00:52,269 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 07:00:52,476 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 07:00:53,117 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-10 07:00:58,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:58,031 INFO L93 Difference]: Finished difference Result 644758 states and 880703 transitions. [2019-09-10 07:00:58,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 07:00:58,031 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 88 [2019-09-10 07:00:58,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:58,858 INFO L225 Difference]: With dead ends: 644758 [2019-09-10 07:00:58,858 INFO L226 Difference]: Without dead ends: 644758 [2019-09-10 07:00:58,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=266, Invalid=1216, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 07:00:59,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644758 states. [2019-09-10 07:01:03,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644758 to 165009. [2019-09-10 07:01:03,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165009 states. [2019-09-10 07:01:03,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165009 states to 165009 states and 224974 transitions. [2019-09-10 07:01:03,305 INFO L78 Accepts]: Start accepts. Automaton has 165009 states and 224974 transitions. Word has length 88 [2019-09-10 07:01:03,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:03,305 INFO L475 AbstractCegarLoop]: Abstraction has 165009 states and 224974 transitions. [2019-09-10 07:01:03,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:01:03,305 INFO L276 IsEmpty]: Start isEmpty. Operand 165009 states and 224974 transitions. [2019-09-10 07:01:04,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 07:01:04,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:04,037 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:01:04,038 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:04,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:04,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1363185992, now seen corresponding path program 1 times [2019-09-10 07:01:04,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:04,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:04,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:04,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:04,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:04,092 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:04,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:04,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:01:04,093 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:04,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:01:04,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:01:04,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:04,094 INFO L87 Difference]: Start difference. First operand 165009 states and 224974 transitions. Second operand 3 states. [2019-09-10 07:01:04,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:04,915 INFO L93 Difference]: Finished difference Result 307914 states and 414853 transitions. [2019-09-10 07:01:04,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:01:04,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-10 07:01:04,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:05,360 INFO L225 Difference]: With dead ends: 307914 [2019-09-10 07:01:05,360 INFO L226 Difference]: Without dead ends: 307914 [2019-09-10 07:01:05,361 INFO L628 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-09-10 07:01:05,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307914 states. [2019-09-10 07:01:08,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307914 to 282073. [2019-09-10 07:01:08,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282073 states. [2019-09-10 07:01:10,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282073 states to 282073 states and 382956 transitions. [2019-09-10 07:01:10,036 INFO L78 Accepts]: Start accepts. Automaton has 282073 states and 382956 transitions. Word has length 95 [2019-09-10 07:01:10,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:10,036 INFO L475 AbstractCegarLoop]: Abstraction has 282073 states and 382956 transitions. [2019-09-10 07:01:10,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:01:10,036 INFO L276 IsEmpty]: Start isEmpty. Operand 282073 states and 382956 transitions. [2019-09-10 07:01:10,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 07:01:10,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:10,047 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:01:10,047 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:10,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:10,047 INFO L82 PathProgramCache]: Analyzing trace with hash 664104665, now seen corresponding path program 1 times [2019-09-10 07:01:10,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:10,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:10,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:10,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:10,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:10,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:10,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:10,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:01:10,101 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:10,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:01:10,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:01:10,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:10,102 INFO L87 Difference]: Start difference. First operand 282073 states and 382956 transitions. Second operand 3 states. [2019-09-10 07:01:11,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:11,341 INFO L93 Difference]: Finished difference Result 537255 states and 714963 transitions. [2019-09-10 07:01:11,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:01:11,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-09-10 07:01:11,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:12,091 INFO L225 Difference]: With dead ends: 537255 [2019-09-10 07:01:12,092 INFO L226 Difference]: Without dead ends: 537255 [2019-09-10 07:01:12,092 INFO L628 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-09-10 07:01:12,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537255 states. [2019-09-10 07:01:22,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537255 to 502066. [2019-09-10 07:01:22,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502066 states. [2019-09-10 07:01:23,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502066 states to 502066 states and 668811 transitions. [2019-09-10 07:01:23,131 INFO L78 Accepts]: Start accepts. Automaton has 502066 states and 668811 transitions. Word has length 96 [2019-09-10 07:01:23,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:23,131 INFO L475 AbstractCegarLoop]: Abstraction has 502066 states and 668811 transitions. [2019-09-10 07:01:23,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:01:23,132 INFO L276 IsEmpty]: Start isEmpty. Operand 502066 states and 668811 transitions. [2019-09-10 07:01:23,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:01:23,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:23,139 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:01:23,139 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:23,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:23,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1910242917, now seen corresponding path program 1 times [2019-09-10 07:01:23,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:23,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:23,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:23,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:23,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:24,300 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:24,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:24,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:01:24,300 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:24,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:01:24,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:01:24,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:24,301 INFO L87 Difference]: Start difference. First operand 502066 states and 668811 transitions. Second operand 3 states. [2019-09-10 07:01:25,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:25,349 INFO L93 Difference]: Finished difference Result 447372 states and 590446 transitions. [2019-09-10 07:01:25,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:01:25,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-10 07:01:25,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:25,942 INFO L225 Difference]: With dead ends: 447372 [2019-09-10 07:01:25,942 INFO L226 Difference]: Without dead ends: 447372 [2019-09-10 07:01:25,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:26,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447372 states. [2019-09-10 07:01:36,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447372 to 348450. [2019-09-10 07:01:36,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348450 states. [2019-09-10 07:01:37,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348450 states to 348450 states and 459881 transitions. [2019-09-10 07:01:37,000 INFO L78 Accepts]: Start accepts. Automaton has 348450 states and 459881 transitions. Word has length 97 [2019-09-10 07:01:37,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:37,000 INFO L475 AbstractCegarLoop]: Abstraction has 348450 states and 459881 transitions. [2019-09-10 07:01:37,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:01:37,001 INFO L276 IsEmpty]: Start isEmpty. Operand 348450 states and 459881 transitions. [2019-09-10 07:01:37,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:01:37,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:37,007 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:01:37,008 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:37,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:37,008 INFO L82 PathProgramCache]: Analyzing trace with hash -331047513, now seen corresponding path program 1 times [2019-09-10 07:01:37,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:37,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:37,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:37,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:37,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:37,052 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:37,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:37,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:01:37,053 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:37,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:01:37,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:01:37,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:37,054 INFO L87 Difference]: Start difference. First operand 348450 states and 459881 transitions. Second operand 3 states. [2019-09-10 07:01:39,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:39,781 INFO L93 Difference]: Finished difference Result 663664 states and 859934 transitions. [2019-09-10 07:01:39,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:01:39,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-10 07:01:39,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:40,526 INFO L225 Difference]: With dead ends: 663664 [2019-09-10 07:01:40,526 INFO L226 Difference]: Without dead ends: 663664 [2019-09-10 07:01:40,526 INFO L628 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-09-10 07:01:40,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663664 states. [2019-09-10 07:01:52,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663664 to 617702. [2019-09-10 07:01:52,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617702 states. [2019-09-10 07:01:53,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617702 states to 617702 states and 804277 transitions. [2019-09-10 07:01:53,605 INFO L78 Accepts]: Start accepts. Automaton has 617702 states and 804277 transitions. Word has length 97 [2019-09-10 07:01:53,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:53,605 INFO L475 AbstractCegarLoop]: Abstraction has 617702 states and 804277 transitions. [2019-09-10 07:01:53,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:01:53,605 INFO L276 IsEmpty]: Start isEmpty. Operand 617702 states and 804277 transitions. [2019-09-10 07:01:53,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:01:53,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:53,613 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 07:01:53,613 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:53,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:53,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1581193289, now seen corresponding path program 1 times [2019-09-10 07:01:53,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:53,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:53,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:53,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:53,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:53,663 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:53,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:53,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:01:53,665 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:53,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:01:53,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:01:53,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:53,667 INFO L87 Difference]: Start difference. First operand 617702 states and 804277 transitions. Second operand 3 states. [2019-09-10 07:02:06,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:06,977 INFO L93 Difference]: Finished difference Result 1007682 states and 1296996 transitions. [2019-09-10 07:02:06,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:02:06,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 07:02:06,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:08,326 INFO L225 Difference]: With dead ends: 1007682 [2019-09-10 07:02:08,326 INFO L226 Difference]: Without dead ends: 1007682 [2019-09-10 07:02:08,326 INFO L628 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-09-10 07:02:08,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007682 states. [2019-09-10 07:02:31,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007682 to 954588. [2019-09-10 07:02:31,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 954588 states. [2019-09-10 07:02:32,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954588 states to 954588 states and 1236331 transitions. [2019-09-10 07:02:32,847 INFO L78 Accepts]: Start accepts. Automaton has 954588 states and 1236331 transitions. Word has length 99 [2019-09-10 07:02:32,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:32,847 INFO L475 AbstractCegarLoop]: Abstraction has 954588 states and 1236331 transitions. [2019-09-10 07:02:32,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:02:32,847 INFO L276 IsEmpty]: Start isEmpty. Operand 954588 states and 1236331 transitions. [2019-09-10 07:02:32,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 07:02:32,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:32,868 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:32,868 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:32,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:32,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1213729166, now seen corresponding path program 1 times [2019-09-10 07:02:32,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:32,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:32,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:32,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:32,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:34,785 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:34,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:02:34,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:02:34,786 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 123 with the following transitions: [2019-09-10 07:02:34,789 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [82], [95], [99], [102], [105], [108], [110], [112], [116], [129], [133], [146], [149], [152], [156], [159], [162], [173], [176], [187], [190], [193], [201], [204], [215], [217], [220], [223], [225], [228], [229], [231], [234], [237], [248], [250], [253], [264], [266], [269], [280], [282], [285], [296], [298], [309], [311], [324], [332], [351], [362], [364], [377], [385], [404], [415], [417], [420], [423], [426], [428], [430], [468], [470], [483], [491], [494], [499], [512], [522], [536], [548], [557], [573], [578], [594], [620], [649], [650], [654], [655], [656] [2019-09-10 07:02:34,843 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:02:34,844 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:02:34,952 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:02:35,495 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:02:35,498 INFO L272 AbstractInterpreter]: Visited 109 different actions 540 times. Merged at 43 different actions 376 times. Widened at 14 different actions 50 times. Performed 1800 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1800 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 54 fixpoints after 14 different actions. Largest state had 138 variables. [2019-09-10 07:02:35,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:35,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:02:35,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:02:35,505 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-09-10 07:02:35,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:35,532 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:02:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:35,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 07:02:35,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:02:35,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:02:35,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:02:36,919 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:36,919 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:02:37,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:02:37,339 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:37,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:02:37,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 24 [2019-09-10 07:02:37,349 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:02:37,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 07:02:37,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 07:02:37,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2019-09-10 07:02:37,350 INFO L87 Difference]: Start difference. First operand 954588 states and 1236331 transitions. Second operand 19 states. [2019-09-10 07:02:37,693 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 07:02:37,946 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-10 07:02:39,401 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-09-10 07:02:41,134 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-10 07:02:41,732 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-10 07:02:42,065 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-09-10 07:02:47,103 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 07:02:49,356 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 07:02:50,091 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 07:02:51,050 WARN L188 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-10 07:02:51,557 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-09-10 07:03:19,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:19,281 INFO L93 Difference]: Finished difference Result 3585011 states and 4583021 transitions. [2019-09-10 07:03:19,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-10 07:03:19,281 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 122 [2019-09-10 07:03:19,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:27,948 INFO L225 Difference]: With dead ends: 3585011 [2019-09-10 07:03:27,949 INFO L226 Difference]: Without dead ends: 3585011 [2019-09-10 07:03:27,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 216 SyntacticMatches, 15 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1349 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=1215, Invalid=4187, Unknown=0, NotChecked=0, Total=5402 [2019-09-10 07:03:30,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3585011 states. [2019-09-10 07:04:21,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3585011 to 1344658. [2019-09-10 07:04:21,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1344658 states.