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.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:36:53,629 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:36:53,632 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:36:53,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:36:53,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:36:53,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:36:53,649 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:36:53,651 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:36:53,653 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:36:53,654 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:36:53,655 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:36:53,656 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:36:53,656 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:36:53,657 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:36:53,658 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:36:53,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:36:53,659 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:36:53,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:36:53,663 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:36:53,665 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:36:53,667 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:36:53,668 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:36:53,669 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:36:53,669 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:36:53,671 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:36:53,672 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:36:53,672 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:36:53,673 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:36:53,673 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:36:53,674 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:36:53,674 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:36:53,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:36:53,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:36:53,676 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:36:53,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:36:53,677 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:36:53,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:36:53,678 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:36:53,678 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:36:53,679 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:36:53,680 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:36:53,681 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:36:53,695 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:36:53,695 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:36:53,696 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:36:53,696 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:36:53,697 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:36:53,697 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:36:53,697 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:36:53,697 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:36:53,697 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:36:53,698 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:36:53,698 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:36:53,699 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:36:53,699 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:36:53,699 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:36:53,699 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:36:53,699 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:36:53,700 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:36:53,700 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:36:53,700 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:36:53,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:36:53,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:36:53,701 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:36:53,701 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:36:53,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:36:53,701 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:36:53,701 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:36:53,701 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:36:53,702 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:36:53,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:36:53,702 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:36:53,734 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:36:53,748 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:36:53,752 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:36:53,753 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:36:53,754 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:36:53,754 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.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 06:36:53,815 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9cc8b6b4/7a6cd0e377574f9fa6d4c34e09f30367/FLAG8a7915311 [2019-09-10 06:36:54,326 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:36:54,329 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 06:36:54,343 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9cc8b6b4/7a6cd0e377574f9fa6d4c34e09f30367/FLAG8a7915311 [2019-09-10 06:36:54,676 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9cc8b6b4/7a6cd0e377574f9fa6d4c34e09f30367 [2019-09-10 06:36:54,687 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:36:54,689 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:36:54,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:36:54,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:36:54,695 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:36:54,696 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:36:54" (1/1) ... [2019-09-10 06:36:54,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f59ac88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:36:54, skipping insertion in model container [2019-09-10 06:36:54,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:36:54" (1/1) ... [2019-09-10 06:36:54,711 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:36:54,775 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:36:55,198 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:36:55,211 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:36:55,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:36:55,356 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:36:55,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:36:55 WrapperNode [2019-09-10 06:36:55,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:36:55,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:36:55,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:36:55,358 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:36:55,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:36:55" (1/1) ... [2019-09-10 06:36:55,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:36:55" (1/1) ... [2019-09-10 06:36:55,382 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:36:55" (1/1) ... [2019-09-10 06:36:55,383 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:36:55" (1/1) ... [2019-09-10 06:36:55,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:36:55" (1/1) ... [2019-09-10 06:36:55,411 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:36:55" (1/1) ... [2019-09-10 06:36:55,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:36:55" (1/1) ... [2019-09-10 06:36:55,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:36:55,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:36:55,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:36:55,423 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:36:55,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:36:55" (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:36:55,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:36:55,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:36:55,494 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:36:55,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:36:55,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:36:55,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:36:55,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:36:55,495 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:36:55,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:36:55,496 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:36:55,496 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:36:55,497 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:36:55,497 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:36:55,498 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:36:55,498 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:36:55,499 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:36:55,499 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:36:55,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:36:55,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:36:56,312 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:36:56,313 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:36:56,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:36:56 BoogieIcfgContainer [2019-09-10 06:36:56,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:36:56,316 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:36:56,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:36:56,319 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:36:56,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:36:54" (1/3) ... [2019-09-10 06:36:56,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774e2ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:36:56, skipping insertion in model container [2019-09-10 06:36:56,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:36:55" (2/3) ... [2019-09-10 06:36:56,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774e2ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:36:56, skipping insertion in model container [2019-09-10 06:36:56,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:36:56" (3/3) ... [2019-09-10 06:36:56,331 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 06:36:56,340 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:36:56,347 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:36:56,365 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:36:56,391 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:36:56,391 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:36:56,391 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:36:56,391 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:36:56,392 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:36:56,392 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:36:56,392 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:36:56,392 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:36:56,412 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states. [2019-09-10 06:36:56,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-10 06:36:56,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:56,426 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] [2019-09-10 06:36:56,429 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:56,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:56,434 INFO L82 PathProgramCache]: Analyzing trace with hash -418135505, now seen corresponding path program 1 times [2019-09-10 06:36:56,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:56,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:56,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:56,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:56,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:56,956 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:36:56,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:56,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:36:56,960 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:56,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:36:56,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:36:56,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:36:56,989 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 6 states. [2019-09-10 06:36:57,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:57,400 INFO L93 Difference]: Finished difference Result 722 states and 1128 transitions. [2019-09-10 06:36:57,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 06:36:57,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-09-10 06:36:57,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:57,433 INFO L225 Difference]: With dead ends: 722 [2019-09-10 06:36:57,433 INFO L226 Difference]: Without dead ends: 694 [2019-09-10 06:36:57,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:36:57,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-09-10 06:36:57,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 467. [2019-09-10 06:36:57,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2019-09-10 06:36:57,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 717 transitions. [2019-09-10 06:36:57,541 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 717 transitions. Word has length 53 [2019-09-10 06:36:57,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:57,542 INFO L475 AbstractCegarLoop]: Abstraction has 467 states and 717 transitions. [2019-09-10 06:36:57,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:36:57,542 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 717 transitions. [2019-09-10 06:36:57,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:36:57,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:57,545 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] [2019-09-10 06:36:57,545 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:57,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:57,546 INFO L82 PathProgramCache]: Analyzing trace with hash 914126686, now seen corresponding path program 1 times [2019-09-10 06:36:57,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:57,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:57,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:57,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:57,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:57,691 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:36:57,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:57,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:57,691 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:57,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:57,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:57,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:57,699 INFO L87 Difference]: Start difference. First operand 467 states and 717 transitions. Second operand 3 states. [2019-09-10 06:36:57,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:57,738 INFO L93 Difference]: Finished difference Result 832 states and 1273 transitions. [2019-09-10 06:36:57,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:57,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-09-10 06:36:57,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:57,745 INFO L225 Difference]: With dead ends: 832 [2019-09-10 06:36:57,745 INFO L226 Difference]: Without dead ends: 832 [2019-09-10 06:36:57,746 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:36:57,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2019-09-10 06:36:57,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 830. [2019-09-10 06:36:57,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-09-10 06:36:57,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1272 transitions. [2019-09-10 06:36:57,789 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1272 transitions. Word has length 56 [2019-09-10 06:36:57,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:57,790 INFO L475 AbstractCegarLoop]: Abstraction has 830 states and 1272 transitions. [2019-09-10 06:36:57,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:57,790 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1272 transitions. [2019-09-10 06:36:57,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:36:57,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:57,793 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] [2019-09-10 06:36:57,794 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:57,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:57,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1604405792, now seen corresponding path program 1 times [2019-09-10 06:36:57,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:57,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:57,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:57,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:57,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:57,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:36:57,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:57,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:57,879 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:57,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:57,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:57,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:57,881 INFO L87 Difference]: Start difference. First operand 830 states and 1272 transitions. Second operand 3 states. [2019-09-10 06:36:57,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:57,936 INFO L93 Difference]: Finished difference Result 1419 states and 2136 transitions. [2019-09-10 06:36:57,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:57,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-09-10 06:36:57,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:57,954 INFO L225 Difference]: With dead ends: 1419 [2019-09-10 06:36:57,954 INFO L226 Difference]: Without dead ends: 1419 [2019-09-10 06:36:57,955 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:36:57,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2019-09-10 06:36:57,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1417. [2019-09-10 06:36:57,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1417 states. [2019-09-10 06:36:58,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 2135 transitions. [2019-09-10 06:36:58,002 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 2135 transitions. Word has length 56 [2019-09-10 06:36:58,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:58,005 INFO L475 AbstractCegarLoop]: Abstraction has 1417 states and 2135 transitions. [2019-09-10 06:36:58,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:58,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 2135 transitions. [2019-09-10 06:36:58,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:36:58,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:58,017 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] [2019-09-10 06:36:58,017 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:58,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:58,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1855390903, now seen corresponding path program 1 times [2019-09-10 06:36:58,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:58,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:58,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:58,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:58,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:58,154 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:36:58,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:58,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:36:58,155 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:58,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:36:58,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:36:58,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:36:58,157 INFO L87 Difference]: Start difference. First operand 1417 states and 2135 transitions. Second operand 5 states. [2019-09-10 06:36:58,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:58,479 INFO L93 Difference]: Finished difference Result 2665 states and 4007 transitions. [2019-09-10 06:36:58,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:36:58,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-09-10 06:36:58,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:58,495 INFO L225 Difference]: With dead ends: 2665 [2019-09-10 06:36:58,495 INFO L226 Difference]: Without dead ends: 2665 [2019-09-10 06:36:58,496 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:36:58,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2665 states. [2019-09-10 06:36:58,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2665 to 2648. [2019-09-10 06:36:58,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2648 states. [2019-09-10 06:36:58,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2648 states to 2648 states and 3991 transitions. [2019-09-10 06:36:58,560 INFO L78 Accepts]: Start accepts. Automaton has 2648 states and 3991 transitions. Word has length 57 [2019-09-10 06:36:58,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:58,561 INFO L475 AbstractCegarLoop]: Abstraction has 2648 states and 3991 transitions. [2019-09-10 06:36:58,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:36:58,561 INFO L276 IsEmpty]: Start isEmpty. Operand 2648 states and 3991 transitions. [2019-09-10 06:36:58,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:36:58,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:58,564 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] [2019-09-10 06:36:58,565 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:58,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:58,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1758328390, now seen corresponding path program 1 times [2019-09-10 06:36:58,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:58,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:58,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:58,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:58,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:58,732 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:36:58,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:58,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:36:58,733 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:58,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:36:58,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:36:58,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:36:58,736 INFO L87 Difference]: Start difference. First operand 2648 states and 3991 transitions. Second operand 6 states. [2019-09-10 06:36:59,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:59,074 INFO L93 Difference]: Finished difference Result 5935 states and 8910 transitions. [2019-09-10 06:36:59,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:36:59,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-10 06:36:59,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:59,102 INFO L225 Difference]: With dead ends: 5935 [2019-09-10 06:36:59,102 INFO L226 Difference]: Without dead ends: 5935 [2019-09-10 06:36:59,103 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:36:59,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5935 states. [2019-09-10 06:36:59,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5935 to 5891. [2019-09-10 06:36:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5891 states. [2019-09-10 06:36:59,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5891 states to 5891 states and 8868 transitions. [2019-09-10 06:36:59,288 INFO L78 Accepts]: Start accepts. Automaton has 5891 states and 8868 transitions. Word has length 57 [2019-09-10 06:36:59,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:59,288 INFO L475 AbstractCegarLoop]: Abstraction has 5891 states and 8868 transitions. [2019-09-10 06:36:59,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:36:59,288 INFO L276 IsEmpty]: Start isEmpty. Operand 5891 states and 8868 transitions. [2019-09-10 06:36:59,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:36:59,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:59,290 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] [2019-09-10 06:36:59,291 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:59,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:59,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1592153131, now seen corresponding path program 1 times [2019-09-10 06:36:59,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:59,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:59,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:59,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:59,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:59,380 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:36:59,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:59,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:36:59,380 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:59,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:36:59,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:36:59,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:36:59,382 INFO L87 Difference]: Start difference. First operand 5891 states and 8868 transitions. Second operand 7 states. [2019-09-10 06:36:59,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:59,985 INFO L93 Difference]: Finished difference Result 21237 states and 31640 transitions. [2019-09-10 06:36:59,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:36:59,987 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-09-10 06:36:59,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:00,100 INFO L225 Difference]: With dead ends: 21237 [2019-09-10 06:37:00,100 INFO L226 Difference]: Without dead ends: 21237 [2019-09-10 06:37:00,101 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:37:00,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21237 states. [2019-09-10 06:37:00,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21237 to 5911. [2019-09-10 06:37:00,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5911 states. [2019-09-10 06:37:00,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5911 states to 5911 states and 8892 transitions. [2019-09-10 06:37:00,452 INFO L78 Accepts]: Start accepts. Automaton has 5911 states and 8892 transitions. Word has length 58 [2019-09-10 06:37:00,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:00,455 INFO L475 AbstractCegarLoop]: Abstraction has 5911 states and 8892 transitions. [2019-09-10 06:37:00,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:37:00,456 INFO L276 IsEmpty]: Start isEmpty. Operand 5911 states and 8892 transitions. [2019-09-10 06:37:00,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:37:00,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:00,465 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] [2019-09-10 06:37:00,465 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:00,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:00,471 INFO L82 PathProgramCache]: Analyzing trace with hash -908950199, now seen corresponding path program 1 times [2019-09-10 06:37:00,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:00,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:00,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:00,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:00,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:00,604 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:37:00,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:00,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:37:00,605 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:00,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:37:00,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:37:00,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:37:00,607 INFO L87 Difference]: Start difference. First operand 5911 states and 8892 transitions. Second operand 7 states. [2019-09-10 06:37:01,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:01,253 INFO L93 Difference]: Finished difference Result 31529 states and 47782 transitions. [2019-09-10 06:37:01,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:37:01,253 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-09-10 06:37:01,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:01,323 INFO L225 Difference]: With dead ends: 31529 [2019-09-10 06:37:01,323 INFO L226 Difference]: Without dead ends: 31529 [2019-09-10 06:37:01,324 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:37:01,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31529 states. [2019-09-10 06:37:01,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31529 to 5947. [2019-09-10 06:37:01,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5947 states. [2019-09-10 06:37:01,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5947 states to 5947 states and 8938 transitions. [2019-09-10 06:37:01,651 INFO L78 Accepts]: Start accepts. Automaton has 5947 states and 8938 transitions. Word has length 58 [2019-09-10 06:37:01,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:01,651 INFO L475 AbstractCegarLoop]: Abstraction has 5947 states and 8938 transitions. [2019-09-10 06:37:01,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:37:01,651 INFO L276 IsEmpty]: Start isEmpty. Operand 5947 states and 8938 transitions. [2019-09-10 06:37:01,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:37:01,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:01,654 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] [2019-09-10 06:37:01,654 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:01,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:01,654 INFO L82 PathProgramCache]: Analyzing trace with hash -201532434, now seen corresponding path program 1 times [2019-09-10 06:37:01,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:01,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:01,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:01,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:01,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:01,811 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:37:01,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:01,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:37:01,812 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:01,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:37:01,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:37:01,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:37:01,814 INFO L87 Difference]: Start difference. First operand 5947 states and 8938 transitions. Second operand 6 states. [2019-09-10 06:37:02,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:02,135 INFO L93 Difference]: Finished difference Result 15843 states and 23556 transitions. [2019-09-10 06:37:02,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:37:02,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-09-10 06:37:02,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:02,170 INFO L225 Difference]: With dead ends: 15843 [2019-09-10 06:37:02,170 INFO L226 Difference]: Without dead ends: 15843 [2019-09-10 06:37:02,171 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:37:02,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15843 states. [2019-09-10 06:37:02,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15843 to 15839. [2019-09-10 06:37:02,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15839 states. [2019-09-10 06:37:02,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15839 states to 15839 states and 23554 transitions. [2019-09-10 06:37:02,426 INFO L78 Accepts]: Start accepts. Automaton has 15839 states and 23554 transitions. Word has length 59 [2019-09-10 06:37:02,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:02,427 INFO L475 AbstractCegarLoop]: Abstraction has 15839 states and 23554 transitions. [2019-09-10 06:37:02,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:37:02,427 INFO L276 IsEmpty]: Start isEmpty. Operand 15839 states and 23554 transitions. [2019-09-10 06:37:02,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:37:02,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:02,430 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:37:02,430 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:02,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:02,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1864848650, now seen corresponding path program 1 times [2019-09-10 06:37:02,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:02,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:02,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:02,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:02,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:02,522 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:37:02,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:02,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:37:02,523 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:02,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:37:02,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:37:02,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:37:02,524 INFO L87 Difference]: Start difference. First operand 15839 states and 23554 transitions. Second operand 5 states. [2019-09-10 06:37:02,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:02,809 INFO L93 Difference]: Finished difference Result 33629 states and 50100 transitions. [2019-09-10 06:37:02,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:37:02,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-09-10 06:37:02,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:02,885 INFO L225 Difference]: With dead ends: 33629 [2019-09-10 06:37:02,886 INFO L226 Difference]: Without dead ends: 33629 [2019-09-10 06:37:02,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:37:02,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33629 states. [2019-09-10 06:37:03,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33629 to 20219. [2019-09-10 06:37:03,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20219 states. [2019-09-10 06:37:03,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20219 states to 20219 states and 30185 transitions. [2019-09-10 06:37:03,321 INFO L78 Accepts]: Start accepts. Automaton has 20219 states and 30185 transitions. Word has length 60 [2019-09-10 06:37:03,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:03,321 INFO L475 AbstractCegarLoop]: Abstraction has 20219 states and 30185 transitions. [2019-09-10 06:37:03,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:37:03,321 INFO L276 IsEmpty]: Start isEmpty. Operand 20219 states and 30185 transitions. [2019-09-10 06:37:03,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:37:03,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:03,331 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] [2019-09-10 06:37:03,331 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:03,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:03,331 INFO L82 PathProgramCache]: Analyzing trace with hash 82558164, now seen corresponding path program 1 times [2019-09-10 06:37:03,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:03,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:03,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:03,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:03,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:03,411 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:37:03,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:03,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:37:03,412 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:03,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:37:03,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:37:03,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:37:03,413 INFO L87 Difference]: Start difference. First operand 20219 states and 30185 transitions. Second operand 5 states. [2019-09-10 06:37:03,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:03,666 INFO L93 Difference]: Finished difference Result 36100 states and 53883 transitions. [2019-09-10 06:37:03,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:37:03,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-09-10 06:37:03,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:03,735 INFO L225 Difference]: With dead ends: 36100 [2019-09-10 06:37:03,735 INFO L226 Difference]: Without dead ends: 36100 [2019-09-10 06:37:03,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:37:03,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36100 states. [2019-09-10 06:37:04,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36100 to 23242. [2019-09-10 06:37:04,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23242 states. [2019-09-10 06:37:04,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23242 states to 23242 states and 34740 transitions. [2019-09-10 06:37:04,123 INFO L78 Accepts]: Start accepts. Automaton has 23242 states and 34740 transitions. Word has length 60 [2019-09-10 06:37:04,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:04,124 INFO L475 AbstractCegarLoop]: Abstraction has 23242 states and 34740 transitions. [2019-09-10 06:37:04,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:37:04,124 INFO L276 IsEmpty]: Start isEmpty. Operand 23242 states and 34740 transitions. [2019-09-10 06:37:04,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 06:37:04,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:04,129 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] [2019-09-10 06:37:04,129 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:04,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:04,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1576740999, now seen corresponding path program 1 times [2019-09-10 06:37:04,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:04,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:04,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:04,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:04,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:04,226 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:37:04,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:04,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:37:04,226 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:04,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:37:04,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:37:04,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:37:04,227 INFO L87 Difference]: Start difference. First operand 23242 states and 34740 transitions. Second operand 7 states. [2019-09-10 06:37:05,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:05,216 INFO L93 Difference]: Finished difference Result 100199 states and 148162 transitions. [2019-09-10 06:37:05,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:37:05,217 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-09-10 06:37:05,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:05,399 INFO L225 Difference]: With dead ends: 100199 [2019-09-10 06:37:05,399 INFO L226 Difference]: Without dead ends: 100199 [2019-09-10 06:37:05,400 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:37:05,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100199 states. [2019-09-10 06:37:07,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100199 to 23370. [2019-09-10 06:37:07,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23370 states. [2019-09-10 06:37:07,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23370 states to 23370 states and 34904 transitions. [2019-09-10 06:37:07,252 INFO L78 Accepts]: Start accepts. Automaton has 23370 states and 34904 transitions. Word has length 63 [2019-09-10 06:37:07,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:07,253 INFO L475 AbstractCegarLoop]: Abstraction has 23370 states and 34904 transitions. [2019-09-10 06:37:07,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:37:07,253 INFO L276 IsEmpty]: Start isEmpty. Operand 23370 states and 34904 transitions. [2019-09-10 06:37:07,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 06:37:07,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:07,260 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] [2019-09-10 06:37:07,260 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:07,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:07,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1496387803, now seen corresponding path program 1 times [2019-09-10 06:37:07,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:07,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:07,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:07,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:07,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:07,316 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:37:07,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:07,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:37:07,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:07,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:37:07,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:37:07,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:07,319 INFO L87 Difference]: Start difference. First operand 23370 states and 34904 transitions. Second operand 3 states. [2019-09-10 06:37:07,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:07,441 INFO L93 Difference]: Finished difference Result 34818 states and 50949 transitions. [2019-09-10 06:37:07,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:37:07,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-09-10 06:37:07,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:07,492 INFO L225 Difference]: With dead ends: 34818 [2019-09-10 06:37:07,492 INFO L226 Difference]: Without dead ends: 34818 [2019-09-10 06:37:07,493 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:37:07,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34818 states. [2019-09-10 06:37:08,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34818 to 28308. [2019-09-10 06:37:08,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28308 states. [2019-09-10 06:37:08,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28308 states to 28308 states and 41697 transitions. [2019-09-10 06:37:08,109 INFO L78 Accepts]: Start accepts. Automaton has 28308 states and 41697 transitions. Word has length 63 [2019-09-10 06:37:08,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:08,110 INFO L475 AbstractCegarLoop]: Abstraction has 28308 states and 41697 transitions. [2019-09-10 06:37:08,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:37:08,110 INFO L276 IsEmpty]: Start isEmpty. Operand 28308 states and 41697 transitions. [2019-09-10 06:37:08,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 06:37:08,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:08,125 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] [2019-09-10 06:37:08,125 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:08,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:08,126 INFO L82 PathProgramCache]: Analyzing trace with hash -572139280, now seen corresponding path program 1 times [2019-09-10 06:37:08,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:08,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:08,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:08,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:08,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:08,382 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:37:08,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:08,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:37:08,382 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:08,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:37:08,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:37:08,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:37:08,384 INFO L87 Difference]: Start difference. First operand 28308 states and 41697 transitions. Second operand 10 states. [2019-09-10 06:37:11,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:11,659 INFO L93 Difference]: Finished difference Result 124067 states and 181557 transitions. [2019-09-10 06:37:11,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 06:37:11,660 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-09-10 06:37:11,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:11,819 INFO L225 Difference]: With dead ends: 124067 [2019-09-10 06:37:11,819 INFO L226 Difference]: Without dead ends: 124067 [2019-09-10 06:37:11,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=339, Invalid=993, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 06:37:11,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124067 states. [2019-09-10 06:37:12,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124067 to 28096. [2019-09-10 06:37:12,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28096 states. [2019-09-10 06:37:12,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28096 states to 28096 states and 41400 transitions. [2019-09-10 06:37:12,516 INFO L78 Accepts]: Start accepts. Automaton has 28096 states and 41400 transitions. Word has length 65 [2019-09-10 06:37:12,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:12,516 INFO L475 AbstractCegarLoop]: Abstraction has 28096 states and 41400 transitions. [2019-09-10 06:37:12,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:37:12,517 INFO L276 IsEmpty]: Start isEmpty. Operand 28096 states and 41400 transitions. [2019-09-10 06:37:12,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 06:37:12,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:12,523 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] [2019-09-10 06:37:12,523 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:12,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:12,523 INFO L82 PathProgramCache]: Analyzing trace with hash 2066882796, now seen corresponding path program 1 times [2019-09-10 06:37:12,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:12,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:12,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:12,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:12,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:12,728 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:37:12,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:12,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:37:12,729 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:12,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:37:12,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:37:12,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:37:12,730 INFO L87 Difference]: Start difference. First operand 28096 states and 41400 transitions. Second operand 10 states. [2019-09-10 06:37:13,194 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 22 [2019-09-10 06:37:15,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:15,322 INFO L93 Difference]: Finished difference Result 123616 states and 180906 transitions. [2019-09-10 06:37:15,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 06:37:15,322 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-09-10 06:37:15,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:15,472 INFO L225 Difference]: With dead ends: 123616 [2019-09-10 06:37:15,473 INFO L226 Difference]: Without dead ends: 123616 [2019-09-10 06:37:15,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=345, Invalid=1061, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:37:15,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123616 states. [2019-09-10 06:37:16,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123616 to 27843. [2019-09-10 06:37:16,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27843 states. [2019-09-10 06:37:16,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27843 states to 27843 states and 41007 transitions. [2019-09-10 06:37:16,393 INFO L78 Accepts]: Start accepts. Automaton has 27843 states and 41007 transitions. Word has length 65 [2019-09-10 06:37:16,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:16,393 INFO L475 AbstractCegarLoop]: Abstraction has 27843 states and 41007 transitions. [2019-09-10 06:37:16,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:37:16,393 INFO L276 IsEmpty]: Start isEmpty. Operand 27843 states and 41007 transitions. [2019-09-10 06:37:16,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 06:37:16,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:16,397 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] [2019-09-10 06:37:16,397 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:16,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:16,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1389497554, now seen corresponding path program 1 times [2019-09-10 06:37:16,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:16,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:16,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:16,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:16,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:16,585 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:37:16,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:16,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:37:16,586 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:16,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:37:16,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:37:16,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:37:16,587 INFO L87 Difference]: Start difference. First operand 27843 states and 41007 transitions. Second operand 10 states. [2019-09-10 06:37:19,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:19,131 INFO L93 Difference]: Finished difference Result 100353 states and 145191 transitions. [2019-09-10 06:37:19,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 06:37:19,132 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-09-10 06:37:19,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:19,267 INFO L225 Difference]: With dead ends: 100353 [2019-09-10 06:37:19,267 INFO L226 Difference]: Without dead ends: 100353 [2019-09-10 06:37:19,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 06:37:19,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100353 states. [2019-09-10 06:37:20,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100353 to 27490. [2019-09-10 06:37:20,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27490 states. [2019-09-10 06:37:20,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27490 states to 27490 states and 40478 transitions. [2019-09-10 06:37:20,855 INFO L78 Accepts]: Start accepts. Automaton has 27490 states and 40478 transitions. Word has length 65 [2019-09-10 06:37:20,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:20,855 INFO L475 AbstractCegarLoop]: Abstraction has 27490 states and 40478 transitions. [2019-09-10 06:37:20,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:37:20,855 INFO L276 IsEmpty]: Start isEmpty. Operand 27490 states and 40478 transitions. [2019-09-10 06:37:20,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 06:37:20,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:20,859 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] [2019-09-10 06:37:20,860 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:20,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:20,860 INFO L82 PathProgramCache]: Analyzing trace with hash -376949161, now seen corresponding path program 1 times [2019-09-10 06:37:20,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:20,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:20,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:20,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:20,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:20,905 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:37:20,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:20,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:37:20,907 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:20,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:37:20,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:37:20,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:20,908 INFO L87 Difference]: Start difference. First operand 27490 states and 40478 transitions. Second operand 3 states. [2019-09-10 06:37:20,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:20,997 INFO L93 Difference]: Finished difference Result 27465 states and 39840 transitions. [2019-09-10 06:37:20,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:37:20,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-10 06:37:20,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:21,034 INFO L225 Difference]: With dead ends: 27465 [2019-09-10 06:37:21,034 INFO L226 Difference]: Without dead ends: 27465 [2019-09-10 06:37:21,035 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:37:21,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27465 states. [2019-09-10 06:37:21,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27465 to 27463. [2019-09-10 06:37:21,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27463 states. [2019-09-10 06:37:21,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27463 states to 27463 states and 39839 transitions. [2019-09-10 06:37:21,386 INFO L78 Accepts]: Start accepts. Automaton has 27463 states and 39839 transitions. Word has length 66 [2019-09-10 06:37:21,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:21,386 INFO L475 AbstractCegarLoop]: Abstraction has 27463 states and 39839 transitions. [2019-09-10 06:37:21,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:37:21,386 INFO L276 IsEmpty]: Start isEmpty. Operand 27463 states and 39839 transitions. [2019-09-10 06:37:21,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 06:37:21,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:21,390 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] [2019-09-10 06:37:21,391 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:21,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:21,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1749705359, now seen corresponding path program 1 times [2019-09-10 06:37:21,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:21,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:21,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:21,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:21,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:21,442 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:37:21,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:21,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:37:21,443 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:21,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:37:21,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:37:21,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:21,444 INFO L87 Difference]: Start difference. First operand 27463 states and 39839 transitions. Second operand 3 states. [2019-09-10 06:37:21,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:21,520 INFO L93 Difference]: Finished difference Result 24660 states and 35165 transitions. [2019-09-10 06:37:21,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:37:21,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-10 06:37:21,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:21,551 INFO L225 Difference]: With dead ends: 24660 [2019-09-10 06:37:21,551 INFO L226 Difference]: Without dead ends: 24660 [2019-09-10 06:37:21,552 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:37:21,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24660 states. [2019-09-10 06:37:21,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24660 to 24658. [2019-09-10 06:37:21,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24658 states. [2019-09-10 06:37:21,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24658 states to 24658 states and 35164 transitions. [2019-09-10 06:37:21,957 INFO L78 Accepts]: Start accepts. Automaton has 24658 states and 35164 transitions. Word has length 66 [2019-09-10 06:37:21,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:21,958 INFO L475 AbstractCegarLoop]: Abstraction has 24658 states and 35164 transitions. [2019-09-10 06:37:21,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:37:21,958 INFO L276 IsEmpty]: Start isEmpty. Operand 24658 states and 35164 transitions. [2019-09-10 06:37:21,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 06:37:21,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:21,962 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] [2019-09-10 06:37:21,962 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:21,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:21,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1710265917, now seen corresponding path program 1 times [2019-09-10 06:37:21,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:21,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:21,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:21,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:21,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:22,003 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:37:22,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:22,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:37:22,004 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:22,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:37:22,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:37:22,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:22,005 INFO L87 Difference]: Start difference. First operand 24658 states and 35164 transitions. Second operand 3 states. [2019-09-10 06:37:22,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:22,075 INFO L93 Difference]: Finished difference Result 20871 states and 29142 transitions. [2019-09-10 06:37:22,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:37:22,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-10 06:37:22,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:22,099 INFO L225 Difference]: With dead ends: 20871 [2019-09-10 06:37:22,099 INFO L226 Difference]: Without dead ends: 20871 [2019-09-10 06:37:22,100 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:37:22,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20871 states. [2019-09-10 06:37:22,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20871 to 20869. [2019-09-10 06:37:22,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20869 states. [2019-09-10 06:37:22,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20869 states to 20869 states and 29141 transitions. [2019-09-10 06:37:22,256 INFO L78 Accepts]: Start accepts. Automaton has 20869 states and 29141 transitions. Word has length 66 [2019-09-10 06:37:22,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:22,257 INFO L475 AbstractCegarLoop]: Abstraction has 20869 states and 29141 transitions. [2019-09-10 06:37:22,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:37:22,257 INFO L276 IsEmpty]: Start isEmpty. Operand 20869 states and 29141 transitions. [2019-09-10 06:37:22,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:37:22,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:22,260 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] [2019-09-10 06:37:22,260 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:22,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:22,260 INFO L82 PathProgramCache]: Analyzing trace with hash -980051313, now seen corresponding path program 1 times [2019-09-10 06:37:22,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:22,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:22,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:22,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:22,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:22,292 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:37:22,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:22,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:37:22,293 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:22,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:37:22,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:37:22,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:22,294 INFO L87 Difference]: Start difference. First operand 20869 states and 29141 transitions. Second operand 3 states. [2019-09-10 06:37:22,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:22,403 INFO L93 Difference]: Finished difference Result 31017 states and 43339 transitions. [2019-09-10 06:37:22,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:37:22,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-10 06:37:22,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:22,442 INFO L225 Difference]: With dead ends: 31017 [2019-09-10 06:37:22,442 INFO L226 Difference]: Without dead ends: 31017 [2019-09-10 06:37:22,443 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:37:22,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31017 states. [2019-09-10 06:37:22,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31017 to 20603. [2019-09-10 06:37:22,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20603 states. [2019-09-10 06:37:22,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20603 states to 20603 states and 28732 transitions. [2019-09-10 06:37:22,631 INFO L78 Accepts]: Start accepts. Automaton has 20603 states and 28732 transitions. Word has length 67 [2019-09-10 06:37:22,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:22,631 INFO L475 AbstractCegarLoop]: Abstraction has 20603 states and 28732 transitions. [2019-09-10 06:37:22,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:37:22,631 INFO L276 IsEmpty]: Start isEmpty. Operand 20603 states and 28732 transitions. [2019-09-10 06:37:22,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:37:22,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:22,634 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] [2019-09-10 06:37:22,634 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:22,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:22,635 INFO L82 PathProgramCache]: Analyzing trace with hash 732122448, now seen corresponding path program 1 times [2019-09-10 06:37:22,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:22,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:22,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:22,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:22,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:22,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:37:22,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:22,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:37:22,667 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:22,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:37:22,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:37:22,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:22,668 INFO L87 Difference]: Start difference. First operand 20603 states and 28732 transitions. Second operand 3 states. [2019-09-10 06:37:22,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:22,771 INFO L93 Difference]: Finished difference Result 30869 states and 43056 transitions. [2019-09-10 06:37:22,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:37:22,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-10 06:37:22,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:22,800 INFO L225 Difference]: With dead ends: 30869 [2019-09-10 06:37:22,801 INFO L226 Difference]: Without dead ends: 30869 [2019-09-10 06:37:22,801 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:37:22,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30869 states. [2019-09-10 06:37:22,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30869 to 20455. [2019-09-10 06:37:22,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20455 states. [2019-09-10 06:37:22,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20455 states to 20455 states and 28481 transitions. [2019-09-10 06:37:22,988 INFO L78 Accepts]: Start accepts. Automaton has 20455 states and 28481 transitions. Word has length 67 [2019-09-10 06:37:22,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:22,988 INFO L475 AbstractCegarLoop]: Abstraction has 20455 states and 28481 transitions. [2019-09-10 06:37:22,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:37:22,988 INFO L276 IsEmpty]: Start isEmpty. Operand 20455 states and 28481 transitions. [2019-09-10 06:37:22,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:37:22,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:22,991 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] [2019-09-10 06:37:22,991 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:22,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:22,991 INFO L82 PathProgramCache]: Analyzing trace with hash -261204545, now seen corresponding path program 1 times [2019-09-10 06:37:22,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:22,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:22,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:22,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:22,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:23,959 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:37:23,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:23,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:37:23,960 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:23,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:37:23,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:37:23,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:37:23,962 INFO L87 Difference]: Start difference. First operand 20455 states and 28481 transitions. Second operand 17 states. [2019-09-10 06:37:24,777 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 06:37:24,927 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 06:37:25,197 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 06:37:25,345 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 06:37:25,618 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 06:37:25,917 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 06:37:26,140 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 06:37:28,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:28,079 INFO L93 Difference]: Finished difference Result 38865 states and 54053 transitions. [2019-09-10 06:37:28,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 06:37:28,079 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-09-10 06:37:28,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:28,117 INFO L225 Difference]: With dead ends: 38865 [2019-09-10 06:37:28,117 INFO L226 Difference]: Without dead ends: 38865 [2019-09-10 06:37:28,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=339, Invalid=1221, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 06:37:28,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38865 states. [2019-09-10 06:37:28,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38865 to 20371. [2019-09-10 06:37:28,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20371 states. [2019-09-10 06:37:28,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20371 states to 20371 states and 28365 transitions. [2019-09-10 06:37:28,332 INFO L78 Accepts]: Start accepts. Automaton has 20371 states and 28365 transitions. Word has length 67 [2019-09-10 06:37:28,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:28,332 INFO L475 AbstractCegarLoop]: Abstraction has 20371 states and 28365 transitions. [2019-09-10 06:37:28,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:37:28,332 INFO L276 IsEmpty]: Start isEmpty. Operand 20371 states and 28365 transitions. [2019-09-10 06:37:28,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:37:28,335 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:28,335 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] [2019-09-10 06:37:28,335 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:28,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:28,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1834151963, now seen corresponding path program 1 times [2019-09-10 06:37:28,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:28,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:28,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:28,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:28,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:29,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:37:29,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:29,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 06:37:29,337 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:29,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:37:29,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:37:29,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:37:29,338 INFO L87 Difference]: Start difference. First operand 20371 states and 28365 transitions. Second operand 19 states. [2019-09-10 06:37:30,120 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-10 06:37:30,317 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-10 06:37:30,669 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 85 [2019-09-10 06:37:30,970 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 90 [2019-09-10 06:37:31,154 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 06:37:31,359 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 06:37:31,669 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 06:37:32,135 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 06:37:32,283 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-09-10 06:37:32,690 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 06:37:33,222 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 06:37:36,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:36,413 INFO L93 Difference]: Finished difference Result 93545 states and 131033 transitions. [2019-09-10 06:37:36,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 06:37:36,416 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-09-10 06:37:36,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:36,524 INFO L225 Difference]: With dead ends: 93545 [2019-09-10 06:37:36,524 INFO L226 Difference]: Without dead ends: 93545 [2019-09-10 06:37:36,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=472, Invalid=1690, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 06:37:36,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93545 states. [2019-09-10 06:37:37,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93545 to 20319. [2019-09-10 06:37:37,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20319 states. [2019-09-10 06:37:37,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20319 states to 20319 states and 28290 transitions. [2019-09-10 06:37:37,113 INFO L78 Accepts]: Start accepts. Automaton has 20319 states and 28290 transitions. Word has length 67 [2019-09-10 06:37:37,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:37,113 INFO L475 AbstractCegarLoop]: Abstraction has 20319 states and 28290 transitions. [2019-09-10 06:37:37,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:37:37,113 INFO L276 IsEmpty]: Start isEmpty. Operand 20319 states and 28290 transitions. [2019-09-10 06:37:37,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:37:37,116 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:37,116 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] [2019-09-10 06:37:37,117 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:37,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:37,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1363022706, now seen corresponding path program 1 times [2019-09-10 06:37:37,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:37,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:37,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:37,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:37,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:37,156 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:37:37,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:37,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:37:37,157 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:37,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:37:37,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:37:37,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:37,158 INFO L87 Difference]: Start difference. First operand 20319 states and 28290 transitions. Second operand 3 states. [2019-09-10 06:37:37,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:37,274 INFO L93 Difference]: Finished difference Result 24848 states and 34547 transitions. [2019-09-10 06:37:37,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:37:37,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-10 06:37:37,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:37,307 INFO L225 Difference]: With dead ends: 24848 [2019-09-10 06:37:37,307 INFO L226 Difference]: Without dead ends: 24848 [2019-09-10 06:37:37,308 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:37:37,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24848 states. [2019-09-10 06:37:37,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24848 to 19787. [2019-09-10 06:37:37,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19787 states. [2019-09-10 06:37:37,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19787 states to 19787 states and 27542 transitions. [2019-09-10 06:37:37,614 INFO L78 Accepts]: Start accepts. Automaton has 19787 states and 27542 transitions. Word has length 67 [2019-09-10 06:37:37,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:37,615 INFO L475 AbstractCegarLoop]: Abstraction has 19787 states and 27542 transitions. [2019-09-10 06:37:37,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:37:37,615 INFO L276 IsEmpty]: Start isEmpty. Operand 19787 states and 27542 transitions. [2019-09-10 06:37:37,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:37:37,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:37,620 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:37:37,620 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:37,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:37,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1412507135, now seen corresponding path program 1 times [2019-09-10 06:37:37,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:37,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:37,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:37,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:37,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:37,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:38,292 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:37:38,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:38,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 06:37:38,292 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:38,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:37:38,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:37:38,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:37:38,293 INFO L87 Difference]: Start difference. First operand 19787 states and 27542 transitions. Second operand 13 states. [2019-09-10 06:37:38,703 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2019-09-10 06:37:38,865 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 06:37:39,031 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 06:37:39,191 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-10 06:37:39,357 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 06:37:39,499 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 06:37:39,729 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-09-10 06:37:41,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:41,012 INFO L93 Difference]: Finished difference Result 69702 states and 97260 transitions. [2019-09-10 06:37:41,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:37:41,012 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-09-10 06:37:41,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:41,086 INFO L225 Difference]: With dead ends: 69702 [2019-09-10 06:37:41,086 INFO L226 Difference]: Without dead ends: 69702 [2019-09-10 06:37:41,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=210, Invalid=660, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:37:41,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69702 states. [2019-09-10 06:37:41,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69702 to 19635. [2019-09-10 06:37:41,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19635 states. [2019-09-10 06:37:41,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19635 states to 19635 states and 27336 transitions. [2019-09-10 06:37:41,550 INFO L78 Accepts]: Start accepts. Automaton has 19635 states and 27336 transitions. Word has length 68 [2019-09-10 06:37:41,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:41,551 INFO L475 AbstractCegarLoop]: Abstraction has 19635 states and 27336 transitions. [2019-09-10 06:37:41,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:37:41,551 INFO L276 IsEmpty]: Start isEmpty. Operand 19635 states and 27336 transitions. [2019-09-10 06:37:41,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:37:41,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:41,553 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:37:41,554 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:41,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:41,554 INFO L82 PathProgramCache]: Analyzing trace with hash -370961391, now seen corresponding path program 1 times [2019-09-10 06:37:41,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:41,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:41,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:41,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:41,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:41,615 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:37:41,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:41,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:37:41,616 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:41,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:37:41,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:37:41,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:37:41,617 INFO L87 Difference]: Start difference. First operand 19635 states and 27336 transitions. Second operand 5 states. [2019-09-10 06:37:41,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:41,731 INFO L93 Difference]: Finished difference Result 18827 states and 26245 transitions. [2019-09-10 06:37:41,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:37:41,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 06:37:41,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:41,753 INFO L225 Difference]: With dead ends: 18827 [2019-09-10 06:37:41,753 INFO L226 Difference]: Without dead ends: 18827 [2019-09-10 06:37:41,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:37:41,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18827 states. [2019-09-10 06:37:41,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18827 to 18823. [2019-09-10 06:37:41,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18823 states. [2019-09-10 06:37:42,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18823 states to 18823 states and 26243 transitions. [2019-09-10 06:37:42,024 INFO L78 Accepts]: Start accepts. Automaton has 18823 states and 26243 transitions. Word has length 71 [2019-09-10 06:37:42,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:42,025 INFO L475 AbstractCegarLoop]: Abstraction has 18823 states and 26243 transitions. [2019-09-10 06:37:42,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:37:42,025 INFO L276 IsEmpty]: Start isEmpty. Operand 18823 states and 26243 transitions. [2019-09-10 06:37:42,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:37:42,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:42,031 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:37:42,032 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:42,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:42,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1227529657, now seen corresponding path program 1 times [2019-09-10 06:37:42,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:42,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:42,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:42,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:42,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:42,164 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:37:42,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:42,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:37:42,165 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:42,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:37:42,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:37:42,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:37:42,167 INFO L87 Difference]: Start difference. First operand 18823 states and 26243 transitions. Second operand 6 states. [2019-09-10 06:37:42,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:42,382 INFO L93 Difference]: Finished difference Result 35948 states and 48967 transitions. [2019-09-10 06:37:42,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:37:42,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-09-10 06:37:42,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:42,434 INFO L225 Difference]: With dead ends: 35948 [2019-09-10 06:37:42,435 INFO L226 Difference]: Without dead ends: 35948 [2019-09-10 06:37:42,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:37:42,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35948 states. [2019-09-10 06:37:42,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35948 to 19453. [2019-09-10 06:37:42,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19453 states. [2019-09-10 06:37:42,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19453 states to 19453 states and 26703 transitions. [2019-09-10 06:37:42,876 INFO L78 Accepts]: Start accepts. Automaton has 19453 states and 26703 transitions. Word has length 74 [2019-09-10 06:37:42,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:42,877 INFO L475 AbstractCegarLoop]: Abstraction has 19453 states and 26703 transitions. [2019-09-10 06:37:42,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:37:42,877 INFO L276 IsEmpty]: Start isEmpty. Operand 19453 states and 26703 transitions. [2019-09-10 06:37:42,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:37:42,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:42,884 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:37:42,885 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:42,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:42,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1119890230, now seen corresponding path program 1 times [2019-09-10 06:37:42,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:42,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:42,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:42,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:42,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:42,954 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:37:42,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:42,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:37:42,955 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:42,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:37:42,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:37:42,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:42,956 INFO L87 Difference]: Start difference. First operand 19453 states and 26703 transitions. Second operand 3 states. [2019-09-10 06:37:43,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:43,074 INFO L93 Difference]: Finished difference Result 34589 states and 46618 transitions. [2019-09-10 06:37:43,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:37:43,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-10 06:37:43,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:43,118 INFO L225 Difference]: With dead ends: 34589 [2019-09-10 06:37:43,118 INFO L226 Difference]: Without dead ends: 34589 [2019-09-10 06:37:43,119 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:37:43,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34589 states. [2019-09-10 06:37:43,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34589 to 34167. [2019-09-10 06:37:43,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34167 states. [2019-09-10 06:37:43,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34167 states to 34167 states and 46197 transitions. [2019-09-10 06:37:43,509 INFO L78 Accepts]: Start accepts. Automaton has 34167 states and 46197 transitions. Word has length 75 [2019-09-10 06:37:43,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:43,509 INFO L475 AbstractCegarLoop]: Abstraction has 34167 states and 46197 transitions. [2019-09-10 06:37:43,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:37:43,509 INFO L276 IsEmpty]: Start isEmpty. Operand 34167 states and 46197 transitions. [2019-09-10 06:37:43,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:37:43,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:43,516 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:37:43,516 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:43,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:43,517 INFO L82 PathProgramCache]: Analyzing trace with hash 22683295, now seen corresponding path program 1 times [2019-09-10 06:37:43,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:43,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:43,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:43,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:43,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:43,562 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:37:43,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:43,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:37:43,563 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:43,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:37:43,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:37:43,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:43,564 INFO L87 Difference]: Start difference. First operand 34167 states and 46197 transitions. Second operand 3 states. [2019-09-10 06:37:43,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:43,714 INFO L93 Difference]: Finished difference Result 52955 states and 70598 transitions. [2019-09-10 06:37:43,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:37:43,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-10 06:37:43,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:43,773 INFO L225 Difference]: With dead ends: 52955 [2019-09-10 06:37:43,773 INFO L226 Difference]: Without dead ends: 52955 [2019-09-10 06:37:43,773 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:37:43,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52955 states. [2019-09-10 06:37:44,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52955 to 48369. [2019-09-10 06:37:44,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48369 states. [2019-09-10 06:37:44,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48369 states to 48369 states and 64813 transitions. [2019-09-10 06:37:44,211 INFO L78 Accepts]: Start accepts. Automaton has 48369 states and 64813 transitions. Word has length 76 [2019-09-10 06:37:44,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:44,211 INFO L475 AbstractCegarLoop]: Abstraction has 48369 states and 64813 transitions. [2019-09-10 06:37:44,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:37:44,211 INFO L276 IsEmpty]: Start isEmpty. Operand 48369 states and 64813 transitions. [2019-09-10 06:37:44,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:37:44,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:44,216 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:37:44,216 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:44,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:44,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1396060808, now seen corresponding path program 1 times [2019-09-10 06:37:44,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:44,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:44,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:44,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:44,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:44,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:44,505 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:37:44,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:44,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:37:44,506 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:44,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:37:44,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:37:44,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:37:44,507 INFO L87 Difference]: Start difference. First operand 48369 states and 64813 transitions. Second operand 5 states. [2019-09-10 06:37:45,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:45,150 INFO L93 Difference]: Finished difference Result 103479 states and 134211 transitions. [2019-09-10 06:37:45,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:37:45,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-10 06:37:45,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:45,313 INFO L225 Difference]: With dead ends: 103479 [2019-09-10 06:37:45,313 INFO L226 Difference]: Without dead ends: 103479 [2019-09-10 06:37:45,315 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 06:37:45,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103479 states. [2019-09-10 06:37:45,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103479 to 54685. [2019-09-10 06:37:45,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54685 states. [2019-09-10 06:37:45,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54685 states to 54685 states and 71596 transitions. [2019-09-10 06:37:45,959 INFO L78 Accepts]: Start accepts. Automaton has 54685 states and 71596 transitions. Word has length 81 [2019-09-10 06:37:45,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:45,960 INFO L475 AbstractCegarLoop]: Abstraction has 54685 states and 71596 transitions. [2019-09-10 06:37:45,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:37:45,960 INFO L276 IsEmpty]: Start isEmpty. Operand 54685 states and 71596 transitions. [2019-09-10 06:37:45,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 06:37:45,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:45,965 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:37:45,965 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:45,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:45,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1228531457, now seen corresponding path program 1 times [2019-09-10 06:37:45,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:45,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:45,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:45,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:45,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:46,020 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:37:46,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:46,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:37:46,021 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:46,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:37:46,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:37:46,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:37:46,022 INFO L87 Difference]: Start difference. First operand 54685 states and 71596 transitions. Second operand 5 states. [2019-09-10 06:37:46,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:46,579 INFO L93 Difference]: Finished difference Result 184255 states and 235381 transitions. [2019-09-10 06:37:46,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:37:46,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-09-10 06:37:46,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:46,776 INFO L225 Difference]: With dead ends: 184255 [2019-09-10 06:37:46,776 INFO L226 Difference]: Without dead ends: 184255 [2019-09-10 06:37:46,776 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 06:37:46,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184255 states. [2019-09-10 06:37:49,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184255 to 108767. [2019-09-10 06:37:49,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108767 states. [2019-09-10 06:37:49,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108767 states to 108767 states and 142028 transitions. [2019-09-10 06:37:49,572 INFO L78 Accepts]: Start accepts. Automaton has 108767 states and 142028 transitions. Word has length 83 [2019-09-10 06:37:49,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:49,573 INFO L475 AbstractCegarLoop]: Abstraction has 108767 states and 142028 transitions. [2019-09-10 06:37:49,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:37:49,573 INFO L276 IsEmpty]: Start isEmpty. Operand 108767 states and 142028 transitions. [2019-09-10 06:37:49,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 06:37:49,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:49,584 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:37:49,584 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:49,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:49,585 INFO L82 PathProgramCache]: Analyzing trace with hash -505184882, now seen corresponding path program 1 times [2019-09-10 06:37:49,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:49,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:49,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:49,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:49,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:49,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:49,627 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 06:37:49,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:49,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:37:49,628 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:49,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:37:49,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:37:49,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:49,629 INFO L87 Difference]: Start difference. First operand 108767 states and 142028 transitions. Second operand 3 states. [2019-09-10 06:37:49,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:49,853 INFO L93 Difference]: Finished difference Result 106183 states and 135037 transitions. [2019-09-10 06:37:49,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:37:49,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-10 06:37:49,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:49,969 INFO L225 Difference]: With dead ends: 106183 [2019-09-10 06:37:49,969 INFO L226 Difference]: Without dead ends: 106183 [2019-09-10 06:37:49,970 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:37:50,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106183 states. [2019-09-10 06:37:50,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106183 to 99801. [2019-09-10 06:37:50,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99801 states. [2019-09-10 06:37:53,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99801 states to 99801 states and 128148 transitions. [2019-09-10 06:37:53,788 INFO L78 Accepts]: Start accepts. Automaton has 99801 states and 128148 transitions. Word has length 94 [2019-09-10 06:37:53,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:53,788 INFO L475 AbstractCegarLoop]: Abstraction has 99801 states and 128148 transitions. [2019-09-10 06:37:53,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:37:53,788 INFO L276 IsEmpty]: Start isEmpty. Operand 99801 states and 128148 transitions. [2019-09-10 06:37:53,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 06:37:53,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:53,797 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:37:53,798 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:53,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:53,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1041325055, now seen corresponding path program 1 times [2019-09-10 06:37:53,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:53,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:53,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:53,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:53,799 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:53,856 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:37:53,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:53,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:37:53,857 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:53,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:37:53,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:37:53,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:53,861 INFO L87 Difference]: Start difference. First operand 99801 states and 128148 transitions. Second operand 3 states. [2019-09-10 06:37:54,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:54,240 INFO L93 Difference]: Finished difference Result 187827 states and 235237 transitions. [2019-09-10 06:37:54,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:37:54,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-10 06:37:54,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:54,434 INFO L225 Difference]: With dead ends: 187827 [2019-09-10 06:37:54,435 INFO L226 Difference]: Without dead ends: 187827 [2019-09-10 06:37:54,435 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:37:54,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187827 states. [2019-09-10 06:37:55,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187827 to 165005. [2019-09-10 06:37:55,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165005 states. [2019-09-10 06:37:56,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165005 states to 165005 states and 208720 transitions. [2019-09-10 06:37:56,794 INFO L78 Accepts]: Start accepts. Automaton has 165005 states and 208720 transitions. Word has length 95 [2019-09-10 06:37:56,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:56,794 INFO L475 AbstractCegarLoop]: Abstraction has 165005 states and 208720 transitions. [2019-09-10 06:37:56,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:37:56,795 INFO L276 IsEmpty]: Start isEmpty. Operand 165005 states and 208720 transitions. [2019-09-10 06:37:56,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:37:56,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:56,801 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:37:56,801 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:56,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:56,802 INFO L82 PathProgramCache]: Analyzing trace with hash -2081371009, now seen corresponding path program 1 times [2019-09-10 06:37:56,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:56,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:56,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:56,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:56,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:56,996 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:56,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:37:56,998 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:37:56,999 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 99 with the following transitions: [2019-09-10 06:37:57,002 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [71], [75], [88], [92], [105], [108], [111], [115], [118], [122], [133], [136], [139], [147], [150], [161], [164], [167], [171], [192], [195], [206], [208], [211], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [259], [271], [273], [317], [322], [335], [337], [350], [358], [377], [388], [390], [403], [411], [430], [445], [448], [451], [454], [456], [458], [499], [509], [523], [531], [547], [552], [568], [610], [611], [615], [616], [617] [2019-09-10 06:37:57,072 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:37:57,073 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:37:57,182 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:37:57,570 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:37:57,574 INFO L272 AbstractInterpreter]: Visited 92 different actions 326 times. Merged at 31 different actions 206 times. Widened at 10 different actions 22 times. Performed 1112 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1112 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 30 fixpoints after 9 different actions. Largest state had 114 variables. [2019-09-10 06:37:57,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:57,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:37:57,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:37:57,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:37:57,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:57,600 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:37:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:57,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 06:37:57,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:37:57,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:37:57,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:37:58,818 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:58,818 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:37:59,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:37:59,191 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:59,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:37:59,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 24 [2019-09-10 06:37:59,206 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:37:59,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:37:59,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:37:59,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:37:59,216 INFO L87 Difference]: Start difference. First operand 165005 states and 208720 transitions. Second operand 19 states. [2019-09-10 06:37:59,774 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 06:38:02,314 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-09-10 06:38:06,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:06,881 INFO L93 Difference]: Finished difference Result 573984 states and 725109 transitions. [2019-09-10 06:38:06,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 06:38:06,882 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 98 [2019-09-10 06:38:06,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:12,744 INFO L225 Difference]: With dead ends: 573984 [2019-09-10 06:38:12,744 INFO L226 Difference]: Without dead ends: 573984 [2019-09-10 06:38:12,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 169 SyntacticMatches, 14 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=425, Invalid=1737, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 06:38:13,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573984 states. [2019-09-10 06:38:15,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573984 to 165810. [2019-09-10 06:38:15,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165810 states. [2019-09-10 06:38:16,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165810 states to 165810 states and 209707 transitions. [2019-09-10 06:38:16,212 INFO L78 Accepts]: Start accepts. Automaton has 165810 states and 209707 transitions. Word has length 98 [2019-09-10 06:38:16,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:16,212 INFO L475 AbstractCegarLoop]: Abstraction has 165810 states and 209707 transitions. [2019-09-10 06:38:16,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:38:16,212 INFO L276 IsEmpty]: Start isEmpty. Operand 165810 states and 209707 transitions. [2019-09-10 06:38:16,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:38:16,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:16,232 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:38:16,232 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:16,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:16,232 INFO L82 PathProgramCache]: Analyzing trace with hash -569185905, now seen corresponding path program 1 times [2019-09-10 06:38:16,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:16,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:16,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:16,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:16,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:16,444 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:16,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:16,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:38:16,445 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:16,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:38:16,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:38:16,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:38:16,447 INFO L87 Difference]: Start difference. First operand 165810 states and 209707 transitions. Second operand 10 states. [2019-09-10 06:38:19,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:19,409 INFO L93 Difference]: Finished difference Result 552399 states and 692763 transitions. [2019-09-10 06:38:19,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 06:38:19,409 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 98 [2019-09-10 06:38:19,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:20,135 INFO L225 Difference]: With dead ends: 552399 [2019-09-10 06:38:20,135 INFO L226 Difference]: Without dead ends: 552399 [2019-09-10 06:38:20,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=369, Invalid=1113, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 06:38:25,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552399 states. [2019-09-10 06:38:28,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552399 to 224259. [2019-09-10 06:38:28,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224259 states. [2019-09-10 06:38:28,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224259 states to 224259 states and 283586 transitions. [2019-09-10 06:38:28,405 INFO L78 Accepts]: Start accepts. Automaton has 224259 states and 283586 transitions. Word has length 98 [2019-09-10 06:38:28,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:28,405 INFO L475 AbstractCegarLoop]: Abstraction has 224259 states and 283586 transitions. [2019-09-10 06:38:28,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:38:28,405 INFO L276 IsEmpty]: Start isEmpty. Operand 224259 states and 283586 transitions. [2019-09-10 06:38:28,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:38:28,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:28,412 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:38:28,413 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:28,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:28,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1695242657, now seen corresponding path program 1 times [2019-09-10 06:38:28,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:28,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:28,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:28,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:28,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:28,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:28,614 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:28,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:38:28,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:38:28,615 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 99 with the following transitions: [2019-09-10 06:38:28,615 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [71], [75], [78], [81], [84], [86], [88], [92], [105], [108], [111], [115], [118], [122], [133], [136], [147], [150], [153], [161], [164], [167], [171], [192], [195], [206], [208], [211], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [259], [271], [273], [317], [322], [335], [337], [350], [358], [377], [388], [390], [393], [396], [399], [401], [403], [445], [458], [466], [485], [497], [511], [523], [531], [547], [573], [589], [610], [611], [615], [616], [617] [2019-09-10 06:38:28,619 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:38:28,620 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:38:28,642 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:38:28,959 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:38:28,960 INFO L272 AbstractInterpreter]: Visited 92 different actions 366 times. Merged at 33 different actions 243 times. Widened at 12 different actions 36 times. Performed 1280 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1280 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 33 fixpoints after 8 different actions. Largest state had 114 variables. [2019-09-10 06:38:28,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:28,963 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:38:28,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:38:28,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:38:28,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:28,996 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:38:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:29,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 06:38:29,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:38:29,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:38:29,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:38:30,108 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:30,108 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:38:30,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:38:30,424 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:30,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:38:30,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 24 [2019-09-10 06:38:30,431 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:38:30,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:38:30,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:38:30,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:38:30,432 INFO L87 Difference]: Start difference. First operand 224259 states and 283586 transitions. Second operand 19 states. [2019-09-10 06:38:30,844 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-10 06:38:33,788 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-10 06:38:34,210 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-10 06:38:35,234 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 06:38:36,906 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 06:38:38,295 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-10 06:38:40,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:40,592 INFO L93 Difference]: Finished difference Result 678703 states and 846940 transitions. [2019-09-10 06:38:40,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 06:38:40,592 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 98 [2019-09-10 06:38:40,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:41,569 INFO L225 Difference]: With dead ends: 678703 [2019-09-10 06:38:41,569 INFO L226 Difference]: Without dead ends: 678703 [2019-09-10 06:38:41,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 174 SyntacticMatches, 9 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=654, Invalid=2208, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 06:38:41,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678703 states. [2019-09-10 06:38:52,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678703 to 291858. [2019-09-10 06:38:52,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291858 states. [2019-09-10 06:38:53,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291858 states to 291858 states and 367832 transitions. [2019-09-10 06:38:53,044 INFO L78 Accepts]: Start accepts. Automaton has 291858 states and 367832 transitions. Word has length 98 [2019-09-10 06:38:53,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:53,044 INFO L475 AbstractCegarLoop]: Abstraction has 291858 states and 367832 transitions. [2019-09-10 06:38:53,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:38:53,044 INFO L276 IsEmpty]: Start isEmpty. Operand 291858 states and 367832 transitions. [2019-09-10 06:38:53,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 06:38:53,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:53,053 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:38:53,053 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:53,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:53,053 INFO L82 PathProgramCache]: Analyzing trace with hash -568794473, now seen corresponding path program 1 times [2019-09-10 06:38:53,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:53,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:53,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:53,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:53,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:53,190 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:53,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:38:53,192 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:38:53,192 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2019-09-10 06:38:53,194 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [71], [75], [88], [92], [105], [108], [111], [115], [118], [122], [133], [136], [139], [147], [150], [161], [164], [167], [171], [192], [195], [198], [206], [208], [211], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [259], [271], [273], [317], [322], [335], [337], [350], [358], [377], [386], [390], [403], [411], [430], [445], [448], [451], [454], [456], [458], [499], [509], [523], [531], [547], [552], [568], [610], [611], [615], [616], [617] [2019-09-10 06:38:53,201 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:38:53,202 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:38:53,218 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:38:53,410 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:38:53,410 INFO L272 AbstractInterpreter]: Visited 93 different actions 358 times. Merged at 32 different actions 235 times. Widened at 10 different actions 28 times. Performed 1250 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1250 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 31 fixpoints after 10 different actions. Largest state had 114 variables. [2019-09-10 06:38:53,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:53,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:38:53,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:38:53,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:38:53,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:53,431 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:38:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:53,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 06:38:53,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:38:53,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:38:54,250 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:38:54,251 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:38:54,648 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:38:54,661 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:38:54,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [5] total 23 [2019-09-10 06:38:54,662 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:54,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:38:54,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:38:54,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:38:54,663 INFO L87 Difference]: Start difference. First operand 291858 states and 367832 transitions. Second operand 11 states. [2019-09-10 06:38:55,572 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-09-10 06:38:55,758 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 06:38:56,098 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 06:38:58,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:58,700 INFO L93 Difference]: Finished difference Result 536021 states and 674033 transitions. [2019-09-10 06:38:58,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:38:58,701 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2019-09-10 06:38:58,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:59,348 INFO L225 Difference]: With dead ends: 536021 [2019-09-10 06:38:59,348 INFO L226 Difference]: Without dead ends: 536021 [2019-09-10 06:38:59,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 173 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2019-09-10 06:38:59,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536021 states. [2019-09-10 06:39:13,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536021 to 340670. [2019-09-10 06:39:13,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340670 states. [2019-09-10 06:39:13,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340670 states to 340670 states and 428701 transitions. [2019-09-10 06:39:13,573 INFO L78 Accepts]: Start accepts. Automaton has 340670 states and 428701 transitions. Word has length 99 [2019-09-10 06:39:13,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:13,574 INFO L475 AbstractCegarLoop]: Abstraction has 340670 states and 428701 transitions. [2019-09-10 06:39:13,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:39:13,574 INFO L276 IsEmpty]: Start isEmpty. Operand 340670 states and 428701 transitions. [2019-09-10 06:39:13,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 06:39:13,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:13,581 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:39:13,581 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:13,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:13,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1968104405, now seen corresponding path program 1 times [2019-09-10 06:39:13,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:13,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:13,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:13,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:13,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:13,630 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 06:39:13,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:39:13,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:39:13,631 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:39:13,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:39:13,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:39:13,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:39:13,632 INFO L87 Difference]: Start difference. First operand 340670 states and 428701 transitions. Second operand 3 states. [2019-09-10 06:39:15,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:15,385 INFO L93 Difference]: Finished difference Result 326953 states and 409175 transitions. [2019-09-10 06:39:15,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:39:15,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 06:39:15,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:39:15,836 INFO L225 Difference]: With dead ends: 326953 [2019-09-10 06:39:15,837 INFO L226 Difference]: Without dead ends: 326953 [2019-09-10 06:39:15,837 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:39:16,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326953 states. [2019-09-10 06:39:24,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326953 to 326953. [2019-09-10 06:39:24,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326953 states. [2019-09-10 06:39:24,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326953 states to 326953 states and 409175 transitions. [2019-09-10 06:39:24,886 INFO L78 Accepts]: Start accepts. Automaton has 326953 states and 409175 transitions. Word has length 99 [2019-09-10 06:39:24,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:24,886 INFO L475 AbstractCegarLoop]: Abstraction has 326953 states and 409175 transitions. [2019-09-10 06:39:24,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:39:24,886 INFO L276 IsEmpty]: Start isEmpty. Operand 326953 states and 409175 transitions. [2019-09-10 06:39:24,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 06:39:24,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:24,894 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:39:24,894 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:24,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:24,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1836683574, now seen corresponding path program 1 times [2019-09-10 06:39:24,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:24,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:24,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:24,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:24,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:25,006 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:39:25,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:39:25,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:39:25,007 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2019-09-10 06:39:25,007 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [71], [75], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [133], [136], [147], [150], [161], [164], [167], [171], [192], [195], [206], [208], [211], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [259], [269], [273], [317], [322], [335], [337], [340], [343], [346], [348], [350], [388], [390], [403], [411], [430], [445], [458], [466], [485], [499], [511], [521], [552], [568], [573], [589], [610], [611], [615], [616], [617] [2019-09-10 06:39:25,010 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:39:25,010 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:39:25,035 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:39:25,169 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:39:25,169 INFO L272 AbstractInterpreter]: Visited 93 different actions 273 times. Merged at 34 different actions 163 times. Widened at 8 different actions 16 times. Performed 978 root evaluator evaluations with a maximum evaluation depth of 5. Performed 978 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 16 fixpoints after 8 different actions. Largest state had 114 variables. [2019-09-10 06:39:25,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:25,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:39:25,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:39:25,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:39:25,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:25,191 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:39:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:25,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 06:39:25,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:39:25,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:25,712 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 06:39:25,712 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:39:26,775 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 06:39:26,787 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:39:26,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [5] total 23 [2019-09-10 06:39:26,788 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:39:26,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:39:26,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:39:26,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:39:26,790 INFO L87 Difference]: Start difference. First operand 326953 states and 409175 transitions. Second operand 11 states. [2019-09-10 06:39:27,732 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 06:39:28,002 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 06:39:30,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:30,053 INFO L93 Difference]: Finished difference Result 528990 states and 661592 transitions. [2019-09-10 06:39:30,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:39:30,054 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2019-09-10 06:39:30,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:39:36,213 INFO L225 Difference]: With dead ends: 528990 [2019-09-10 06:39:36,213 INFO L226 Difference]: Without dead ends: 528990 [2019-09-10 06:39:36,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=177, Invalid=753, Unknown=0, NotChecked=0, Total=930 [2019-09-10 06:39:36,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528990 states. [2019-09-10 06:39:40,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528990 to 360984. [2019-09-10 06:39:40,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360984 states. [2019-09-10 06:39:41,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360984 states to 360984 states and 451595 transitions. [2019-09-10 06:39:41,140 INFO L78 Accepts]: Start accepts. Automaton has 360984 states and 451595 transitions. Word has length 99 [2019-09-10 06:39:41,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:41,140 INFO L475 AbstractCegarLoop]: Abstraction has 360984 states and 451595 transitions. [2019-09-10 06:39:41,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:39:41,140 INFO L276 IsEmpty]: Start isEmpty. Operand 360984 states and 451595 transitions. [2019-09-10 06:39:41,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 06:39:41,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:41,146 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:39:41,146 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:41,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:41,146 INFO L82 PathProgramCache]: Analyzing trace with hash -73895053, now seen corresponding path program 1 times [2019-09-10 06:39:41,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:41,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:41,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:41,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:41,148 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:41,197 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:39:41,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:39:41,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:39:41,198 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:39:41,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:39:41,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:39:41,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:39:41,199 INFO L87 Difference]: Start difference. First operand 360984 states and 451595 transitions. Second operand 3 states. [2019-09-10 06:39:46,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:46,812 INFO L93 Difference]: Finished difference Result 360986 states and 442642 transitions. [2019-09-10 06:39:46,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:39:46,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 06:39:46,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:39:47,281 INFO L225 Difference]: With dead ends: 360986 [2019-09-10 06:39:47,281 INFO L226 Difference]: Without dead ends: 360986 [2019-09-10 06:39:47,281 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:39:47,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360986 states. [2019-09-10 06:39:50,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360986 to 356061. [2019-09-10 06:39:50,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356061 states. [2019-09-10 06:39:50,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356061 states to 356061 states and 436668 transitions. [2019-09-10 06:39:50,691 INFO L78 Accepts]: Start accepts. Automaton has 356061 states and 436668 transitions. Word has length 99 [2019-09-10 06:39:50,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:50,692 INFO L475 AbstractCegarLoop]: Abstraction has 356061 states and 436668 transitions. [2019-09-10 06:39:50,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:39:50,692 INFO L276 IsEmpty]: Start isEmpty. Operand 356061 states and 436668 transitions. [2019-09-10 06:39:50,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 06:39:50,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:50,698 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:39:50,699 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:50,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:50,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1387106381, now seen corresponding path program 1 times [2019-09-10 06:39:50,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:50,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:50,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:50,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:50,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:50,812 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:39:50,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:39:50,813 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:39:50,813 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2019-09-10 06:39:50,814 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [71], [75], [78], [81], [84], [86], [88], [92], [105], [108], [111], [115], [118], [122], [133], [136], [147], [150], [153], [161], [164], [167], [171], [192], [195], [206], [208], [211], [214], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [259], [271], [273], [317], [322], [333], [337], [350], [358], [377], [388], [390], [393], [396], [399], [401], [403], [445], [458], [466], [485], [497], [511], [523], [531], [547], [573], [589], [610], [611], [615], [616], [617] [2019-09-10 06:39:50,817 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:39:50,817 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:39:50,830 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:39:50,977 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:39:50,978 INFO L272 AbstractInterpreter]: Visited 93 different actions 346 times. Merged at 34 different actions 226 times. Widened at 13 different actions 32 times. Performed 1177 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1177 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 10 different actions. Largest state had 114 variables. [2019-09-10 06:39:50,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:50,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:39:50,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:39:50,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:39:50,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:50,999 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:39:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:51,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-10 06:39:51,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:39:52,093 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:39:52,094 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:39:52,171 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:39:52,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:39:52,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2019-09-10 06:39:52,185 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:39:52,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:39:52,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:39:52,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:39:52,186 INFO L87 Difference]: Start difference. First operand 356061 states and 436668 transitions. Second operand 7 states. [2019-09-10 06:39:53,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:53,375 INFO L93 Difference]: Finished difference Result 539921 states and 654639 transitions. [2019-09-10 06:39:53,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:39:53,375 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2019-09-10 06:39:53,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:39:54,019 INFO L225 Difference]: With dead ends: 539921 [2019-09-10 06:39:54,020 INFO L226 Difference]: Without dead ends: 539921 [2019-09-10 06:39:54,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 193 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:39:55,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539921 states. [2019-09-10 06:40:05,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539921 to 438469. [2019-09-10 06:40:05,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438469 states. [2019-09-10 06:40:06,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438469 states to 438469 states and 535691 transitions. [2019-09-10 06:40:06,269 INFO L78 Accepts]: Start accepts. Automaton has 438469 states and 535691 transitions. Word has length 99 [2019-09-10 06:40:06,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:40:06,269 INFO L475 AbstractCegarLoop]: Abstraction has 438469 states and 535691 transitions. [2019-09-10 06:40:06,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:40:06,269 INFO L276 IsEmpty]: Start isEmpty. Operand 438469 states and 535691 transitions. [2019-09-10 06:40:06,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 06:40:06,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:40:06,278 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:40:06,278 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:40:06,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:06,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1894982123, now seen corresponding path program 1 times [2019-09-10 06:40:06,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:40:06,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:06,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:06,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:06,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:40:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:06,321 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:40:06,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:40:06,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:40:06,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:40:06,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:40:06,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:40:06,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:40:06,324 INFO L87 Difference]: Start difference. First operand 438469 states and 535691 transitions. Second operand 4 states. [2019-09-10 06:40:13,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:40:13,182 INFO L93 Difference]: Finished difference Result 590301 states and 719832 transitions. [2019-09-10 06:40:13,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:40:13,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-10 06:40:13,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:13,930 INFO L225 Difference]: With dead ends: 590301 [2019-09-10 06:40:13,930 INFO L226 Difference]: Without dead ends: 590301 [2019-09-10 06:40:13,931 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:40:14,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590301 states. [2019-09-10 06:40:19,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590301 to 409392. [2019-09-10 06:40:19,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409392 states. [2019-09-10 06:40:20,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409392 states to 409392 states and 500125 transitions. [2019-09-10 06:40:20,909 INFO L78 Accepts]: Start accepts. Automaton has 409392 states and 500125 transitions. Word has length 108 [2019-09-10 06:40:20,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:40:20,909 INFO L475 AbstractCegarLoop]: Abstraction has 409392 states and 500125 transitions. [2019-09-10 06:40:20,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:40:20,909 INFO L276 IsEmpty]: Start isEmpty. Operand 409392 states and 500125 transitions. [2019-09-10 06:40:20,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 06:40:20,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:40:20,917 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:40:20,918 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:40:20,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:20,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1134154608, now seen corresponding path program 1 times [2019-09-10 06:40:20,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:40:20,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:20,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:20,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:20,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:40:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:20,981 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:20,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:40:20,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:40:20,982 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:40:20,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:40:20,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:40:20,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:40:20,983 INFO L87 Difference]: Start difference. First operand 409392 states and 500125 transitions. Second operand 5 states. [2019-09-10 06:40:22,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:40:22,311 INFO L93 Difference]: Finished difference Result 429666 states and 520301 transitions. [2019-09-10 06:40:22,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 06:40:22,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2019-09-10 06:40:22,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:22,851 INFO L225 Difference]: With dead ends: 429666 [2019-09-10 06:40:22,851 INFO L226 Difference]: Without dead ends: 429666 [2019-09-10 06:40:22,851 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 06:40:23,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429666 states. [2019-09-10 06:40:34,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429666 to 395877. [2019-09-10 06:40:34,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395877 states. [2019-09-10 06:40:34,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395877 states to 395877 states and 479555 transitions. [2019-09-10 06:40:34,613 INFO L78 Accepts]: Start accepts. Automaton has 395877 states and 479555 transitions. Word has length 108 [2019-09-10 06:40:34,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:40:34,613 INFO L475 AbstractCegarLoop]: Abstraction has 395877 states and 479555 transitions. [2019-09-10 06:40:34,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:40:34,613 INFO L276 IsEmpty]: Start isEmpty. Operand 395877 states and 479555 transitions. [2019-09-10 06:40:34,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 06:40:34,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:40:34,621 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:40:34,622 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:40:34,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:34,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1423111520, now seen corresponding path program 1 times [2019-09-10 06:40:34,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:40:34,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:34,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:34,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:34,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:40:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:34,907 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:34,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:40:34,907 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:40:34,907 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 112 with the following transitions: [2019-09-10 06:40:34,907 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [71], [75], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [128], [131], [133], [136], [139], [147], [150], [161], [164], [167], [171], [192], [195], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [324], [326], [329], [337], [340], [343], [346], [348], [350], [388], [390], [403], [411], [414], [417], [420], [422], [445], [448], [451], [454], [456], [458], [499], [509], [552], [568], [610], [611], [615], [616], [617] [2019-09-10 06:40:34,909 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:40:34,910 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:40:34,921 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:40:36,104 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:40:36,104 INFO L272 AbstractInterpreter]: Visited 106 different actions 380 times. Merged at 41 different actions 248 times. Widened at 13 different actions 34 times. Performed 1252 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1252 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 19 fixpoints after 10 different actions. Largest state had 117 variables. [2019-09-10 06:40:36,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:36,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:40:36,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:40:36,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:40:36,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:36,135 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:40:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:36,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 06:40:36,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:40:36,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:36,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:36,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:36,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:36,703 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:36,703 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:40:37,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:37,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:37,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:37,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:37,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:37,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:37,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:37,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:40:37,242 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:40:37,251 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:40:37,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [12] total 32 [2019-09-10 06:40:37,252 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:40:37,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:40:37,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:40:37,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-10 06:40:37,253 INFO L87 Difference]: Start difference. First operand 395877 states and 479555 transitions. Second operand 12 states. [2019-09-10 06:40:39,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:40:39,483 INFO L93 Difference]: Finished difference Result 417908 states and 505439 transitions. [2019-09-10 06:40:39,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 06:40:39,483 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2019-09-10 06:40:39,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:45,536 INFO L225 Difference]: With dead ends: 417908 [2019-09-10 06:40:45,536 INFO L226 Difference]: Without dead ends: 417908 [2019-09-10 06:40:45,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 201 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=215, Invalid=1591, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 06:40:45,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417908 states. [2019-09-10 06:40:48,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417908 to 410378. [2019-09-10 06:40:48,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410378 states. [2019-09-10 06:40:50,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410378 states to 410378 states and 496695 transitions. [2019-09-10 06:40:50,230 INFO L78 Accepts]: Start accepts. Automaton has 410378 states and 496695 transitions. Word has length 111 [2019-09-10 06:40:50,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:40:50,230 INFO L475 AbstractCegarLoop]: Abstraction has 410378 states and 496695 transitions. [2019-09-10 06:40:50,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:40:50,231 INFO L276 IsEmpty]: Start isEmpty. Operand 410378 states and 496695 transitions. [2019-09-10 06:40:50,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 06:40:50,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:40:50,239 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:40:50,239 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:40:50,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:40:50,240 INFO L82 PathProgramCache]: Analyzing trace with hash 168777847, now seen corresponding path program 1 times [2019-09-10 06:40:50,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:40:50,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:50,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:40:50,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:40:50,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:40:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:40:50,293 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 06:40:50,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:40:50,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:40:50,294 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:40:50,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:40:50,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:40:50,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:40:50,295 INFO L87 Difference]: Start difference. First operand 410378 states and 496695 transitions. Second operand 4 states. [2019-09-10 06:40:58,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:40:58,271 INFO L93 Difference]: Finished difference Result 588594 states and 709840 transitions. [2019-09-10 06:40:58,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:40:58,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-09-10 06:40:58,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:40:59,069 INFO L225 Difference]: With dead ends: 588594 [2019-09-10 06:40:59,069 INFO L226 Difference]: Without dead ends: 588594 [2019-09-10 06:40:59,069 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:40:59,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588594 states. [2019-09-10 06:41:03,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588594 to 410311. [2019-09-10 06:41:03,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410311 states. [2019-09-10 06:41:04,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410311 states to 410311 states and 496609 transitions. [2019-09-10 06:41:04,200 INFO L78 Accepts]: Start accepts. Automaton has 410311 states and 496609 transitions. Word has length 111 [2019-09-10 06:41:04,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:04,200 INFO L475 AbstractCegarLoop]: Abstraction has 410311 states and 496609 transitions. [2019-09-10 06:41:04,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:41:04,200 INFO L276 IsEmpty]: Start isEmpty. Operand 410311 states and 496609 transitions. [2019-09-10 06:41:04,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 06:41:04,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:04,207 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:41:04,208 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:04,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:04,208 INFO L82 PathProgramCache]: Analyzing trace with hash 805339762, now seen corresponding path program 1 times [2019-09-10 06:41:04,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:04,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:04,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:04,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:04,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:04,447 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:04,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:41:04,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:41:04,448 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 112 with the following transitions: [2019-09-10 06:41:04,448 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [71], [75], [78], [81], [84], [86], [88], [92], [105], [108], [111], [115], [118], [122], [133], [136], [139], [142], [145], [147], [150], [153], [161], [164], [167], [171], [192], [195], [198], [201], [206], [208], [211], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [324], [335], [337], [350], [358], [361], [364], [367], [369], [379], [382], [390], [393], [396], [399], [401], [403], [445], [448], [451], [454], [456], [458], [497], [523], [531], [547], [610], [611], [615], [616], [617] [2019-09-10 06:41:04,450 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:41:04,450 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:41:04,461 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:41:04,663 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:41:04,663 INFO L272 AbstractInterpreter]: Visited 106 different actions 413 times. Merged at 41 different actions 281 times. Widened at 11 different actions 37 times. Performed 1334 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1334 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 24 fixpoints after 10 different actions. Largest state had 117 variables. [2019-09-10 06:41:04,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:04,663 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:41:04,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:41:04,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:41:04,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:04,682 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:41:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:05,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 06:41:05,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:41:05,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:05,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:05,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:06,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:06,228 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:06,228 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:41:06,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:06,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:06,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:06,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:06,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:06,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:06,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:06,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:06,973 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:41:06,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:41:06,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2019-09-10 06:41:06,988 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:41:06,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:41:06,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:41:06,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-10 06:41:06,990 INFO L87 Difference]: Start difference. First operand 410311 states and 496609 transitions. Second operand 22 states. [2019-09-10 06:41:07,181 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2019-09-10 06:41:10,159 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 42 [2019-09-10 06:41:11,210 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 42 [2019-09-10 06:41:11,963 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 44 [2019-09-10 06:41:12,375 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 44 [2019-09-10 06:41:12,789 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 46 [2019-09-10 06:41:13,027 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 38 [2019-09-10 06:41:13,201 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 38 [2019-09-10 06:41:14,358 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 45 [2019-09-10 06:41:14,687 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 40 [2019-09-10 06:41:14,915 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 47 [2019-09-10 06:41:15,288 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 44 [2019-09-10 06:41:15,650 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 45 [2019-09-10 06:41:15,862 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 46 [2019-09-10 06:41:16,418 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 47 [2019-09-10 06:41:16,610 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 41 [2019-09-10 06:41:17,224 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 40 [2019-09-10 06:41:17,422 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 43 [2019-09-10 06:41:17,658 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 44 [2019-09-10 06:41:17,892 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 41 [2019-09-10 06:41:18,057 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 43 [2019-09-10 06:41:18,656 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 39 [2019-09-10 06:41:19,325 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 45 [2019-09-10 06:41:19,551 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 46 [2019-09-10 06:41:19,850 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 42 [2019-09-10 06:41:20,046 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 40 [2019-09-10 06:41:20,254 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 45 [2019-09-10 06:41:20,624 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 42 [2019-09-10 06:41:20,882 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2019-09-10 06:41:21,318 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 39 [2019-09-10 06:41:22,208 WARN L188 SmtUtils]: Spent 821.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 36 [2019-09-10 06:41:22,752 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-09-10 06:41:23,022 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2019-09-10 06:41:23,232 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 45 [2019-09-10 06:41:23,444 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 42 [2019-09-10 06:41:23,621 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 43 [2019-09-10 06:41:23,788 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 40 [2019-09-10 06:41:24,238 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 48 [2019-09-10 06:41:24,447 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 45 [2019-09-10 06:41:24,660 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 46 [2019-09-10 06:41:24,838 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 42 [2019-09-10 06:41:25,341 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 42 [2019-09-10 06:41:25,512 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 40 [2019-09-10 06:41:25,880 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 48 [2019-09-10 06:41:26,086 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 33 [2019-09-10 06:41:26,319 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 45 [2019-09-10 06:41:26,529 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 42 [2019-09-10 06:41:26,706 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 43 [2019-09-10 06:41:26,887 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 39 [2019-09-10 06:41:27,314 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 45 [2019-09-10 06:41:27,667 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 39 [2019-09-10 06:41:27,849 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2019-09-10 06:41:28,054 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 37 [2019-09-10 06:41:28,236 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 37 [2019-09-10 06:41:28,428 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 42 [2019-09-10 06:41:28,681 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2019-09-10 06:41:32,201 WARN L188 SmtUtils]: Spent 3.44 s on a formula simplification. DAG size of input: 79 DAG size of output: 40 [2019-09-10 06:41:32,614 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 39 [2019-09-10 06:41:33,055 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2019-09-10 06:41:33,577 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2019-09-10 06:41:33,778 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-09-10 06:41:34,016 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 42 [2019-09-10 06:41:34,211 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 36 [2019-09-10 06:41:34,429 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2019-09-10 06:41:34,616 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2019-09-10 06:41:34,789 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 33 [2019-09-10 06:41:35,163 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 36 [2019-09-10 06:41:35,336 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2019-09-10 06:41:36,376 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 40 [2019-09-10 06:41:36,969 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 39 [2019-09-10 06:41:37,615 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2019-09-10 06:41:38,411 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 39 [2019-09-10 06:41:38,651 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2019-09-10 06:41:39,029 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 33 [2019-09-10 06:41:39,560 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 36 [2019-09-10 06:41:40,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:40,894 INFO L93 Difference]: Finished difference Result 764311 states and 918688 transitions. [2019-09-10 06:41:40,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2019-09-10 06:41:40,894 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 111 [2019-09-10 06:41:40,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:41:42,598 INFO L225 Difference]: With dead ends: 764311 [2019-09-10 06:41:42,598 INFO L226 Difference]: Without dead ends: 764311 [2019-09-10 06:41:42,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 201 SyntacticMatches, 2 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8264 ImplicationChecksByTransitivity, 27.1s TimeCoverageRelationStatistics Valid=5130, Invalid=21276, Unknown=0, NotChecked=0, Total=26406 [2019-09-10 06:41:43,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764311 states. [2019-09-10 06:41:49,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764311 to 410227. [2019-09-10 06:41:49,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410227 states. [2019-09-10 06:41:51,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410227 states to 410227 states and 496516 transitions. [2019-09-10 06:41:51,001 INFO L78 Accepts]: Start accepts. Automaton has 410227 states and 496516 transitions. Word has length 111 [2019-09-10 06:41:51,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:41:51,002 INFO L475 AbstractCegarLoop]: Abstraction has 410227 states and 496516 transitions. [2019-09-10 06:41:51,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:41:51,002 INFO L276 IsEmpty]: Start isEmpty. Operand 410227 states and 496516 transitions. [2019-09-10 06:41:51,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 06:41:51,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:41:51,008 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:41:51,008 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:41:51,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:41:51,008 INFO L82 PathProgramCache]: Analyzing trace with hash -232607389, now seen corresponding path program 1 times [2019-09-10 06:41:51,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:41:51,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:51,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:41:51,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:41:51,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:41:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:41:51,046 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:41:51,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:41:51,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:41:51,047 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:41:51,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:41:51,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:41:51,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:41:51,048 INFO L87 Difference]: Start difference. First operand 410227 states and 496516 transitions. Second operand 4 states. [2019-09-10 06:41:59,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:41:59,688 INFO L93 Difference]: Finished difference Result 731729 states and 882924 transitions. [2019-09-10 06:41:59,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:41:59,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-09-10 06:41:59,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:00,608 INFO L225 Difference]: With dead ends: 731729 [2019-09-10 06:42:00,608 INFO L226 Difference]: Without dead ends: 731729 [2019-09-10 06:42:00,608 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:42:01,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731729 states. [2019-09-10 06:42:05,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731729 to 430112. [2019-09-10 06:42:05,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430112 states. [2019-09-10 06:42:06,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430112 states to 430112 states and 521007 transitions. [2019-09-10 06:42:06,009 INFO L78 Accepts]: Start accepts. Automaton has 430112 states and 521007 transitions. Word has length 111 [2019-09-10 06:42:06,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:06,009 INFO L475 AbstractCegarLoop]: Abstraction has 430112 states and 521007 transitions. [2019-09-10 06:42:06,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:42:06,009 INFO L276 IsEmpty]: Start isEmpty. Operand 430112 states and 521007 transitions. [2019-09-10 06:42:06,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 06:42:06,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:06,015 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:42:06,016 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:06,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:06,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1669773282, now seen corresponding path program 1 times [2019-09-10 06:42:06,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:06,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:06,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:06,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:06,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:07,178 WARN L188 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2019-09-10 06:42:07,360 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:07,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:42:07,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:42:07,360 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:42:07,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:42:07,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:42:07,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:42:07,361 INFO L87 Difference]: Start difference. First operand 430112 states and 521007 transitions. Second operand 12 states. [2019-09-10 06:42:10,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:10,429 INFO L93 Difference]: Finished difference Result 546877 states and 662342 transitions. [2019-09-10 06:42:10,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 06:42:10,430 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2019-09-10 06:42:10,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:17,510 INFO L225 Difference]: With dead ends: 546877 [2019-09-10 06:42:17,510 INFO L226 Difference]: Without dead ends: 546877 [2019-09-10 06:42:17,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:42:17,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546877 states. [2019-09-10 06:42:21,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546877 to 430091. [2019-09-10 06:42:21,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430091 states. [2019-09-10 06:42:22,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430091 states to 430091 states and 520986 transitions. [2019-09-10 06:42:22,573 INFO L78 Accepts]: Start accepts. Automaton has 430091 states and 520986 transitions. Word has length 111 [2019-09-10 06:42:22,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:22,573 INFO L475 AbstractCegarLoop]: Abstraction has 430091 states and 520986 transitions. [2019-09-10 06:42:22,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:42:22,573 INFO L276 IsEmpty]: Start isEmpty. Operand 430091 states and 520986 transitions. [2019-09-10 06:42:22,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 06:42:22,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:22,577 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:42:22,577 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:22,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:22,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1608499600, now seen corresponding path program 1 times [2019-09-10 06:42:22,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:22,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:22,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:22,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:22,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:23,201 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:23,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:23,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:42:23,202 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2019-09-10 06:42:23,202 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [71], [75], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [128], [133], [136], [139], [147], [150], [161], [164], [167], [171], [192], [195], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [324], [326], [329], [337], [340], [343], [346], [348], [350], [388], [390], [403], [411], [414], [417], [420], [422], [445], [448], [451], [454], [456], [458], [499], [509], [514], [519], [552], [568], [610], [611], [615], [616], [617] [2019-09-10 06:42:23,205 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:42:23,205 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:42:23,220 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:42:23,428 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:42:23,429 INFO L272 AbstractInterpreter]: Visited 107 different actions 404 times. Merged at 41 different actions 270 times. Widened at 14 different actions 34 times. Performed 1279 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1279 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 20 fixpoints after 12 different actions. Largest state had 117 variables. [2019-09-10 06:42:23,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:23,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:42:23,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:23,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:42:23,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:23,455 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:42:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:23,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 06:42:23,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:42:23,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:23,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:23,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:23,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:24,174 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:24,175 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:42:24,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:24,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:24,536 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:24,547 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:42:24,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [19] total 34 [2019-09-10 06:42:24,547 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:42:24,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:42:24,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:42:24,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1043, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 06:42:24,548 INFO L87 Difference]: Start difference. First operand 430091 states and 520986 transitions. Second operand 12 states. [2019-09-10 06:42:25,626 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-09-10 06:42:26,052 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-09-10 06:42:28,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:28,816 INFO L93 Difference]: Finished difference Result 486604 states and 588824 transitions. [2019-09-10 06:42:28,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 06:42:28,817 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 112 [2019-09-10 06:42:28,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:29,473 INFO L225 Difference]: With dead ends: 486604 [2019-09-10 06:42:29,474 INFO L226 Difference]: Without dead ends: 486604 [2019-09-10 06:42:29,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 206 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=187, Invalid=1975, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 06:42:29,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486604 states. [2019-09-10 06:42:40,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486604 to 437233. [2019-09-10 06:42:40,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437233 states. [2019-09-10 06:42:42,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437233 states to 437233 states and 529486 transitions. [2019-09-10 06:42:42,272 INFO L78 Accepts]: Start accepts. Automaton has 437233 states and 529486 transitions. Word has length 112 [2019-09-10 06:42:42,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:42:42,272 INFO L475 AbstractCegarLoop]: Abstraction has 437233 states and 529486 transitions. [2019-09-10 06:42:42,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:42:42,273 INFO L276 IsEmpty]: Start isEmpty. Operand 437233 states and 529486 transitions. [2019-09-10 06:42:42,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 06:42:42,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:42:42,277 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:42:42,278 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:42:42,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:42,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1361145022, now seen corresponding path program 1 times [2019-09-10 06:42:42,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:42:42,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:42,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:42,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:42:42,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:42:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:42,615 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:42,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:42,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:42:42,616 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2019-09-10 06:42:42,616 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [71], [75], [78], [81], [84], [86], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [133], [136], [147], [150], [153], [156], [161], [164], [167], [171], [192], [195], [198], [201], [206], [208], [211], [214], [217], [220], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [259], [269], [273], [324], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [445], [458], [466], [469], [472], [475], [477], [490], [493], [511], [521], [573], [589], [610], [611], [615], [616], [617] [2019-09-10 06:42:42,617 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:42:42,618 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:42:42,629 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:42:42,707 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:42:42,708 INFO L272 AbstractInterpreter]: Visited 107 different actions 211 times. Merged at 38 different actions 91 times. Never widened. Performed 811 root evaluator evaluations with a maximum evaluation depth of 5. Performed 811 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 13 fixpoints after 5 different actions. Largest state had 117 variables. [2019-09-10 06:42:42,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:42:42,708 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:42:42,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:42:42,708 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:42:42,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:42:42,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:42:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:42:42,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 06:42:42,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:42:42,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:42,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:42,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:43,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:43,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:43,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:43,313 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:43,313 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:42:43,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:43,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:43,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:43,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:43,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:42:43,655 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:42:43,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:42:43,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 11] total 31 [2019-09-10 06:42:43,659 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:42:43,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 06:42:43,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 06:42:43,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2019-09-10 06:42:43,661 INFO L87 Difference]: Start difference. First operand 437233 states and 529486 transitions. Second operand 25 states. [2019-09-10 06:42:49,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:42:49,002 INFO L93 Difference]: Finished difference Result 693552 states and 834867 transitions. [2019-09-10 06:42:49,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 06:42:49,003 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 112 [2019-09-10 06:42:49,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:42:50,772 INFO L225 Difference]: With dead ends: 693552 [2019-09-10 06:42:50,773 INFO L226 Difference]: Without dead ends: 693552 [2019-09-10 06:42:50,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 206 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=733, Invalid=2689, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 06:42:51,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693552 states. [2019-09-10 06:43:03,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693552 to 461700. [2019-09-10 06:43:03,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461700 states. [2019-09-10 06:43:05,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461700 states to 461700 states and 557985 transitions. [2019-09-10 06:43:05,030 INFO L78 Accepts]: Start accepts. Automaton has 461700 states and 557985 transitions. Word has length 112 [2019-09-10 06:43:05,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:43:05,030 INFO L475 AbstractCegarLoop]: Abstraction has 461700 states and 557985 transitions. [2019-09-10 06:43:05,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 06:43:05,031 INFO L276 IsEmpty]: Start isEmpty. Operand 461700 states and 557985 transitions. [2019-09-10 06:43:05,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 06:43:05,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:43:05,037 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:43:05,037 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:43:05,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:43:05,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1994384747, now seen corresponding path program 1 times [2019-09-10 06:43:05,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:43:05,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:43:05,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:43:05,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:43:05,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:43:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:43:05,621 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:43:05,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:43:05,621 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:43:05,621 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2019-09-10 06:43:05,622 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [71], [75], [78], [81], [84], [86], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [133], [136], [147], [150], [153], [156], [159], [161], [164], [167], [171], [192], [195], [198], [201], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [259], [269], [273], [324], [326], [329], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [445], [458], [466], [469], [472], [475], [477], [511], [521], [573], [589], [610], [611], [615], [616], [617] [2019-09-10 06:43:05,625 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:43:05,625 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:43:05,639 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:43:05,716 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:43:05,716 INFO L272 AbstractInterpreter]: Visited 107 different actions 210 times. Merged at 39 different actions 91 times. Never widened. Performed 783 root evaluator evaluations with a maximum evaluation depth of 5. Performed 783 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 11 fixpoints after 5 different actions. Largest state had 117 variables. [2019-09-10 06:43:05,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:43:05,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:43:05,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:43:05,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:43:05,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:43:05,731 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:43:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:43:05,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 06:43:05,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:43:05,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:05,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:05,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,360 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:43:06,360 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:43:06,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:43:06,908 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:43:06,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:43:06,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 12] total 41 [2019-09-10 06:43:06,918 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:43:06,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 06:43:06,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 06:43:06,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1514, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 06:43:06,919 INFO L87 Difference]: Start difference. First operand 461700 states and 557985 transitions. Second operand 31 states. [2019-09-10 06:43:07,168 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-09-10 06:43:08,254 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 06:43:08,459 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-10 06:43:09,985 WARN L188 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 06:43:11,832 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-10 06:43:12,099 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-10 06:43:12,938 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-09-10 06:43:13,264 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-09-10 06:43:15,732 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 06:43:16,120 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-09-10 06:43:16,420 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 06:43:17,028 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 06:43:17,613 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 06:43:17,949 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 06:43:18,211 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-09-10 06:43:18,566 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-09-10 06:43:18,888 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 06:43:19,350 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 06:43:19,580 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-10 06:43:19,868 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-09-10 06:43:20,556 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-09-10 06:43:21,632 WARN L188 SmtUtils]: Spent 964.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2019-09-10 06:43:22,664 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 06:43:22,879 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-10 06:43:23,647 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-09-10 06:43:25,933 WARN L188 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2019-09-10 06:43:26,208 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 06:43:26,449 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 06:43:27,382 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-10 06:43:28,130 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 06:43:28,354 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 06:43:28,796 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2019-09-10 06:43:29,284 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 06:43:29,712 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 06:43:30,382 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-10 06:43:31,089 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-10 06:43:31,307 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 06:43:31,570 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 06:43:31,771 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 06:43:32,435 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 06:43:32,603 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 06:43:32,923 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2019-09-10 06:43:33,176 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2019-09-10 06:43:33,576 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 06:43:34,036 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-10 06:43:34,267 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-10 06:43:35,031 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 06:43:35,375 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 06:43:35,571 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 06:43:37,928 WARN L188 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-10 06:43:38,410 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2019-09-10 06:43:40,358 WARN L188 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 06:43:43,231 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 06:43:44,781 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-10 06:43:49,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:43:49,204 INFO L93 Difference]: Finished difference Result 1017320 states and 1230749 transitions. [2019-09-10 06:43:49,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-09-10 06:43:49,205 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 112 [2019-09-10 06:43:49,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:43:50,580 INFO L225 Difference]: With dead ends: 1017320 [2019-09-10 06:43:50,581 INFO L226 Difference]: Without dead ends: 1017320 [2019-09-10 06:43:50,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 203 SyntacticMatches, 2 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8213 ImplicationChecksByTransitivity, 31.2s TimeCoverageRelationStatistics Valid=4199, Invalid=22533, Unknown=0, NotChecked=0, Total=26732 [2019-09-10 06:43:51,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017320 states. [2019-09-10 06:44:05,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017320 to 440279. [2019-09-10 06:44:05,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440279 states. [2019-09-10 06:44:07,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440279 states to 440279 states and 531830 transitions. [2019-09-10 06:44:07,086 INFO L78 Accepts]: Start accepts. Automaton has 440279 states and 531830 transitions. Word has length 112 [2019-09-10 06:44:07,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:07,087 INFO L475 AbstractCegarLoop]: Abstraction has 440279 states and 531830 transitions. [2019-09-10 06:44:07,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 06:44:07,087 INFO L276 IsEmpty]: Start isEmpty. Operand 440279 states and 531830 transitions. [2019-09-10 06:44:07,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 06:44:07,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:07,095 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:44:07,095 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:07,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:07,095 INFO L82 PathProgramCache]: Analyzing trace with hash -3713276, now seen corresponding path program 1 times [2019-09-10 06:44:07,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:07,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:07,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:07,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:07,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:08,605 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:44:08,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:44:08,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 06:44:08,605 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:44:08,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:44:08,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:44:08,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:44:08,606 INFO L87 Difference]: Start difference. First operand 440279 states and 531830 transitions. Second operand 21 states. [2019-09-10 06:44:09,625 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-09-10 06:44:09,850 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-09-10 06:44:10,067 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-09-10 06:44:10,345 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-09-10 06:44:10,947 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-09-10 06:44:11,080 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-09-10 06:44:11,346 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-09-10 06:44:11,521 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-09-10 06:44:11,798 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 80 [2019-09-10 06:44:11,947 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-09-10 06:44:12,217 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 73 [2019-09-10 06:44:14,127 WARN L188 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 106 DAG size of output: 101 [2019-09-10 06:44:14,526 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 109 [2019-09-10 06:44:14,968 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 109 [2019-09-10 06:44:15,272 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 94 [2019-09-10 06:44:15,653 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 102 [2019-09-10 06:44:16,105 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 102 [2019-09-10 06:44:16,749 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 109 [2019-09-10 06:44:17,437 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 102 [2019-09-10 06:44:17,802 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 104 [2019-09-10 06:44:18,188 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 104 [2019-09-10 06:44:18,424 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-09-10 06:44:18,855 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 97 [2019-09-10 06:44:19,232 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 103 [2019-09-10 06:44:19,617 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 102 [2019-09-10 06:44:20,049 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 103 [2019-09-10 06:44:20,685 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 98 [2019-09-10 06:44:21,056 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2019-09-10 06:44:21,374 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-09-10 06:44:21,630 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2019-09-10 06:44:21,891 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-09-10 06:44:22,185 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-09-10 06:44:23,385 WARN L188 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-09-10 06:44:23,624 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2019-09-10 06:44:23,879 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-09-10 06:44:24,163 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2019-09-10 06:44:24,436 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2019-09-10 06:44:24,678 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 81 [2019-09-10 06:44:24,905 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 06:44:25,359 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-09-10 06:44:25,619 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-09-10 06:44:26,052 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 06:44:26,230 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-09-10 06:44:29,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:29,658 INFO L93 Difference]: Finished difference Result 986656 states and 1195857 transitions. [2019-09-10 06:44:29,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-10 06:44:29,658 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 113 [2019-09-10 06:44:29,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:30,903 INFO L225 Difference]: With dead ends: 986656 [2019-09-10 06:44:30,904 INFO L226 Difference]: Without dead ends: 986656 [2019-09-10 06:44:30,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1399 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=825, Invalid=4431, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 06:44:33,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986656 states. [2019-09-10 06:44:47,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986656 to 440317. [2019-09-10 06:44:47,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440317 states. [2019-09-10 06:44:47,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440317 states to 440317 states and 531870 transitions. [2019-09-10 06:44:47,785 INFO L78 Accepts]: Start accepts. Automaton has 440317 states and 531870 transitions. Word has length 113 [2019-09-10 06:44:47,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:44:47,785 INFO L475 AbstractCegarLoop]: Abstraction has 440317 states and 531870 transitions. [2019-09-10 06:44:47,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:44:47,785 INFO L276 IsEmpty]: Start isEmpty. Operand 440317 states and 531870 transitions. [2019-09-10 06:44:47,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 06:44:47,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:44:47,792 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:44:47,792 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:44:47,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:44:47,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1826730707, now seen corresponding path program 1 times [2019-09-10 06:44:47,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:44:47,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:47,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:44:47,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:44:47,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:44:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:44:48,158 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-09-10 06:44:48,349 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:44:48,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:44:48,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:44:48,349 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:44:48,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:44:48,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:44:48,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:44:48,350 INFO L87 Difference]: Start difference. First operand 440317 states and 531870 transitions. Second operand 12 states. [2019-09-10 06:44:48,811 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-09-10 06:44:48,983 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 06:44:49,166 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 06:44:49,355 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:44:49,563 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-09-10 06:44:50,679 WARN L188 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-09-10 06:44:50,854 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 06:44:51,024 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:44:52,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:44:52,699 INFO L93 Difference]: Finished difference Result 649042 states and 783160 transitions. [2019-09-10 06:44:52,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 06:44:52,699 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 113 [2019-09-10 06:44:52,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:44:54,711 INFO L225 Difference]: With dead ends: 649042 [2019-09-10 06:44:54,712 INFO L226 Difference]: Without dead ends: 649042 [2019-09-10 06:44:54,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:44:55,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649042 states. [2019-09-10 06:45:05,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649042 to 440286. [2019-09-10 06:45:05,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440286 states. [2019-09-10 06:45:07,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440286 states to 440286 states and 531836 transitions. [2019-09-10 06:45:07,888 INFO L78 Accepts]: Start accepts. Automaton has 440286 states and 531836 transitions. Word has length 113 [2019-09-10 06:45:07,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:07,889 INFO L475 AbstractCegarLoop]: Abstraction has 440286 states and 531836 transitions. [2019-09-10 06:45:07,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:45:07,889 INFO L276 IsEmpty]: Start isEmpty. Operand 440286 states and 531836 transitions. [2019-09-10 06:45:07,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 06:45:07,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:07,895 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:45:07,896 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:07,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:07,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1393001621, now seen corresponding path program 1 times [2019-09-10 06:45:07,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:07,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:07,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:07,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:07,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:08,152 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:45:08,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:45:08,152 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:45:08,153 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2019-09-10 06:45:08,153 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [71], [75], [78], [81], [84], [86], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [133], [136], [147], [150], [153], [156], [161], [164], [167], [171], [192], [195], [198], [201], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [259], [269], [273], [324], [326], [329], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [445], [458], [466], [469], [472], [475], [477], [490], [495], [511], [521], [573], [589], [610], [611], [615], [616], [617] [2019-09-10 06:45:08,155 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:45:08,156 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:45:08,167 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:45:08,323 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:45:08,324 INFO L272 AbstractInterpreter]: Visited 108 different actions 361 times. Merged at 41 different actions 230 times. Widened at 10 different actions 21 times. Performed 1236 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1236 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 22 fixpoints after 11 different actions. Largest state had 117 variables. [2019-09-10 06:45:08,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:08,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:45:08,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:45:08,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:45:08,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:08,348 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:45:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:08,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 06:45:08,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:45:08,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:08,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:08,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:08,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:08,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:08,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:09,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:09,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:09,185 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:45:09,185 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:45:09,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:09,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:09,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:09,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:09,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:09,567 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:45:09,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:45:09,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 12] total 33 [2019-09-10 06:45:09,571 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:45:09,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 06:45:09,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 06:45:09,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=936, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 06:45:09,572 INFO L87 Difference]: Start difference. First operand 440286 states and 531836 transitions. Second operand 26 states. [2019-09-10 06:45:14,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:14,092 INFO L93 Difference]: Finished difference Result 488193 states and 588118 transitions. [2019-09-10 06:45:14,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 06:45:14,092 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 113 [2019-09-10 06:45:14,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:14,730 INFO L225 Difference]: With dead ends: 488193 [2019-09-10 06:45:14,730 INFO L226 Difference]: Without dead ends: 488193 [2019-09-10 06:45:14,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 197 SyntacticMatches, 12 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=702, Invalid=2604, Unknown=0, NotChecked=0, Total=3306 [2019-09-10 06:45:15,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488193 states. [2019-09-10 06:45:19,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488193 to 425264. [2019-09-10 06:45:19,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425264 states. [2019-09-10 06:45:21,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425264 states to 425264 states and 514132 transitions. [2019-09-10 06:45:21,180 INFO L78 Accepts]: Start accepts. Automaton has 425264 states and 514132 transitions. Word has length 113 [2019-09-10 06:45:21,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:21,180 INFO L475 AbstractCegarLoop]: Abstraction has 425264 states and 514132 transitions. [2019-09-10 06:45:21,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 06:45:21,180 INFO L276 IsEmpty]: Start isEmpty. Operand 425264 states and 514132 transitions. [2019-09-10 06:45:21,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 06:45:21,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:21,186 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:45:21,187 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:21,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:21,187 INFO L82 PathProgramCache]: Analyzing trace with hash -714679401, now seen corresponding path program 1 times [2019-09-10 06:45:21,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:21,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:21,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:21,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:21,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:21,274 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:45:21,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:45:21,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:45:21,275 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:45:21,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:45:21,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:45:21,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:45:21,276 INFO L87 Difference]: Start difference. First operand 425264 states and 514132 transitions. Second operand 5 states. [2019-09-10 06:45:22,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:22,437 INFO L93 Difference]: Finished difference Result 421669 states and 509810 transitions. [2019-09-10 06:45:22,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 06:45:22,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2019-09-10 06:45:22,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:22,936 INFO L225 Difference]: With dead ends: 421669 [2019-09-10 06:45:22,937 INFO L226 Difference]: Without dead ends: 421669 [2019-09-10 06:45:22,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 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 06:45:23,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421669 states. [2019-09-10 06:45:32,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421669 to 418748. [2019-09-10 06:45:32,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418748 states. [2019-09-10 06:45:33,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418748 states to 418748 states and 506564 transitions. [2019-09-10 06:45:33,205 INFO L78 Accepts]: Start accepts. Automaton has 418748 states and 506564 transitions. Word has length 115 [2019-09-10 06:45:33,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:45:33,205 INFO L475 AbstractCegarLoop]: Abstraction has 418748 states and 506564 transitions. [2019-09-10 06:45:33,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:45:33,206 INFO L276 IsEmpty]: Start isEmpty. Operand 418748 states and 506564 transitions. [2019-09-10 06:45:33,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 06:45:33,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:45:33,210 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:45:33,210 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:45:33,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:33,210 INFO L82 PathProgramCache]: Analyzing trace with hash 976093693, now seen corresponding path program 1 times [2019-09-10 06:45:33,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:45:33,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:33,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:33,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:45:33,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:45:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:33,478 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:45:33,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:45:33,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:45:33,479 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2019-09-10 06:45:33,479 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [71], [75], [78], [81], [84], [86], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [128], [131], [133], [136], [139], [142], [145], [147], [150], [153], [156], [159], [161], [164], [167], [171], [192], [195], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [324], [326], [329], [337], [340], [343], [346], [348], [350], [388], [390], [393], [396], [399], [401], [403], [445], [448], [451], [454], [456], [458], [610], [611], [615], [616], [617] [2019-09-10 06:45:33,482 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:45:33,482 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:45:33,496 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:45:33,659 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:45:33,659 INFO L272 AbstractInterpreter]: Visited 110 different actions 409 times. Merged at 40 different actions 272 times. Widened at 14 different actions 29 times. Performed 1296 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1296 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 20 fixpoints after 12 different actions. Largest state had 118 variables. [2019-09-10 06:45:33,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:45:33,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:45:33,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:45:33,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:45:33,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:45:33,680 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:45:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:45:33,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 06:45:33,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:45:33,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:34,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:34,239 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:45:34,239 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:45:35,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:35,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:35,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:35,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:35,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:35,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:35,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:35,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:35,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:35,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:35,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:35,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:35,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:35,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:35,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:35,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:35,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:35,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:35,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:35,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:35,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:35,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:35,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:35,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:35,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:35,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:35,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:35,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:35,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:35,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:35,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:35,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:35,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:35,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:37,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:45:37,863 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:45:37,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:45:37,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2019-09-10 06:45:37,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:45:37,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 06:45:37,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 06:45:37,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:45:37,875 INFO L87 Difference]: Start difference. First operand 418748 states and 506564 transitions. Second operand 20 states. [2019-09-10 06:45:38,635 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 06:45:39,001 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 06:45:39,762 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 06:45:40,017 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 06:45:40,600 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 06:45:40,955 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 06:45:41,450 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 06:45:41,748 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 06:45:41,994 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 06:45:42,943 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 06:45:43,502 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 06:45:44,422 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 06:45:47,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:45:47,152 INFO L93 Difference]: Finished difference Result 816126 states and 983239 transitions. [2019-09-10 06:45:47,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 06:45:47,152 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 115 [2019-09-10 06:45:47,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:45:48,439 INFO L225 Difference]: With dead ends: 816126 [2019-09-10 06:45:48,439 INFO L226 Difference]: Without dead ends: 816126 [2019-09-10 06:45:48,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 183 SyntacticMatches, 34 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=414, Invalid=1308, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 06:45:49,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816126 states. [2019-09-10 06:46:02,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816126 to 418977. [2019-09-10 06:46:02,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418977 states. [2019-09-10 06:46:04,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418977 states to 418977 states and 506816 transitions. [2019-09-10 06:46:04,517 INFO L78 Accepts]: Start accepts. Automaton has 418977 states and 506816 transitions. Word has length 115 [2019-09-10 06:46:04,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:04,518 INFO L475 AbstractCegarLoop]: Abstraction has 418977 states and 506816 transitions. [2019-09-10 06:46:04,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 06:46:04,518 INFO L276 IsEmpty]: Start isEmpty. Operand 418977 states and 506816 transitions. [2019-09-10 06:46:04,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 06:46:04,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:04,524 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:04,524 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:04,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:04,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1232357347, now seen corresponding path program 1 times [2019-09-10 06:46:04,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:04,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:04,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:04,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:04,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:04,922 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:04,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:46:04,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:46:04,923 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 117 with the following transitions: [2019-09-10 06:46:04,923 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [69], [71], [75], [78], [81], [84], [86], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [128], [133], [136], [139], [142], [145], [147], [150], [153], [156], [159], [161], [164], [167], [171], [192], [195], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [324], [326], [329], [337], [340], [343], [346], [348], [350], [388], [390], [393], [396], [399], [401], [403], [445], [448], [451], [454], [456], [458], [514], [519], [610], [611], [615], [616], [617] [2019-09-10 06:46:04,925 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:46:04,925 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:46:04,934 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:46:05,086 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:46:05,087 INFO L272 AbstractInterpreter]: Visited 111 different actions 403 times. Merged at 40 different actions 265 times. Widened at 13 different actions 37 times. Performed 1316 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1316 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 20 fixpoints after 9 different actions. Largest state had 118 variables. [2019-09-10 06:46:05,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:05,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:46:05,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:46:05,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:46:05,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:05,105 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:46:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:05,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-10 06:46:05,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:46:05,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:05,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:05,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:05,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:06,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:06,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:06,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:08,291 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-09-10 06:46:08,414 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:08,414 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:46:08,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:08,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:08,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:08,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:08,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:08,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:08,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:08,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:08,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:08,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:08,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:09,296 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-09-10 06:46:09,536 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-09-10 06:46:09,738 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-09-10 06:46:09,961 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-09-10 06:46:09,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 06:46:10,317 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-09-10 06:46:10,767 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-09-10 06:46:10,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 06:46:11,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 06:46:11,989 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-09-10 06:46:11,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:11,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 06:46:11,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 06:46:13,135 WARN L188 SmtUtils]: Spent 682.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 88 [2019-09-10 06:46:14,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:14,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 06:46:14,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 06:46:15,662 WARN L188 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 140 [2019-09-10 06:46:16,316 WARN L188 SmtUtils]: Spent 404.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2019-09-10 06:46:16,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-10 06:46:16,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:46:17,058 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:17,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:46:17,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22, 23] total 57 [2019-09-10 06:46:17,065 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:46:17,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-10 06:46:17,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-10 06:46:17,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=2916, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 06:46:17,066 INFO L87 Difference]: Start difference. First operand 418977 states and 506816 transitions. Second operand 36 states. [2019-09-10 06:46:17,756 WARN L188 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 101 [2019-09-10 06:46:19,597 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-10 06:46:19,901 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-10 06:46:20,307 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-10 06:46:20,527 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-10 06:46:20,860 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-10 06:46:21,491 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-10 06:46:21,941 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-10 06:46:22,318 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-09-10 06:46:22,746 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2019-09-10 06:46:23,315 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-09-10 06:46:23,994 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-09-10 06:46:24,746 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2019-09-10 06:46:25,166 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2019-09-10 06:46:26,114 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2019-09-10 06:46:26,518 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2019-09-10 06:46:26,981 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 61 [2019-09-10 06:46:27,843 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 60 [2019-09-10 06:46:28,349 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2019-09-10 06:46:28,924 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 63 [2019-09-10 06:46:29,403 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 66 [2019-09-10 06:46:30,330 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 63 [2019-09-10 06:46:30,875 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 63 [2019-09-10 06:46:31,193 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 69 [2019-09-10 06:46:31,528 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 67 [2019-09-10 06:46:32,170 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 66 [2019-09-10 06:46:32,550 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 67 [2019-09-10 06:46:32,917 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2019-09-10 06:46:33,484 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 70 [2019-09-10 06:46:34,534 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 76 [2019-09-10 06:46:35,180 WARN L188 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 80 [2019-09-10 06:46:35,979 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 66 [2019-09-10 06:46:37,260 WARN L188 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 90 [2019-09-10 06:46:37,746 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 66 [2019-09-10 06:46:38,432 WARN L188 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 94 [2019-09-10 06:46:39,069 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 70 [2019-09-10 06:46:41,228 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2019-09-10 06:46:42,374 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 66 [2019-09-10 06:46:43,307 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2019-09-10 06:46:43,860 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-10 06:46:44,548 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2019-09-10 06:46:45,455 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2019-09-10 06:46:46,085 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 95 [2019-09-10 06:46:46,533 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 06:46:47,325 WARN L188 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 99 [2019-09-10 06:46:47,620 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 06:46:48,485 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 66 [2019-09-10 06:46:48,936 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 92 [2019-09-10 06:46:49,621 WARN L188 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 103 [2019-09-10 06:46:50,299 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2019-09-10 06:46:50,803 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 70 [2019-09-10 06:46:51,418 WARN L188 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 96 [2019-09-10 06:46:52,234 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 06:46:52,887 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 64 [2019-09-10 06:46:53,777 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 56 [2019-09-10 06:46:54,532 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-10 06:46:55,598 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 64 [2019-09-10 06:46:56,116 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-10 06:46:56,492 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 56 [2019-09-10 06:46:56,723 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 06:46:57,542 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 61 [2019-09-10 06:46:58,148 WARN L188 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 100 [2019-09-10 06:46:58,652 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2019-09-10 06:46:59,294 WARN L188 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 93 [2019-09-10 06:46:59,856 WARN L188 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 96 [2019-09-10 06:47:00,516 WARN L188 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 95 [2019-09-10 06:47:01,643 WARN L188 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 89 [2019-09-10 06:47:02,090 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 88 [2019-09-10 06:47:02,428 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 67 [2019-09-10 06:47:03,097 WARN L188 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 91 [2019-09-10 06:47:03,504 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-10 06:47:04,308 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-09-10 06:47:04,662 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 63 [2019-09-10 06:47:05,124 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 70 [2019-09-10 06:47:05,455 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 60 [2019-09-10 06:47:05,954 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 92 [2019-09-10 06:47:06,612 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-09-10 06:47:06,891 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-09-10 06:47:07,177 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-10 06:47:07,499 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 66 [2019-09-10 06:47:07,928 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 64 [2019-09-10 06:47:08,326 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 60 [2019-09-10 06:47:08,630 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-09-10 06:47:08,876 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-10 06:47:09,164 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-09-10 06:47:09,586 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 06:47:10,060 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-09-10 06:47:10,374 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 58 [2019-09-10 06:47:10,677 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-09-10 06:47:10,988 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-10 06:47:11,485 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 57 [2019-09-10 06:47:12,050 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-10 06:47:12,620 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 67 [2019-09-10 06:47:13,075 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-10 06:47:13,430 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 55 [2019-09-10 06:47:13,977 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-09-10 06:47:14,304 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 65 [2019-09-10 06:47:15,144 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 61 [2019-09-10 06:47:15,552 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 62 [2019-09-10 06:47:16,192 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 57 [2019-09-10 06:47:16,653 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 58 [2019-09-10 06:47:16,971 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-09-10 06:47:17,272 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2019-09-10 06:47:17,532 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2019-09-10 06:47:17,941 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 59 [2019-09-10 06:47:18,289 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 60 [2019-09-10 06:47:18,567 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2019-09-10 06:47:18,937 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2019-09-10 06:47:19,514 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 57 [2019-09-10 06:47:20,106 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-09-10 06:47:20,522 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2019-09-10 06:47:20,797 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 61 [2019-09-10 06:47:21,266 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-09-10 06:47:23,914 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57