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.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:53:46,560 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:53:46,563 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:53:46,580 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:53:46,581 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:53:46,582 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:53:46,584 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:53:46,594 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:53:46,597 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:53:46,600 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:53:46,603 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:53:46,605 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:53:46,605 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:53:46,607 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:53:46,609 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:53:46,610 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:53:46,611 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:53:46,613 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:53:46,615 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:53:46,620 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:53:46,624 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:53:46,626 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:53:46,628 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:53:46,629 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:53:46,631 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:53:46,631 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:53:46,631 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:53:46,633 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:53:46,635 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:53:46,636 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:53:46,636 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:53:46,638 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:53:46,638 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:53:46,639 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:53:46,641 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:53:46,641 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:53:46,642 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:53:46,642 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:53:46,643 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:53:46,643 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:53:46,644 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:53:46,645 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:53:46,683 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:53:46,683 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:53:46,684 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:53:46,684 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:53:46,685 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:53:46,685 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:53:46,688 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:53:46,689 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:53:46,689 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:53:46,689 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:53:46,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:53:46,690 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:53:46,690 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:53:46,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:53:46,691 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:53:46,693 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:53:46,693 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:53:46,694 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:53:46,694 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:53:46,694 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:53:46,694 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:53:46,695 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:53:46,695 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:53:46,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:53:46,695 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:53:46,695 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:53:46,696 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:53:46,696 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:53:46,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:53:46,697 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:53:46,746 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:53:46,763 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:53:46,768 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:53:46,770 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:53:46,770 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:53:46,771 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.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 06:53:46,844 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79c86621b/c89d7d10b51c48368b82790d449871a1/FLAG5a23fca7d [2019-09-10 06:53:47,347 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:53:47,348 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 06:53:47,358 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79c86621b/c89d7d10b51c48368b82790d449871a1/FLAG5a23fca7d [2019-09-10 06:53:47,702 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79c86621b/c89d7d10b51c48368b82790d449871a1 [2019-09-10 06:53:47,713 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:53:47,714 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:53:47,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:53:47,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:53:47,719 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:53:47,720 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:53:47" (1/1) ... [2019-09-10 06:53:47,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1332b692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:53:47, skipping insertion in model container [2019-09-10 06:53:47,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:53:47" (1/1) ... [2019-09-10 06:53:47,731 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:53:47,782 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:53:48,171 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:53:48,185 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:53:48,298 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:53:48,320 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:53:48,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:53:48 WrapperNode [2019-09-10 06:53:48,321 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:53:48,322 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:53:48,322 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:53:48,322 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:53:48,333 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:53:48" (1/1) ... [2019-09-10 06:53:48,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:53:48" (1/1) ... [2019-09-10 06:53:48,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:53:48" (1/1) ... [2019-09-10 06:53:48,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:53:48" (1/1) ... [2019-09-10 06:53:48,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:53:48" (1/1) ... [2019-09-10 06:53:48,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:53:48" (1/1) ... [2019-09-10 06:53:48,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:53:48" (1/1) ... [2019-09-10 06:53:48,389 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:53:48,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:53:48,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:53:48,390 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:53:48,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:53:48" (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:53:48,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:53:48,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:53:48,455 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:53:48,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:53:48,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:53:48,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:53:48,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:53:48,455 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:53:48,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:53:48,455 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:53:48,456 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:53:48,456 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:53:48,456 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:53:48,456 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:53:48,456 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:53:48,456 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:53:48,457 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:53:48,457 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:53:48,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:53:48,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:53:49,400 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:53:49,401 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:53:49,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:53:49 BoogieIcfgContainer [2019-09-10 06:53:49,403 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:53:49,404 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:53:49,404 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:53:49,407 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:53:49,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:53:47" (1/3) ... [2019-09-10 06:53:49,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676e818f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:53:49, skipping insertion in model container [2019-09-10 06:53:49,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:53:48" (2/3) ... [2019-09-10 06:53:49,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676e818f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:53:49, skipping insertion in model container [2019-09-10 06:53:49,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:53:49" (3/3) ... [2019-09-10 06:53:49,411 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 06:53:49,421 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:53:49,430 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:53:49,448 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:53:49,473 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:53:49,473 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:53:49,473 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:53:49,474 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:53:49,474 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:53:49,474 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:53:49,474 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:53:49,474 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:53:49,494 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states. [2019-09-10 06:53:49,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:53:49,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:49,508 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:53:49,511 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:49,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:49,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1726351890, now seen corresponding path program 1 times [2019-09-10 06:53:49,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:49,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:49,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:49,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:49,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:50,083 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:53:50,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:50,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:53:50,087 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:50,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:53:50,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:53:50,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:53:50,111 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 7 states. [2019-09-10 06:53:50,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:50,643 INFO L93 Difference]: Finished difference Result 1044 states and 1655 transitions. [2019-09-10 06:53:50,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:53:50,645 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-09-10 06:53:50,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:50,679 INFO L225 Difference]: With dead ends: 1044 [2019-09-10 06:53:50,680 INFO L226 Difference]: Without dead ends: 1024 [2019-09-10 06:53:50,684 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:53:50,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2019-09-10 06:53:50,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 514. [2019-09-10 06:53:50,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-09-10 06:53:50,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 794 transitions. [2019-09-10 06:53:50,816 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 794 transitions. Word has length 68 [2019-09-10 06:53:50,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:50,818 INFO L475 AbstractCegarLoop]: Abstraction has 514 states and 794 transitions. [2019-09-10 06:53:50,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:53:50,818 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 794 transitions. [2019-09-10 06:53:50,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:53:50,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:50,825 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:53:50,826 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:50,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:50,827 INFO L82 PathProgramCache]: Analyzing trace with hash 2038700647, now seen corresponding path program 1 times [2019-09-10 06:53:50,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:50,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:50,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:50,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:50,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:50,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:51,102 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:53:51,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:51,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:53:51,103 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:51,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:53:51,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:53:51,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:53:51,107 INFO L87 Difference]: Start difference. First operand 514 states and 794 transitions. Second operand 6 states. [2019-09-10 06:53:51,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:51,374 INFO L93 Difference]: Finished difference Result 1391 states and 2151 transitions. [2019-09-10 06:53:51,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:53:51,374 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-10 06:53:51,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:51,384 INFO L225 Difference]: With dead ends: 1391 [2019-09-10 06:53:51,384 INFO L226 Difference]: Without dead ends: 1391 [2019-09-10 06:53:51,385 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:53:51,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2019-09-10 06:53:51,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1385. [2019-09-10 06:53:51,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1385 states. [2019-09-10 06:53:51,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2148 transitions. [2019-09-10 06:53:51,421 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 2148 transitions. Word has length 69 [2019-09-10 06:53:51,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:51,422 INFO L475 AbstractCegarLoop]: Abstraction has 1385 states and 2148 transitions. [2019-09-10 06:53:51,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:53:51,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 2148 transitions. [2019-09-10 06:53:51,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:53:51,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:51,427 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:53:51,427 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:51,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:51,427 INFO L82 PathProgramCache]: Analyzing trace with hash 618782839, now seen corresponding path program 1 times [2019-09-10 06:53:51,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:51,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:51,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:51,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:51,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:51,563 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:53:51,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:51,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:53:51,564 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:51,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:53:51,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:53:51,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:53:51,566 INFO L87 Difference]: Start difference. First operand 1385 states and 2148 transitions. Second operand 5 states. [2019-09-10 06:53:51,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:51,899 INFO L93 Difference]: Finished difference Result 2591 states and 4020 transitions. [2019-09-10 06:53:51,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:53:51,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-09-10 06:53:51,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:51,912 INFO L225 Difference]: With dead ends: 2591 [2019-09-10 06:53:51,913 INFO L226 Difference]: Without dead ends: 2591 [2019-09-10 06:53:51,913 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:53:51,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2019-09-10 06:53:51,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 2589. [2019-09-10 06:53:51,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2589 states. [2019-09-10 06:53:51,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2589 states to 2589 states and 4019 transitions. [2019-09-10 06:53:51,979 INFO L78 Accepts]: Start accepts. Automaton has 2589 states and 4019 transitions. Word has length 70 [2019-09-10 06:53:51,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:51,979 INFO L475 AbstractCegarLoop]: Abstraction has 2589 states and 4019 transitions. [2019-09-10 06:53:51,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:53:51,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2589 states and 4019 transitions. [2019-09-10 06:53:51,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:53:51,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:51,982 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:53:51,982 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:51,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:51,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1384706248, now seen corresponding path program 1 times [2019-09-10 06:53:51,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:51,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:51,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:51,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:51,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:52,104 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:53:52,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:52,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:53:52,105 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:52,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:53:52,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:53:52,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:53:52,108 INFO L87 Difference]: Start difference. First operand 2589 states and 4019 transitions. Second operand 6 states. [2019-09-10 06:53:52,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:52,483 INFO L93 Difference]: Finished difference Result 7061 states and 10944 transitions. [2019-09-10 06:53:52,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:53:52,484 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-10 06:53:52,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:52,518 INFO L225 Difference]: With dead ends: 7061 [2019-09-10 06:53:52,518 INFO L226 Difference]: Without dead ends: 7061 [2019-09-10 06:53:52,518 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:53:52,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7061 states. [2019-09-10 06:53:52,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7061 to 7057. [2019-09-10 06:53:52,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7057 states. [2019-09-10 06:53:52,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7057 states to 7057 states and 10942 transitions. [2019-09-10 06:53:52,688 INFO L78 Accepts]: Start accepts. Automaton has 7057 states and 10942 transitions. Word has length 70 [2019-09-10 06:53:52,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:52,688 INFO L475 AbstractCegarLoop]: Abstraction has 7057 states and 10942 transitions. [2019-09-10 06:53:52,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:53:52,689 INFO L276 IsEmpty]: Start isEmpty. Operand 7057 states and 10942 transitions. [2019-09-10 06:53:52,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:53:52,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:52,692 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:53:52,692 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:52,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:52,693 INFO L82 PathProgramCache]: Analyzing trace with hash -554775271, now seen corresponding path program 1 times [2019-09-10 06:53:52,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:52,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:52,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:52,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:52,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:52,785 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:53:52,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:52,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:53:52,786 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:52,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:53:52,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:53:52,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:53:52,787 INFO L87 Difference]: Start difference. First operand 7057 states and 10942 transitions. Second operand 6 states. [2019-09-10 06:53:53,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:53,214 INFO L93 Difference]: Finished difference Result 19738 states and 30469 transitions. [2019-09-10 06:53:53,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:53:53,215 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-10 06:53:53,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:53,300 INFO L225 Difference]: With dead ends: 19738 [2019-09-10 06:53:53,300 INFO L226 Difference]: Without dead ends: 19738 [2019-09-10 06:53:53,301 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:53:53,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19738 states. [2019-09-10 06:53:53,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19738 to 19734. [2019-09-10 06:53:53,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19734 states. [2019-09-10 06:53:53,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19734 states to 19734 states and 30467 transitions. [2019-09-10 06:53:53,675 INFO L78 Accepts]: Start accepts. Automaton has 19734 states and 30467 transitions. Word has length 70 [2019-09-10 06:53:53,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:53,676 INFO L475 AbstractCegarLoop]: Abstraction has 19734 states and 30467 transitions. [2019-09-10 06:53:53,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:53:53,676 INFO L276 IsEmpty]: Start isEmpty. Operand 19734 states and 30467 transitions. [2019-09-10 06:53:53,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:53:53,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:53,680 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:53:53,680 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:53,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:53,680 INFO L82 PathProgramCache]: Analyzing trace with hash -744278678, now seen corresponding path program 1 times [2019-09-10 06:53:53,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:53,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:53,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:53,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:53,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:53,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:53,786 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:53:53,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:53,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:53:53,787 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:53,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:53:53,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:53:53,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:53:53,788 INFO L87 Difference]: Start difference. First operand 19734 states and 30467 transitions. Second operand 6 states. [2019-09-10 06:53:54,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:54,269 INFO L93 Difference]: Finished difference Result 56286 states and 86591 transitions. [2019-09-10 06:53:54,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:53:54,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-10 06:53:54,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:54,424 INFO L225 Difference]: With dead ends: 56286 [2019-09-10 06:53:54,425 INFO L226 Difference]: Without dead ends: 56286 [2019-09-10 06:53:54,425 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:53:54,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56286 states. [2019-09-10 06:53:55,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56286 to 49952. [2019-09-10 06:53:55,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49952 states. [2019-09-10 06:53:56,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49952 states to 49952 states and 76827 transitions. [2019-09-10 06:53:56,032 INFO L78 Accepts]: Start accepts. Automaton has 49952 states and 76827 transitions. Word has length 70 [2019-09-10 06:53:56,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:56,033 INFO L475 AbstractCegarLoop]: Abstraction has 49952 states and 76827 transitions. [2019-09-10 06:53:56,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:53:56,033 INFO L276 IsEmpty]: Start isEmpty. Operand 49952 states and 76827 transitions. [2019-09-10 06:53:56,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:53:56,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:56,047 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:53:56,047 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:56,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:56,241 INFO L82 PathProgramCache]: Analyzing trace with hash 106374034, now seen corresponding path program 1 times [2019-09-10 06:53:56,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:56,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:56,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:56,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:56,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:56,336 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:53:56,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:56,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:53:56,337 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:56,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:53:56,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:53:56,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:53:56,339 INFO L87 Difference]: Start difference. First operand 49952 states and 76827 transitions. Second operand 5 states. [2019-09-10 06:53:56,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:56,565 INFO L93 Difference]: Finished difference Result 82856 states and 126075 transitions. [2019-09-10 06:53:56,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:53:56,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 06:53:56,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:56,753 INFO L225 Difference]: With dead ends: 82856 [2019-09-10 06:53:56,753 INFO L226 Difference]: Without dead ends: 82856 [2019-09-10 06:53:56,754 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:53:56,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82856 states. [2019-09-10 06:53:58,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82856 to 50744. [2019-09-10 06:53:58,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50744 states. [2019-09-10 06:53:58,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50744 states to 50744 states and 77385 transitions. [2019-09-10 06:53:58,912 INFO L78 Accepts]: Start accepts. Automaton has 50744 states and 77385 transitions. Word has length 71 [2019-09-10 06:53:58,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:58,913 INFO L475 AbstractCegarLoop]: Abstraction has 50744 states and 77385 transitions. [2019-09-10 06:53:58,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:53:58,913 INFO L276 IsEmpty]: Start isEmpty. Operand 50744 states and 77385 transitions. [2019-09-10 06:53:58,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:53:58,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:58,918 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:53:58,919 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:58,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:58,919 INFO L82 PathProgramCache]: Analyzing trace with hash -718918452, now seen corresponding path program 1 times [2019-09-10 06:53:58,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:58,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:58,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:58,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:58,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:59,209 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-09-10 06:53:59,339 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:53:59,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:59,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:53:59,340 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:59,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:53:59,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:53:59,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:53:59,341 INFO L87 Difference]: Start difference. First operand 50744 states and 77385 transitions. Second operand 10 states. [2019-09-10 06:54:02,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:02,207 INFO L93 Difference]: Finished difference Result 305114 states and 458865 transitions. [2019-09-10 06:54:02,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 06:54:02,207 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2019-09-10 06:54:02,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:02,623 INFO L225 Difference]: With dead ends: 305114 [2019-09-10 06:54:02,624 INFO L226 Difference]: Without dead ends: 305114 [2019-09-10 06:54:02,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 06:54:02,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305114 states. [2019-09-10 06:54:06,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305114 to 50783. [2019-09-10 06:54:06,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50783 states. [2019-09-10 06:54:06,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50783 states to 50783 states and 77421 transitions. [2019-09-10 06:54:06,674 INFO L78 Accepts]: Start accepts. Automaton has 50783 states and 77421 transitions. Word has length 72 [2019-09-10 06:54:06,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:06,674 INFO L475 AbstractCegarLoop]: Abstraction has 50783 states and 77421 transitions. [2019-09-10 06:54:06,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:54:06,675 INFO L276 IsEmpty]: Start isEmpty. Operand 50783 states and 77421 transitions. [2019-09-10 06:54:06,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:54:06,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:06,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] [2019-09-10 06:54:06,680 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:06,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:06,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1903245012, now seen corresponding path program 1 times [2019-09-10 06:54:06,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:06,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:06,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:06,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:06,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:06,879 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:54:06,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:06,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:54:06,880 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:06,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:54:06,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:54:06,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:54:06,883 INFO L87 Difference]: Start difference. First operand 50783 states and 77421 transitions. Second operand 10 states. [2019-09-10 06:54:10,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:10,865 INFO L93 Difference]: Finished difference Result 386009 states and 588398 transitions. [2019-09-10 06:54:10,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 06:54:10,865 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2019-09-10 06:54:10,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:11,466 INFO L225 Difference]: With dead ends: 386009 [2019-09-10 06:54:11,466 INFO L226 Difference]: Without dead ends: 386009 [2019-09-10 06:54:11,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=380, Invalid=1180, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 06:54:11,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386009 states. [2019-09-10 06:54:16,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386009 to 50994. [2019-09-10 06:54:16,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50994 states. [2019-09-10 06:54:16,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50994 states to 50994 states and 77683 transitions. [2019-09-10 06:54:16,313 INFO L78 Accepts]: Start accepts. Automaton has 50994 states and 77683 transitions. Word has length 72 [2019-09-10 06:54:16,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:16,313 INFO L475 AbstractCegarLoop]: Abstraction has 50994 states and 77683 transitions. [2019-09-10 06:54:16,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:54:16,314 INFO L276 IsEmpty]: Start isEmpty. Operand 50994 states and 77683 transitions. [2019-09-10 06:54:16,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:54:16,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:16,319 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:54:16,319 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:16,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:16,319 INFO L82 PathProgramCache]: Analyzing trace with hash 946021772, now seen corresponding path program 1 times [2019-09-10 06:54:16,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:16,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:16,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:16,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:16,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:16,520 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:54:16,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:16,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:54:16,521 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:16,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:54:16,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:54:16,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:54:16,522 INFO L87 Difference]: Start difference. First operand 50994 states and 77683 transitions. Second operand 10 states. [2019-09-10 06:54:20,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:20,055 INFO L93 Difference]: Finished difference Result 330687 states and 503379 transitions. [2019-09-10 06:54:20,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 06:54:20,056 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2019-09-10 06:54:20,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:20,459 INFO L225 Difference]: With dead ends: 330687 [2019-09-10 06:54:20,459 INFO L226 Difference]: Without dead ends: 330687 [2019-09-10 06:54:20,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=380, Invalid=1180, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 06:54:20,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330687 states. [2019-09-10 06:54:22,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330687 to 51387. [2019-09-10 06:54:22,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51387 states. [2019-09-10 06:54:22,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51387 states to 51387 states and 78180 transitions. [2019-09-10 06:54:22,701 INFO L78 Accepts]: Start accepts. Automaton has 51387 states and 78180 transitions. Word has length 72 [2019-09-10 06:54:22,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:22,701 INFO L475 AbstractCegarLoop]: Abstraction has 51387 states and 78180 transitions. [2019-09-10 06:54:22,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:54:22,702 INFO L276 IsEmpty]: Start isEmpty. Operand 51387 states and 78180 transitions. [2019-09-10 06:54:22,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:54:22,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:22,706 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:54:22,707 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:22,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:22,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1011565036, now seen corresponding path program 1 times [2019-09-10 06:54:22,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:22,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:22,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:22,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:22,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:22,893 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:54:22,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:22,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:54:22,894 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:22,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:54:22,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:54:22,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:54:22,896 INFO L87 Difference]: Start difference. First operand 51387 states and 78180 transitions. Second operand 10 states. [2019-09-10 06:54:24,769 WARN L188 SmtUtils]: Spent 384.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-09-10 06:54:26,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:26,330 INFO L93 Difference]: Finished difference Result 298080 states and 453243 transitions. [2019-09-10 06:54:26,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 06:54:26,330 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2019-09-10 06:54:26,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:26,835 INFO L225 Difference]: With dead ends: 298080 [2019-09-10 06:54:26,835 INFO L226 Difference]: Without dead ends: 298080 [2019-09-10 06:54:26,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=277, Invalid=845, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 06:54:27,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298080 states. [2019-09-10 06:54:28,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298080 to 51387. [2019-09-10 06:54:28,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51387 states. [2019-09-10 06:54:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51387 states to 51387 states and 78172 transitions. [2019-09-10 06:54:28,947 INFO L78 Accepts]: Start accepts. Automaton has 51387 states and 78172 transitions. Word has length 72 [2019-09-10 06:54:28,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:28,947 INFO L475 AbstractCegarLoop]: Abstraction has 51387 states and 78172 transitions. [2019-09-10 06:54:28,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:54:28,947 INFO L276 IsEmpty]: Start isEmpty. Operand 51387 states and 78172 transitions. [2019-09-10 06:54:28,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:54:28,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:28,952 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:54:28,952 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:28,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:28,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1901872630, now seen corresponding path program 1 times [2019-09-10 06:54:28,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:28,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:28,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:28,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:28,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:29,010 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:54:29,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:29,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:54:29,011 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:29,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:54:29,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:54:29,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:54:29,012 INFO L87 Difference]: Start difference. First operand 51387 states and 78172 transitions. Second operand 3 states. [2019-09-10 06:54:29,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:29,195 INFO L93 Difference]: Finished difference Result 72980 states and 109426 transitions. [2019-09-10 06:54:29,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:54:29,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-10 06:54:29,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:29,292 INFO L225 Difference]: With dead ends: 72980 [2019-09-10 06:54:29,292 INFO L226 Difference]: Without dead ends: 72980 [2019-09-10 06:54:29,292 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:54:29,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72980 states. [2019-09-10 06:54:30,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72980 to 72138. [2019-09-10 06:54:30,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72138 states. [2019-09-10 06:54:30,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72138 states to 72138 states and 108585 transitions. [2019-09-10 06:54:30,127 INFO L78 Accepts]: Start accepts. Automaton has 72138 states and 108585 transitions. Word has length 73 [2019-09-10 06:54:30,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:30,128 INFO L475 AbstractCegarLoop]: Abstraction has 72138 states and 108585 transitions. [2019-09-10 06:54:30,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:54:30,128 INFO L276 IsEmpty]: Start isEmpty. Operand 72138 states and 108585 transitions. [2019-09-10 06:54:30,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:54:30,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:30,131 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:54:30,131 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:30,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:30,132 INFO L82 PathProgramCache]: Analyzing trace with hash -244859483, now seen corresponding path program 1 times [2019-09-10 06:54:30,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:30,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:30,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:30,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:30,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:30,250 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:54:30,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:30,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:54:30,251 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:30,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:54:30,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:54:30,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:54:30,253 INFO L87 Difference]: Start difference. First operand 72138 states and 108585 transitions. Second operand 4 states. [2019-09-10 06:54:30,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:30,529 INFO L93 Difference]: Finished difference Result 114918 states and 170589 transitions. [2019-09-10 06:54:30,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:54:30,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-09-10 06:54:30,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:30,655 INFO L225 Difference]: With dead ends: 114918 [2019-09-10 06:54:30,656 INFO L226 Difference]: Without dead ends: 114918 [2019-09-10 06:54:30,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:54:30,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114918 states. [2019-09-10 06:54:31,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114918 to 114082. [2019-09-10 06:54:31,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114082 states. [2019-09-10 06:54:31,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114082 states to 114082 states and 169754 transitions. [2019-09-10 06:54:31,966 INFO L78 Accepts]: Start accepts. Automaton has 114082 states and 169754 transitions. Word has length 73 [2019-09-10 06:54:31,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:31,966 INFO L475 AbstractCegarLoop]: Abstraction has 114082 states and 169754 transitions. [2019-09-10 06:54:31,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:54:31,966 INFO L276 IsEmpty]: Start isEmpty. Operand 114082 states and 169754 transitions. [2019-09-10 06:54:31,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:54:31,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:31,971 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:54:31,971 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:31,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:31,971 INFO L82 PathProgramCache]: Analyzing trace with hash 909512172, now seen corresponding path program 1 times [2019-09-10 06:54:31,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:31,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:31,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:31,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:31,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:32,025 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:54:32,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:32,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:54:32,026 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:32,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:54:32,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:54:32,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:54:32,027 INFO L87 Difference]: Start difference. First operand 114082 states and 169754 transitions. Second operand 3 states. [2019-09-10 06:54:32,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:32,456 INFO L93 Difference]: Finished difference Result 138383 states and 201457 transitions. [2019-09-10 06:54:32,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:54:32,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-10 06:54:32,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:32,670 INFO L225 Difference]: With dead ends: 138383 [2019-09-10 06:54:32,670 INFO L226 Difference]: Without dead ends: 138383 [2019-09-10 06:54:32,671 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:54:32,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138383 states. [2019-09-10 06:54:34,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138383 to 136653. [2019-09-10 06:54:34,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136653 states. [2019-09-10 06:54:34,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136653 states to 136653 states and 199728 transitions. [2019-09-10 06:54:34,496 INFO L78 Accepts]: Start accepts. Automaton has 136653 states and 199728 transitions. Word has length 73 [2019-09-10 06:54:34,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:34,496 INFO L475 AbstractCegarLoop]: Abstraction has 136653 states and 199728 transitions. [2019-09-10 06:54:34,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:54:34,496 INFO L276 IsEmpty]: Start isEmpty. Operand 136653 states and 199728 transitions. [2019-09-10 06:54:34,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:54:34,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:34,499 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:54:34,500 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:34,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:34,500 INFO L82 PathProgramCache]: Analyzing trace with hash 907139436, now seen corresponding path program 1 times [2019-09-10 06:54:34,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:34,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:34,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:34,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:34,502 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:34,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:54:34,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:34,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:54:34,558 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:34,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:54:34,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:54:34,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:54:34,559 INFO L87 Difference]: Start difference. First operand 136653 states and 199728 transitions. Second operand 3 states. [2019-09-10 06:54:35,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:35,939 INFO L93 Difference]: Finished difference Result 220359 states and 317917 transitions. [2019-09-10 06:54:35,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:54:35,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-10 06:54:35,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:36,297 INFO L225 Difference]: With dead ends: 220359 [2019-09-10 06:54:36,297 INFO L226 Difference]: Without dead ends: 220359 [2019-09-10 06:54:36,298 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:54:36,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220359 states. [2019-09-10 06:54:40,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220359 to 219699. [2019-09-10 06:54:40,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219699 states. [2019-09-10 06:54:41,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219699 states to 219699 states and 317258 transitions. [2019-09-10 06:54:41,069 INFO L78 Accepts]: Start accepts. Automaton has 219699 states and 317258 transitions. Word has length 73 [2019-09-10 06:54:41,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:41,069 INFO L475 AbstractCegarLoop]: Abstraction has 219699 states and 317258 transitions. [2019-09-10 06:54:41,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:54:41,069 INFO L276 IsEmpty]: Start isEmpty. Operand 219699 states and 317258 transitions. [2019-09-10 06:54:41,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:54:41,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:41,073 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:54:41,073 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:41,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:41,074 INFO L82 PathProgramCache]: Analyzing trace with hash -865418125, now seen corresponding path program 1 times [2019-09-10 06:54:41,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:41,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:41,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:41,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:41,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:41,163 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:54:41,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:41,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:54:41,164 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:41,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:54:41,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:54:41,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:54:41,165 INFO L87 Difference]: Start difference. First operand 219699 states and 317258 transitions. Second operand 7 states. [2019-09-10 06:54:47,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:47,731 INFO L93 Difference]: Finished difference Result 794047 states and 1133545 transitions. [2019-09-10 06:54:47,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:54:47,731 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-10 06:54:47,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:49,099 INFO L225 Difference]: With dead ends: 794047 [2019-09-10 06:54:49,100 INFO L226 Difference]: Without dead ends: 794047 [2019-09-10 06:54:49,100 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:54:49,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794047 states. [2019-09-10 06:54:55,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794047 to 219739. [2019-09-10 06:54:55,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219739 states. [2019-09-10 06:54:55,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219739 states to 219739 states and 317306 transitions. [2019-09-10 06:54:55,623 INFO L78 Accepts]: Start accepts. Automaton has 219739 states and 317306 transitions. Word has length 74 [2019-09-10 06:54:55,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:55,624 INFO L475 AbstractCegarLoop]: Abstraction has 219739 states and 317306 transitions. [2019-09-10 06:54:55,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:54:55,624 INFO L276 IsEmpty]: Start isEmpty. Operand 219739 states and 317306 transitions. [2019-09-10 06:54:55,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:54:55,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:55,628 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:54:55,628 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:55,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:55,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1280232077, now seen corresponding path program 1 times [2019-09-10 06:54:55,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:55,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:55,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:55,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:55,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:55,702 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:54:55,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:55,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:54:55,703 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:55,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:54:55,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:54:55,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:54:55,704 INFO L87 Difference]: Start difference. First operand 219739 states and 317306 transitions. Second operand 7 states. [2019-09-10 06:54:59,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:59,354 INFO L93 Difference]: Finished difference Result 851862 states and 1224189 transitions. [2019-09-10 06:54:59,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:54:59,354 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-10 06:54:59,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:00,638 INFO L225 Difference]: With dead ends: 851862 [2019-09-10 06:55:00,638 INFO L226 Difference]: Without dead ends: 851862 [2019-09-10 06:55:00,638 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:55:08,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851862 states. [2019-09-10 06:55:13,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851862 to 219843. [2019-09-10 06:55:13,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219843 states. [2019-09-10 06:55:13,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219843 states to 219843 states and 317431 transitions. [2019-09-10 06:55:13,695 INFO L78 Accepts]: Start accepts. Automaton has 219843 states and 317431 transitions. Word has length 74 [2019-09-10 06:55:13,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:13,695 INFO L475 AbstractCegarLoop]: Abstraction has 219843 states and 317431 transitions. [2019-09-10 06:55:13,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:55:13,695 INFO L276 IsEmpty]: Start isEmpty. Operand 219843 states and 317431 transitions. [2019-09-10 06:55:13,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:55:13,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:13,699 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:55:13,699 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:13,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:13,699 INFO L82 PathProgramCache]: Analyzing trace with hash 109033983, now seen corresponding path program 1 times [2019-09-10 06:55:13,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:13,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:13,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:13,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:13,701 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:13,783 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:55:13,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:13,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:55:13,784 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:13,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:55:13,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:55:13,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:55:13,785 INFO L87 Difference]: Start difference. First operand 219843 states and 317431 transitions. Second operand 7 states. [2019-09-10 06:55:17,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:17,399 INFO L93 Difference]: Finished difference Result 787480 states and 1124782 transitions. [2019-09-10 06:55:17,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:55:17,399 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-10 06:55:17,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:18,595 INFO L225 Difference]: With dead ends: 787480 [2019-09-10 06:55:18,595 INFO L226 Difference]: Without dead ends: 787480 [2019-09-10 06:55:18,596 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:55:19,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787480 states. [2019-09-10 06:55:31,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787480 to 220035. [2019-09-10 06:55:31,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220035 states. [2019-09-10 06:55:31,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220035 states to 220035 states and 317666 transitions. [2019-09-10 06:55:31,439 INFO L78 Accepts]: Start accepts. Automaton has 220035 states and 317666 transitions. Word has length 74 [2019-09-10 06:55:31,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:31,439 INFO L475 AbstractCegarLoop]: Abstraction has 220035 states and 317666 transitions. [2019-09-10 06:55:31,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:55:31,439 INFO L276 IsEmpty]: Start isEmpty. Operand 220035 states and 317666 transitions. [2019-09-10 06:55:31,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:55:31,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:31,443 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:55:31,444 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:31,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:31,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1884931138, now seen corresponding path program 1 times [2019-09-10 06:55:31,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:31,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:31,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:31,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:31,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:31,531 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:55:31,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:31,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:55:31,532 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:31,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:55:31,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:55:31,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:55:31,534 INFO L87 Difference]: Start difference. First operand 220035 states and 317666 transitions. Second operand 6 states. [2019-09-10 06:55:33,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:33,205 INFO L93 Difference]: Finished difference Result 424788 states and 613540 transitions. [2019-09-10 06:55:33,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:55:33,206 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-09-10 06:55:33,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:33,809 INFO L225 Difference]: With dead ends: 424788 [2019-09-10 06:55:33,810 INFO L226 Difference]: Without dead ends: 424788 [2019-09-10 06:55:33,810 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:55:34,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424788 states. [2019-09-10 06:55:41,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424788 to 250878. [2019-09-10 06:55:41,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250878 states. [2019-09-10 06:55:42,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250878 states to 250878 states and 362805 transitions. [2019-09-10 06:55:42,233 INFO L78 Accepts]: Start accepts. Automaton has 250878 states and 362805 transitions. Word has length 76 [2019-09-10 06:55:42,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:42,233 INFO L475 AbstractCegarLoop]: Abstraction has 250878 states and 362805 transitions. [2019-09-10 06:55:42,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:55:42,233 INFO L276 IsEmpty]: Start isEmpty. Operand 250878 states and 362805 transitions. [2019-09-10 06:55:42,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:55:42,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:42,237 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:55:42,238 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:42,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:42,238 INFO L82 PathProgramCache]: Analyzing trace with hash 581569352, now seen corresponding path program 1 times [2019-09-10 06:55:42,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:42,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:42,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:42,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:42,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:42,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:55:42,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:42,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:55:42,319 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:42,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:55:42,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:55:42,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:55:42,320 INFO L87 Difference]: Start difference. First operand 250878 states and 362805 transitions. Second operand 6 states. [2019-09-10 06:55:43,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:43,374 INFO L93 Difference]: Finished difference Result 446271 states and 645604 transitions. [2019-09-10 06:55:43,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:55:43,374 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-09-10 06:55:43,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:43,973 INFO L225 Difference]: With dead ends: 446271 [2019-09-10 06:55:43,973 INFO L226 Difference]: Without dead ends: 446271 [2019-09-10 06:55:43,973 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:55:44,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446271 states. [2019-09-10 06:55:52,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446271 to 279174. [2019-09-10 06:55:52,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279174 states. [2019-09-10 06:55:52,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279174 states to 279174 states and 404315 transitions. [2019-09-10 06:55:52,630 INFO L78 Accepts]: Start accepts. Automaton has 279174 states and 404315 transitions. Word has length 76 [2019-09-10 06:55:52,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:52,630 INFO L475 AbstractCegarLoop]: Abstraction has 279174 states and 404315 transitions. [2019-09-10 06:55:52,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:55:52,631 INFO L276 IsEmpty]: Start isEmpty. Operand 279174 states and 404315 transitions. [2019-09-10 06:55:52,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:55:52,635 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:52,635 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:55:52,636 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:52,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:52,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1953619948, now seen corresponding path program 1 times [2019-09-10 06:55:52,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:52,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:52,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:52,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:52,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:52,716 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:55:52,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:52,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:55:52,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:52,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:55:52,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:55:52,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:55:52,719 INFO L87 Difference]: Start difference. First operand 279174 states and 404315 transitions. Second operand 6 states. [2019-09-10 06:55:55,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:55,002 INFO L93 Difference]: Finished difference Result 466068 states and 674212 transitions. [2019-09-10 06:55:55,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:55:55,003 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-09-10 06:55:55,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:55,686 INFO L225 Difference]: With dead ends: 466068 [2019-09-10 06:55:55,686 INFO L226 Difference]: Without dead ends: 466068 [2019-09-10 06:55:55,686 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:55:55,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466068 states. [2019-09-10 06:56:05,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466068 to 311960. [2019-09-10 06:56:05,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311960 states. [2019-09-10 06:56:06,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311960 states to 311960 states and 452295 transitions. [2019-09-10 06:56:06,768 INFO L78 Accepts]: Start accepts. Automaton has 311960 states and 452295 transitions. Word has length 76 [2019-09-10 06:56:06,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:06,769 INFO L475 AbstractCegarLoop]: Abstraction has 311960 states and 452295 transitions. [2019-09-10 06:56:06,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:56:06,769 INFO L276 IsEmpty]: Start isEmpty. Operand 311960 states and 452295 transitions. [2019-09-10 06:56:06,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 06:56:06,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:06,775 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:56:06,775 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:06,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:06,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1552110678, now seen corresponding path program 1 times [2019-09-10 06:56:06,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:06,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:06,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:06,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:06,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:06,817 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:56:06,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:06,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:56:06,817 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:06,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:56:06,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:56:06,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:56:06,819 INFO L87 Difference]: Start difference. First operand 311960 states and 452295 transitions. Second operand 3 states. [2019-09-10 06:56:07,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:07,727 INFO L93 Difference]: Finished difference Result 361946 states and 514530 transitions. [2019-09-10 06:56:07,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:56:07,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-10 06:56:07,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:08,353 INFO L225 Difference]: With dead ends: 361946 [2019-09-10 06:56:08,353 INFO L226 Difference]: Without dead ends: 359590 [2019-09-10 06:56:08,354 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:56:08,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359590 states. [2019-09-10 06:56:16,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359590 to 318678. [2019-09-10 06:56:16,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318678 states. [2019-09-10 06:56:16,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318678 states to 318678 states and 455664 transitions. [2019-09-10 06:56:16,877 INFO L78 Accepts]: Start accepts. Automaton has 318678 states and 455664 transitions. Word has length 78 [2019-09-10 06:56:16,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:16,878 INFO L475 AbstractCegarLoop]: Abstraction has 318678 states and 455664 transitions. [2019-09-10 06:56:16,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:56:16,878 INFO L276 IsEmpty]: Start isEmpty. Operand 318678 states and 455664 transitions. [2019-09-10 06:56:16,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 06:56:16,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:16,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] [2019-09-10 06:56:16,885 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:16,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:16,885 INFO L82 PathProgramCache]: Analyzing trace with hash 2042603589, now seen corresponding path program 1 times [2019-09-10 06:56:16,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:16,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:16,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:16,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:16,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:16,970 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:56:16,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:16,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:56:16,971 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:16,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:56:16,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:56:16,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:56:16,974 INFO L87 Difference]: Start difference. First operand 318678 states and 455664 transitions. Second operand 7 states. [2019-09-10 06:56:20,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:20,599 INFO L93 Difference]: Finished difference Result 958178 states and 1343926 transitions. [2019-09-10 06:56:20,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:56:20,600 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2019-09-10 06:56:20,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:22,212 INFO L225 Difference]: With dead ends: 958178 [2019-09-10 06:56:22,212 INFO L226 Difference]: Without dead ends: 958178 [2019-09-10 06:56:22,213 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:56:24,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958178 states. [2019-09-10 06:56:38,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958178 to 319016. [2019-09-10 06:56:38,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319016 states. [2019-09-10 06:56:39,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319016 states to 319016 states and 456055 transitions. [2019-09-10 06:56:39,055 INFO L78 Accepts]: Start accepts. Automaton has 319016 states and 456055 transitions. Word has length 79 [2019-09-10 06:56:39,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:39,055 INFO L475 AbstractCegarLoop]: Abstraction has 319016 states and 456055 transitions. [2019-09-10 06:56:39,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:56:39,055 INFO L276 IsEmpty]: Start isEmpty. Operand 319016 states and 456055 transitions. [2019-09-10 06:56:39,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:56:39,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:39,062 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:56:39,062 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:39,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:39,062 INFO L82 PathProgramCache]: Analyzing trace with hash 14162140, now seen corresponding path program 1 times [2019-09-10 06:56:39,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:39,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:39,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:39,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:39,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:39,617 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:56:39,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:39,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 06:56:39,617 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:39,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:56:39,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:56:39,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:56:39,618 INFO L87 Difference]: Start difference. First operand 319016 states and 456055 transitions. Second operand 13 states. [2019-09-10 06:56:40,081 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-09-10 06:56:40,270 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 06:56:40,482 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 06:56:40,757 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 06:56:41,063 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-09-10 06:56:41,257 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-10 06:56:41,498 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 06:56:41,804 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-10 06:56:43,072 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-09-10 06:56:43,784 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-09-10 06:56:59,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:59,185 INFO L93 Difference]: Finished difference Result 1767379 states and 2513019 transitions. [2019-09-10 06:56:59,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 06:56:59,186 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2019-09-10 06:56:59,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:02,294 INFO L225 Difference]: With dead ends: 1767379 [2019-09-10 06:57:02,294 INFO L226 Difference]: Without dead ends: 1767379 [2019-09-10 06:57:02,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=333, Invalid=1149, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 06:57:04,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767379 states. [2019-09-10 06:57:15,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767379 to 318903. [2019-09-10 06:57:15,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318903 states. [2019-09-10 06:57:15,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318903 states to 318903 states and 455910 transitions. [2019-09-10 06:57:15,540 INFO L78 Accepts]: Start accepts. Automaton has 318903 states and 455910 transitions. Word has length 81 [2019-09-10 06:57:15,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:15,540 INFO L475 AbstractCegarLoop]: Abstraction has 318903 states and 455910 transitions. [2019-09-10 06:57:15,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:57:15,540 INFO L276 IsEmpty]: Start isEmpty. Operand 318903 states and 455910 transitions. [2019-09-10 06:57:15,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:57:15,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:15,547 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:57:15,547 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:15,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:15,548 INFO L82 PathProgramCache]: Analyzing trace with hash 197201132, now seen corresponding path program 1 times [2019-09-10 06:57:15,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:15,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:15,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:15,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:15,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:15,949 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:15,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:15,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 06:57:15,950 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:15,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:57:15,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:57:15,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:57:15,950 INFO L87 Difference]: Start difference. First operand 318903 states and 455910 transitions. Second operand 13 states. [2019-09-10 06:57:31,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:31,216 INFO L93 Difference]: Finished difference Result 1372198 states and 1961964 transitions. [2019-09-10 06:57:31,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:57:31,217 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2019-09-10 06:57:31,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:33,458 INFO L225 Difference]: With dead ends: 1372198 [2019-09-10 06:57:33,459 INFO L226 Difference]: Without dead ends: 1372198 [2019-09-10 06:57:33,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=215, Invalid=541, Unknown=0, NotChecked=0, Total=756 [2019-09-10 06:57:34,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372198 states. [2019-09-10 06:57:43,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372198 to 316285. [2019-09-10 06:57:43,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316285 states. [2019-09-10 06:57:43,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316285 states to 316285 states and 452322 transitions. [2019-09-10 06:57:43,750 INFO L78 Accepts]: Start accepts. Automaton has 316285 states and 452322 transitions. Word has length 81 [2019-09-10 06:57:43,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:43,750 INFO L475 AbstractCegarLoop]: Abstraction has 316285 states and 452322 transitions. [2019-09-10 06:57:43,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:57:43,750 INFO L276 IsEmpty]: Start isEmpty. Operand 316285 states and 452322 transitions. [2019-09-10 06:57:43,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 06:57:43,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:43,758 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:57:43,759 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:43,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:43,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1735504503, now seen corresponding path program 1 times [2019-09-10 06:57:43,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:43,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:43,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:43,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:43,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:43,794 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:43,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:43,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:57:43,794 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:43,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:57:43,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:57:43,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:57:43,795 INFO L87 Difference]: Start difference. First operand 316285 states and 452322 transitions. Second operand 3 states. [2019-09-10 06:57:45,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:45,898 INFO L93 Difference]: Finished difference Result 486338 states and 695129 transitions. [2019-09-10 06:57:45,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:57:45,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-10 06:57:45,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:46,701 INFO L225 Difference]: With dead ends: 486338 [2019-09-10 06:57:46,701 INFO L226 Difference]: Without dead ends: 486338 [2019-09-10 06:57:46,701 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:47,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486338 states. [2019-09-10 06:57:56,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486338 to 305010. [2019-09-10 06:57:56,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305010 states. [2019-09-10 06:57:56,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305010 states to 305010 states and 435807 transitions. [2019-09-10 06:57:56,781 INFO L78 Accepts]: Start accepts. Automaton has 305010 states and 435807 transitions. Word has length 82 [2019-09-10 06:57:56,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:56,782 INFO L475 AbstractCegarLoop]: Abstraction has 305010 states and 435807 transitions. [2019-09-10 06:57:56,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:57:56,782 INFO L276 IsEmpty]: Start isEmpty. Operand 305010 states and 435807 transitions. [2019-09-10 06:57:56,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 06:57:56,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:56,787 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:57:56,787 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:56,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:56,788 INFO L82 PathProgramCache]: Analyzing trace with hash 125635843, now seen corresponding path program 1 times [2019-09-10 06:57:56,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:56,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:56,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:56,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:56,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:56,827 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:56,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:56,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:57:56,828 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:56,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:57:56,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:57:56,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:57:56,829 INFO L87 Difference]: Start difference. First operand 305010 states and 435807 transitions. Second operand 3 states. [2019-09-10 06:57:59,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:59,644 INFO L93 Difference]: Finished difference Result 477903 states and 681269 transitions. [2019-09-10 06:57:59,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:57:59,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-10 06:57:59,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:00,386 INFO L225 Difference]: With dead ends: 477903 [2019-09-10 06:58:00,386 INFO L226 Difference]: Without dead ends: 477903 [2019-09-10 06:58:00,387 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:00,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477903 states. [2019-09-10 06:58:10,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477903 to 376549. [2019-09-10 06:58:10,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376549 states. [2019-09-10 06:58:11,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376549 states to 376549 states and 538322 transitions. [2019-09-10 06:58:11,602 INFO L78 Accepts]: Start accepts. Automaton has 376549 states and 538322 transitions. Word has length 82 [2019-09-10 06:58:11,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:11,602 INFO L475 AbstractCegarLoop]: Abstraction has 376549 states and 538322 transitions. [2019-09-10 06:58:11,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:58:11,602 INFO L276 IsEmpty]: Start isEmpty. Operand 376549 states and 538322 transitions. [2019-09-10 06:58:11,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 06:58:11,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:11,608 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] [2019-09-10 06:58:11,608 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:11,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:11,609 INFO L82 PathProgramCache]: Analyzing trace with hash -673243998, now seen corresponding path program 1 times [2019-09-10 06:58:11,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:11,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:11,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:11,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:11,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:11,666 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,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:11,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:58:11,667 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:11,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:58:11,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:58:11,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:58:11,668 INFO L87 Difference]: Start difference. First operand 376549 states and 538322 transitions. Second operand 3 states. [2019-09-10 06:58:12,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:12,581 INFO L93 Difference]: Finished difference Result 359537 states and 507440 transitions. [2019-09-10 06:58:12,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:58:12,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-10 06:58:12,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:13,120 INFO L225 Difference]: With dead ends: 359537 [2019-09-10 06:58:13,120 INFO L226 Difference]: Without dead ends: 359537 [2019-09-10 06:58:13,121 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:13,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359537 states. [2019-09-10 06:58:23,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359537 to 359535. [2019-09-10 06:58:23,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359535 states. [2019-09-10 06:58:23,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359535 states to 359535 states and 507439 transitions. [2019-09-10 06:58:23,696 INFO L78 Accepts]: Start accepts. Automaton has 359535 states and 507439 transitions. Word has length 84 [2019-09-10 06:58:23,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:23,696 INFO L475 AbstractCegarLoop]: Abstraction has 359535 states and 507439 transitions. [2019-09-10 06:58:23,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:58:23,696 INFO L276 IsEmpty]: Start isEmpty. Operand 359535 states and 507439 transitions. [2019-09-10 06:58:23,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 06:58:23,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:23,704 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 06:58:23,704 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:23,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:23,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1970137392, now seen corresponding path program 1 times [2019-09-10 06:58:23,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:23,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:23,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:23,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:23,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:23,757 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:23,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:23,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:58:23,757 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:23,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:58:23,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:58:23,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:58:23,758 INFO L87 Difference]: Start difference. First operand 359535 states and 507439 transitions. Second operand 3 states. [2019-09-10 06:58:26,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:26,020 INFO L93 Difference]: Finished difference Result 340940 states and 475195 transitions. [2019-09-10 06:58:26,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:58:26,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-09-10 06:58:26,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:26,440 INFO L225 Difference]: With dead ends: 340940 [2019-09-10 06:58:26,440 INFO L226 Difference]: Without dead ends: 340940 [2019-09-10 06:58:26,440 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:26,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340940 states. [2019-09-10 06:58:34,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340940 to 340938. [2019-09-10 06:58:34,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340938 states. [2019-09-10 06:58:34,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340938 states to 340938 states and 475194 transitions. [2019-09-10 06:58:34,755 INFO L78 Accepts]: Start accepts. Automaton has 340938 states and 475194 transitions. Word has length 85 [2019-09-10 06:58:34,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:34,755 INFO L475 AbstractCegarLoop]: Abstraction has 340938 states and 475194 transitions. [2019-09-10 06:58:34,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:58:34,755 INFO L276 IsEmpty]: Start isEmpty. Operand 340938 states and 475194 transitions. [2019-09-10 06:58:34,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 06:58:34,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:34,761 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 06:58:34,761 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:34,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:34,762 INFO L82 PathProgramCache]: Analyzing trace with hash -765372234, now seen corresponding path program 1 times [2019-09-10 06:58:34,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:34,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:34,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:34,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:34,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:35,692 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:35,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:35,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 06:58:35,692 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:35,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:58:35,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:58:35,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:58:35,693 INFO L87 Difference]: Start difference. First operand 340938 states and 475194 transitions. Second operand 19 states. [2019-09-10 06:58:36,345 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-09-10 06:58:36,556 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-10 06:58:36,910 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2019-09-10 06:58:37,209 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 88 [2019-09-10 06:58:37,454 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 06:58:37,659 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-10 06:58:38,159 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 06:58:39,088 WARN L188 SmtUtils]: Spent 877.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 06:58:39,351 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 06:58:41,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:41,409 INFO L93 Difference]: Finished difference Result 501111 states and 697531 transitions. [2019-09-10 06:58:41,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 06:58:41,410 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 86 [2019-09-10 06:58:41,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:42,092 INFO L225 Difference]: With dead ends: 501111 [2019-09-10 06:58:42,092 INFO L226 Difference]: Without dead ends: 501111 [2019-09-10 06:58:42,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=336, Invalid=1224, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 06:58:42,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501111 states. [2019-09-10 06:58:54,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501111 to 340910. [2019-09-10 06:58:54,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340910 states. [2019-09-10 06:58:55,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340910 states to 340910 states and 475158 transitions. [2019-09-10 06:58:55,115 INFO L78 Accepts]: Start accepts. Automaton has 340910 states and 475158 transitions. Word has length 86 [2019-09-10 06:58:55,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:55,115 INFO L475 AbstractCegarLoop]: Abstraction has 340910 states and 475158 transitions. [2019-09-10 06:58:55,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:58:55,115 INFO L276 IsEmpty]: Start isEmpty. Operand 340910 states and 475158 transitions. [2019-09-10 06:58:55,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 06:58:55,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:55,122 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 06:58:55,122 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:55,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:55,122 INFO L82 PathProgramCache]: Analyzing trace with hash -231226448, now seen corresponding path program 1 times [2019-09-10 06:58:55,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:55,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:55,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:55,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:55,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:55,153 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:55,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:55,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:58:55,154 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:55,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:58:55,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:58:55,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:58:55,155 INFO L87 Difference]: Start difference. First operand 340910 states and 475158 transitions. Second operand 3 states. [2019-09-10 06:58:57,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:57,139 INFO L93 Difference]: Finished difference Result 533943 states and 742904 transitions. [2019-09-10 06:58:57,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:58:57,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-09-10 06:58:57,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:57,959 INFO L225 Difference]: With dead ends: 533943 [2019-09-10 06:58:57,960 INFO L226 Difference]: Without dead ends: 533943 [2019-09-10 06:58:57,960 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:58,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533943 states. [2019-09-10 06:59:08,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533943 to 340588. [2019-09-10 06:59:08,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340588 states. [2019-09-10 06:59:08,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340588 states to 340588 states and 473797 transitions. [2019-09-10 06:59:08,642 INFO L78 Accepts]: Start accepts. Automaton has 340588 states and 473797 transitions. Word has length 86 [2019-09-10 06:59:08,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:08,642 INFO L475 AbstractCegarLoop]: Abstraction has 340588 states and 473797 transitions. [2019-09-10 06:59:08,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:59:08,642 INFO L276 IsEmpty]: Start isEmpty. Operand 340588 states and 473797 transitions. [2019-09-10 06:59:08,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 06:59:08,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:08,648 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 06:59:08,648 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:08,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:08,649 INFO L82 PathProgramCache]: Analyzing trace with hash -125756554, now seen corresponding path program 1 times [2019-09-10 06:59:08,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:08,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:08,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:08,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:08,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:08,686 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:08,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:08,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:59:08,687 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:08,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:59:08,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:59:08,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:59:08,688 INFO L87 Difference]: Start difference. First operand 340588 states and 473797 transitions. Second operand 3 states. [2019-09-10 06:59:10,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:10,850 INFO L93 Difference]: Finished difference Result 375112 states and 521079 transitions. [2019-09-10 06:59:10,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:59:10,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-09-10 06:59:10,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:11,440 INFO L225 Difference]: With dead ends: 375112 [2019-09-10 06:59:11,440 INFO L226 Difference]: Without dead ends: 375112 [2019-09-10 06:59:11,440 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:59:11,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375112 states. [2019-09-10 06:59:20,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375112 to 334748. [2019-09-10 06:59:20,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334748 states. [2019-09-10 06:59:20,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334748 states to 334748 states and 465122 transitions. [2019-09-10 06:59:20,683 INFO L78 Accepts]: Start accepts. Automaton has 334748 states and 465122 transitions. Word has length 86 [2019-09-10 06:59:20,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:20,684 INFO L475 AbstractCegarLoop]: Abstraction has 334748 states and 465122 transitions. [2019-09-10 06:59:20,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:59:20,684 INFO L276 IsEmpty]: Start isEmpty. Operand 334748 states and 465122 transitions. [2019-09-10 06:59:20,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 06:59:20,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:20,691 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 06:59:20,691 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:20,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:20,692 INFO L82 PathProgramCache]: Analyzing trace with hash 863846170, now seen corresponding path program 1 times [2019-09-10 06:59:20,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:20,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:20,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:20,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:20,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:21,101 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:21,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:21,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:59:21,101 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:21,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:59:21,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:59:21,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:59:21,102 INFO L87 Difference]: Start difference. First operand 334748 states and 465122 transitions. Second operand 12 states. [2019-09-10 06:59:22,156 WARN L188 SmtUtils]: Spent 921.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2019-09-10 06:59:26,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:26,232 INFO L93 Difference]: Finished difference Result 808481 states and 1123815 transitions. [2019-09-10 06:59:26,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 06:59:26,233 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2019-09-10 06:59:26,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:27,485 INFO L225 Difference]: With dead ends: 808481 [2019-09-10 06:59:27,485 INFO L226 Difference]: Without dead ends: 808481 [2019-09-10 06:59:27,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:59:28,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808481 states. [2019-09-10 06:59:40,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808481 to 334729. [2019-09-10 06:59:40,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334729 states. [2019-09-10 06:59:40,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334729 states to 334729 states and 465084 transitions. [2019-09-10 06:59:40,883 INFO L78 Accepts]: Start accepts. Automaton has 334729 states and 465084 transitions. Word has length 87 [2019-09-10 06:59:40,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:40,883 INFO L475 AbstractCegarLoop]: Abstraction has 334729 states and 465084 transitions. [2019-09-10 06:59:40,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:59:40,883 INFO L276 IsEmpty]: Start isEmpty. Operand 334729 states and 465084 transitions. [2019-09-10 06:59:40,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 06:59:40,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:40,910 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 06:59:40,910 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:40,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:40,910 INFO L82 PathProgramCache]: Analyzing trace with hash -272713558, now seen corresponding path program 1 times [2019-09-10 06:59:40,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:40,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:40,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:40,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:40,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:40,955 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 06:59:40,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:40,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:59:40,955 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:40,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:59:40,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:59:40,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:59:40,956 INFO L87 Difference]: Start difference. First operand 334729 states and 465084 transitions. Second operand 3 states. [2019-09-10 06:59:43,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:43,313 INFO L93 Difference]: Finished difference Result 625319 states and 859223 transitions. [2019-09-10 06:59:43,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:59:43,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-10 06:59:43,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:44,311 INFO L225 Difference]: With dead ends: 625319 [2019-09-10 06:59:44,311 INFO L226 Difference]: Without dead ends: 625319 [2019-09-10 06:59:44,311 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:59:44,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625319 states. [2019-09-10 06:59:58,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625319 to 573261. [2019-09-10 06:59:58,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573261 states. [2019-09-10 07:00:00,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573261 states to 573261 states and 794161 transitions. [2019-09-10 07:00:00,198 INFO L78 Accepts]: Start accepts. Automaton has 573261 states and 794161 transitions. Word has length 95 [2019-09-10 07:00:00,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:00,199 INFO L475 AbstractCegarLoop]: Abstraction has 573261 states and 794161 transitions. [2019-09-10 07:00:00,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:00:00,199 INFO L276 IsEmpty]: Start isEmpty. Operand 573261 states and 794161 transitions. [2019-09-10 07:00:00,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 07:00:00,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:00,213 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:00:00,213 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:00,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:00,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1209648034, now seen corresponding path program 1 times [2019-09-10 07:00:00,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:00,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:00,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:00,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:00,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:00,257 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:00:00,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:00,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:00:00,258 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:00,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:00:00,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:00:00,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:00,259 INFO L87 Difference]: Start difference. First operand 573261 states and 794161 transitions. Second operand 3 states. [2019-09-10 07:00:04,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:04,192 INFO L93 Difference]: Finished difference Result 916377 states and 1260462 transitions. [2019-09-10 07:00:04,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:00:04,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-09-10 07:00:04,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:05,701 INFO L225 Difference]: With dead ends: 916377 [2019-09-10 07:00:05,701 INFO L226 Difference]: Without dead ends: 916377 [2019-09-10 07:00:05,701 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:06,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916377 states. [2019-09-10 07:00:24,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916377 to 871163. [2019-09-10 07:00:24,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871163 states. [2019-09-10 07:00:27,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871163 states to 871163 states and 1203171 transitions. [2019-09-10 07:00:27,290 INFO L78 Accepts]: Start accepts. Automaton has 871163 states and 1203171 transitions. Word has length 96 [2019-09-10 07:00:27,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:27,290 INFO L475 AbstractCegarLoop]: Abstraction has 871163 states and 1203171 transitions. [2019-09-10 07:00:27,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:00:27,290 INFO L276 IsEmpty]: Start isEmpty. Operand 871163 states and 1203171 transitions. [2019-09-10 07:00:27,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:00:27,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:27,302 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:00:27,302 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:27,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:27,302 INFO L82 PathProgramCache]: Analyzing trace with hash -610341620, now seen corresponding path program 1 times [2019-09-10 07:00:27,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:27,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:27,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:27,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:27,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:27,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:27,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:27,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:00:27,350 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:27,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:00:27,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:00:27,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:00:27,351 INFO L87 Difference]: Start difference. First operand 871163 states and 1203171 transitions. Second operand 5 states. [2019-09-10 07:00:41,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:41,990 INFO L93 Difference]: Finished difference Result 1845803 states and 2462701 transitions. [2019-09-10 07:00:41,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:00:41,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-10 07:00:41,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:46,108 INFO L225 Difference]: With dead ends: 1845803 [2019-09-10 07:00:46,109 INFO L226 Difference]: Without dead ends: 1845803 [2019-09-10 07:00:46,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:00:47,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845803 states. [2019-09-10 07:01:01,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845803 to 940142. [2019-09-10 07:01:01,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940142 states. [2019-09-10 07:01:24,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940142 states to 940142 states and 1274328 transitions. [2019-09-10 07:01:24,359 INFO L78 Accepts]: Start accepts. Automaton has 940142 states and 1274328 transitions. Word has length 102 [2019-09-10 07:01:24,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:24,359 INFO L475 AbstractCegarLoop]: Abstraction has 940142 states and 1274328 transitions. [2019-09-10 07:01:24,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:01:24,360 INFO L276 IsEmpty]: Start isEmpty. Operand 940142 states and 1274328 transitions. [2019-09-10 07:01:24,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 07:01:24,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:24,376 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:24,376 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:24,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:24,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1723910426, now seen corresponding path program 1 times [2019-09-10 07:01:24,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:24,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:24,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:24,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:24,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:24,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:24,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:01:24,434 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:24,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:01:24,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:01:24,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:01:24,436 INFO L87 Difference]: Start difference. First operand 940142 states and 1274328 transitions. Second operand 5 states. [2019-09-10 07:01:32,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:32,413 INFO L93 Difference]: Finished difference Result 1614353 states and 2131200 transitions. [2019-09-10 07:01:32,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:01:32,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-09-10 07:01:32,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:35,014 INFO L225 Difference]: With dead ends: 1614353 [2019-09-10 07:01:35,014 INFO L226 Difference]: Without dead ends: 1614353 [2019-09-10 07:01:35,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:01:36,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614353 states.