java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:58:45,613 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:58:45,615 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:58:45,628 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:58:45,628 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:58:45,629 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:58:45,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:58:45,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:58:45,634 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:58:45,635 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:58:45,636 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:58:45,638 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:58:45,638 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:58:45,639 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:58:45,640 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:58:45,641 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:58:45,642 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:58:45,643 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:58:45,645 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:58:45,647 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:58:45,649 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:58:45,650 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:58:45,652 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:58:45,653 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:58:45,655 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:58:45,655 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:58:45,656 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:58:45,657 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:58:45,657 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:58:45,658 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:58:45,659 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:58:45,659 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:58:45,660 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:58:45,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:58:45,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:58:45,662 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:58:45,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:58:45,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:58:45,664 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:58:45,665 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:58:45,665 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:58:45,666 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:58:45,688 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:58:45,688 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:58:45,689 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:58:45,689 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:58:45,690 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:58:45,690 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:58:45,691 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:58:45,691 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:58:45,691 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:58:45,691 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:58:45,694 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:58:45,694 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:58:45,694 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:58:45,695 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:58:45,695 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:58:45,695 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:58:45,695 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:58:45,695 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:58:45,696 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:58:45,696 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:58:45,696 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:58:45,697 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:58:45,697 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:58:45,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:58:45,697 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:58:45,698 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:58:45,698 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:58:45,698 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:58:45,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:58:45,698 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:58:45,754 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:58:45,767 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:58:45,770 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:58:45,772 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:58:45,773 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:58:45,773 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 06:58:45,836 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2a619a99/40acdcf135c241c1aad793633ab08173/FLAGb7f01509a [2019-09-10 06:58:46,431 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:58:46,432 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 06:58:46,450 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2a619a99/40acdcf135c241c1aad793633ab08173/FLAGb7f01509a [2019-09-10 06:58:46,607 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2a619a99/40acdcf135c241c1aad793633ab08173 [2019-09-10 06:58:46,616 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:58:46,617 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:58:46,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:58:46,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:58:46,622 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:58:46,624 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:58:46" (1/1) ... [2019-09-10 06:58:46,626 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45625c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:58:46, skipping insertion in model container [2019-09-10 06:58:46,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:58:46" (1/1) ... [2019-09-10 06:58:46,635 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:58:46,764 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:58:47,674 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:58:47,694 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:58:47,971 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:58:47,994 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:58:47,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:58:47 WrapperNode [2019-09-10 06:58:47,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:58:47,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:58:47,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:58:47,996 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:58:48,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:58:47" (1/1) ... [2019-09-10 06:58:48,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:58:47" (1/1) ... [2019-09-10 06:58:48,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:58:47" (1/1) ... [2019-09-10 06:58:48,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:58:47" (1/1) ... [2019-09-10 06:58:48,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:58:47" (1/1) ... [2019-09-10 06:58:48,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:58:47" (1/1) ... [2019-09-10 06:58:48,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:58:47" (1/1) ... [2019-09-10 06:58:48,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:58:48,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:58:48,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:58:48,207 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:58:48,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:58:47" (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:58:48,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:58:48,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:58:48,294 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:58:48,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:58:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:58:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:58:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:58:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:58:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:58:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:58:48,296 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:58:48,296 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:58:48,297 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:58:48,297 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:58:48,298 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:58:48,298 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:58:48,298 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:58:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:58:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:58:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:58:50,570 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:58:50,571 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:58:50,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:58:50 BoogieIcfgContainer [2019-09-10 06:58:50,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:58:50,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:58:50,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:58:50,577 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:58:50,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:58:46" (1/3) ... [2019-09-10 06:58:50,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a2e83e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:58:50, skipping insertion in model container [2019-09-10 06:58:50,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:58:47" (2/3) ... [2019-09-10 06:58:50,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a2e83e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:58:50, skipping insertion in model container [2019-09-10 06:58:50,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:58:50" (3/3) ... [2019-09-10 06:58:50,580 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 06:58:50,591 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:58:50,601 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-10 06:58:50,619 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-10 06:58:50,643 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:58:50,643 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:58:50,643 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:58:50,643 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:58:50,644 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:58:50,644 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:58:50,644 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:58:50,644 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:58:50,677 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states. [2019-09-10 06:58:50,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 06:58:50,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:50,705 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:58:50,708 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:50,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:50,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1231331232, now seen corresponding path program 1 times [2019-09-10 06:58:50,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:50,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:50,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:50,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:50,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:51,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:51,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:51,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:58:51,201 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:51,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:58:51,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:58:51,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:58:51,226 INFO L87 Difference]: Start difference. First operand 707 states. Second operand 3 states. [2019-09-10 06:58:51,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:51,378 INFO L93 Difference]: Finished difference Result 854 states and 1489 transitions. [2019-09-10 06:58:51,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:58:51,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-10 06:58:51,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:51,405 INFO L225 Difference]: With dead ends: 854 [2019-09-10 06:58:51,405 INFO L226 Difference]: Without dead ends: 846 [2019-09-10 06:58:51,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:58:51,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2019-09-10 06:58:51,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 844. [2019-09-10 06:58:51,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-09-10 06:58:51,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1154 transitions. [2019-09-10 06:58:51,505 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1154 transitions. Word has length 66 [2019-09-10 06:58:51,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:51,505 INFO L475 AbstractCegarLoop]: Abstraction has 844 states and 1154 transitions. [2019-09-10 06:58:51,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:58:51,506 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1154 transitions. [2019-09-10 06:58:51,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:58:51,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:51,514 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:58:51,514 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:51,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:51,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1406661015, now seen corresponding path program 1 times [2019-09-10 06:58:51,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:51,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:51,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:51,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:51,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:51,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:51,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:51,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:58:51,667 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:51,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:58:51,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:58:51,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:58:51,671 INFO L87 Difference]: Start difference. First operand 844 states and 1154 transitions. Second operand 3 states. [2019-09-10 06:58:51,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:51,792 INFO L93 Difference]: Finished difference Result 1106 states and 1533 transitions. [2019-09-10 06:58:51,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:58:51,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-10 06:58:51,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:51,801 INFO L225 Difference]: With dead ends: 1106 [2019-09-10 06:58:51,801 INFO L226 Difference]: Without dead ends: 1106 [2019-09-10 06:58:51,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:58:51,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-10 06:58:51,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1102. [2019-09-10 06:58:51,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1102 states. [2019-09-10 06:58:51,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1531 transitions. [2019-09-10 06:58:51,867 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1531 transitions. Word has length 67 [2019-09-10 06:58:51,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:51,867 INFO L475 AbstractCegarLoop]: Abstraction has 1102 states and 1531 transitions. [2019-09-10 06:58:51,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:58:51,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1531 transitions. [2019-09-10 06:58:51,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:58:51,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:51,880 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:58:51,881 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:51,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:51,882 INFO L82 PathProgramCache]: Analyzing trace with hash -260201894, now seen corresponding path program 1 times [2019-09-10 06:58:51,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:51,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:51,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:51,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:51,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:52,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:52,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:52,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:58:52,062 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:52,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:58:52,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:58:52,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:58:52,065 INFO L87 Difference]: Start difference. First operand 1102 states and 1531 transitions. Second operand 3 states. [2019-09-10 06:58:52,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:52,264 INFO L93 Difference]: Finished difference Result 1688 states and 2320 transitions. [2019-09-10 06:58:52,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:58:52,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-10 06:58:52,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:52,273 INFO L225 Difference]: With dead ends: 1688 [2019-09-10 06:58:52,274 INFO L226 Difference]: Without dead ends: 1688 [2019-09-10 06:58:52,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:58:52,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states. [2019-09-10 06:58:52,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1684. [2019-09-10 06:58:52,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1684 states. [2019-09-10 06:58:52,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2318 transitions. [2019-09-10 06:58:52,315 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2318 transitions. Word has length 67 [2019-09-10 06:58:52,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:52,316 INFO L475 AbstractCegarLoop]: Abstraction has 1684 states and 2318 transitions. [2019-09-10 06:58:52,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:58:52,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2318 transitions. [2019-09-10 06:58:52,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:58:52,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:52,320 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:58:52,320 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:52,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:52,321 INFO L82 PathProgramCache]: Analyzing trace with hash 2113210194, now seen corresponding path program 1 times [2019-09-10 06:58:52,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:52,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:52,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:52,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:52,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:52,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:52,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:52,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:58:52,470 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:52,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:58:52,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:58:52,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:58:52,471 INFO L87 Difference]: Start difference. First operand 1684 states and 2318 transitions. Second operand 6 states. [2019-09-10 06:58:53,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:53,102 INFO L93 Difference]: Finished difference Result 2962 states and 4188 transitions. [2019-09-10 06:58:53,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:58:53,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-09-10 06:58:53,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:53,117 INFO L225 Difference]: With dead ends: 2962 [2019-09-10 06:58:53,117 INFO L226 Difference]: Without dead ends: 2962 [2019-09-10 06:58:53,118 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:58:53,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2019-09-10 06:58:53,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 2958. [2019-09-10 06:58:53,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2958 states. [2019-09-10 06:58:53,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2958 states and 4186 transitions. [2019-09-10 06:58:53,187 INFO L78 Accepts]: Start accepts. Automaton has 2958 states and 4186 transitions. Word has length 67 [2019-09-10 06:58:53,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:53,188 INFO L475 AbstractCegarLoop]: Abstraction has 2958 states and 4186 transitions. [2019-09-10 06:58:53,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:58:53,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2958 states and 4186 transitions. [2019-09-10 06:58:53,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:58:53,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:53,192 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:58:53,193 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:53,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:53,193 INFO L82 PathProgramCache]: Analyzing trace with hash -115367663, now seen corresponding path program 1 times [2019-09-10 06:58:53,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:53,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:53,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:53,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:53,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:53,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:53,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:53,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:58:53,270 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:53,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:58:53,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:58:53,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:58:53,271 INFO L87 Difference]: Start difference. First operand 2958 states and 4186 transitions. Second operand 3 states. [2019-09-10 06:58:53,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:53,331 INFO L93 Difference]: Finished difference Result 4269 states and 6003 transitions. [2019-09-10 06:58:53,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:58:53,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-10 06:58:53,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:53,352 INFO L225 Difference]: With dead ends: 4269 [2019-09-10 06:58:53,352 INFO L226 Difference]: Without dead ends: 4269 [2019-09-10 06:58:53,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:58:53,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4269 states. [2019-09-10 06:58:53,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4269 to 4251. [2019-09-10 06:58:53,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4251 states. [2019-09-10 06:58:53,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4251 states to 4251 states and 5986 transitions. [2019-09-10 06:58:53,473 INFO L78 Accepts]: Start accepts. Automaton has 4251 states and 5986 transitions. Word has length 68 [2019-09-10 06:58:53,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:53,474 INFO L475 AbstractCegarLoop]: Abstraction has 4251 states and 5986 transitions. [2019-09-10 06:58:53,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:58:53,474 INFO L276 IsEmpty]: Start isEmpty. Operand 4251 states and 5986 transitions. [2019-09-10 06:58:53,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:58:53,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:53,481 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:53,481 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:53,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:53,482 INFO L82 PathProgramCache]: Analyzing trace with hash -781567947, now seen corresponding path program 1 times [2019-09-10 06:58:53,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:53,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:53,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:53,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:53,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:53,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:53,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:53,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:58:53,671 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:53,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:58:53,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:58:53,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:58:53,672 INFO L87 Difference]: Start difference. First operand 4251 states and 5986 transitions. Second operand 6 states. [2019-09-10 06:58:54,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:54,342 INFO L93 Difference]: Finished difference Result 8021 states and 11406 transitions. [2019-09-10 06:58:54,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:58:54,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-10 06:58:54,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:54,390 INFO L225 Difference]: With dead ends: 8021 [2019-09-10 06:58:54,390 INFO L226 Difference]: Without dead ends: 8021 [2019-09-10 06:58:54,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:58:54,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8021 states. [2019-09-10 06:58:54,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8021 to 7973. [2019-09-10 06:58:54,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7973 states. [2019-09-10 06:58:54,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7973 states to 7973 states and 11362 transitions. [2019-09-10 06:58:54,586 INFO L78 Accepts]: Start accepts. Automaton has 7973 states and 11362 transitions. Word has length 69 [2019-09-10 06:58:54,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:54,586 INFO L475 AbstractCegarLoop]: Abstraction has 7973 states and 11362 transitions. [2019-09-10 06:58:54,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:58:54,586 INFO L276 IsEmpty]: Start isEmpty. Operand 7973 states and 11362 transitions. [2019-09-10 06:58:54,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:58:54,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:54,593 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:54,594 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:54,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:54,594 INFO L82 PathProgramCache]: Analyzing trace with hash 471461991, now seen corresponding path program 1 times [2019-09-10 06:58:54,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:54,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:54,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:54,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:54,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:54,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:54,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:54,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:58:54,721 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:54,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:58:54,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:58:54,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:58:54,722 INFO L87 Difference]: Start difference. First operand 7973 states and 11362 transitions. Second operand 5 states. [2019-09-10 06:58:55,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:55,466 INFO L93 Difference]: Finished difference Result 11211 states and 15918 transitions. [2019-09-10 06:58:55,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:58:55,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-09-10 06:58:55,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:55,511 INFO L225 Difference]: With dead ends: 11211 [2019-09-10 06:58:55,511 INFO L226 Difference]: Without dead ends: 11211 [2019-09-10 06:58:55,512 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:58:55,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11211 states. [2019-09-10 06:58:55,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11211 to 7973. [2019-09-10 06:58:55,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7973 states. [2019-09-10 06:58:55,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7973 states to 7973 states and 11311 transitions. [2019-09-10 06:58:55,688 INFO L78 Accepts]: Start accepts. Automaton has 7973 states and 11311 transitions. Word has length 70 [2019-09-10 06:58:55,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:55,689 INFO L475 AbstractCegarLoop]: Abstraction has 7973 states and 11311 transitions. [2019-09-10 06:58:55,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:58:55,689 INFO L276 IsEmpty]: Start isEmpty. Operand 7973 states and 11311 transitions. [2019-09-10 06:58:55,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:58:55,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:55,696 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:55,696 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:55,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:55,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1788309191, now seen corresponding path program 1 times [2019-09-10 06:58:55,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:55,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:55,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:55,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:55,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:55,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:55,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:55,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:58:55,837 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:55,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:58:55,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:58:55,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:58:55,838 INFO L87 Difference]: Start difference. First operand 7973 states and 11311 transitions. Second operand 7 states. [2019-09-10 06:58:56,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:56,963 INFO L93 Difference]: Finished difference Result 29243 states and 42435 transitions. [2019-09-10 06:58:56,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:58:56,963 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-09-10 06:58:56,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:57,034 INFO L225 Difference]: With dead ends: 29243 [2019-09-10 06:58:57,035 INFO L226 Difference]: Without dead ends: 29243 [2019-09-10 06:58:57,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:58:57,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29243 states. [2019-09-10 06:58:57,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29243 to 7997. [2019-09-10 06:58:57,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7997 states. [2019-09-10 06:58:57,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7997 states to 7997 states and 11343 transitions. [2019-09-10 06:58:57,384 INFO L78 Accepts]: Start accepts. Automaton has 7997 states and 11343 transitions. Word has length 70 [2019-09-10 06:58:57,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:57,385 INFO L475 AbstractCegarLoop]: Abstraction has 7997 states and 11343 transitions. [2019-09-10 06:58:57,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:58:57,385 INFO L276 IsEmpty]: Start isEmpty. Operand 7997 states and 11343 transitions. [2019-09-10 06:58:57,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:58:57,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:57,391 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:58:57,392 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:57,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:57,393 INFO L82 PathProgramCache]: Analyzing trace with hash 503690724, now seen corresponding path program 1 times [2019-09-10 06:58:57,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:57,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:57,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:57,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:57,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:57,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:57,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:57,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:58:57,500 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:57,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:58:57,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:58:57,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:58:57,501 INFO L87 Difference]: Start difference. First operand 7997 states and 11343 transitions. Second operand 7 states. [2019-09-10 06:58:58,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:58,495 INFO L93 Difference]: Finished difference Result 25312 states and 36307 transitions. [2019-09-10 06:58:58,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:58:58,496 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-09-10 06:58:58,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:58,538 INFO L225 Difference]: With dead ends: 25312 [2019-09-10 06:58:58,538 INFO L226 Difference]: Without dead ends: 25312 [2019-09-10 06:58:58,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:58:58,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25312 states. [2019-09-10 06:58:58,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25312 to 8025. [2019-09-10 06:58:58,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8025 states. [2019-09-10 06:58:58,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8025 states to 8025 states and 11379 transitions. [2019-09-10 06:58:58,844 INFO L78 Accepts]: Start accepts. Automaton has 8025 states and 11379 transitions. Word has length 71 [2019-09-10 06:58:58,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:58,844 INFO L475 AbstractCegarLoop]: Abstraction has 8025 states and 11379 transitions. [2019-09-10 06:58:58,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:58:58,844 INFO L276 IsEmpty]: Start isEmpty. Operand 8025 states and 11379 transitions. [2019-09-10 06:58:58,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:58:58,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:58,851 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:58:58,851 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:58,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:58,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1290630934, now seen corresponding path program 1 times [2019-09-10 06:58:58,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:58,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:58,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:58,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:58,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:58,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:58,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:58,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:58:58,949 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:58,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:58:58,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:58:58,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:58:58,950 INFO L87 Difference]: Start difference. First operand 8025 states and 11379 transitions. Second operand 6 states. [2019-09-10 06:58:59,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:59,510 INFO L93 Difference]: Finished difference Result 16458 states and 23305 transitions. [2019-09-10 06:58:59,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:58:59,510 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-09-10 06:58:59,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:59,537 INFO L225 Difference]: With dead ends: 16458 [2019-09-10 06:58:59,537 INFO L226 Difference]: Without dead ends: 16458 [2019-09-10 06:58:59,537 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:58:59,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16458 states. [2019-09-10 06:58:59,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16458 to 16350. [2019-09-10 06:58:59,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16350 states. [2019-09-10 06:58:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16350 states to 16350 states and 23201 transitions. [2019-09-10 06:58:59,742 INFO L78 Accepts]: Start accepts. Automaton has 16350 states and 23201 transitions. Word has length 71 [2019-09-10 06:58:59,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:59,743 INFO L475 AbstractCegarLoop]: Abstraction has 16350 states and 23201 transitions. [2019-09-10 06:58:59,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:58:59,743 INFO L276 IsEmpty]: Start isEmpty. Operand 16350 states and 23201 transitions. [2019-09-10 06:58:59,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:58:59,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:59,752 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:59,752 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:59,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:59,752 INFO L82 PathProgramCache]: Analyzing trace with hash 878384200, now seen corresponding path program 1 times [2019-09-10 06:58:59,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:59,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:59,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:59,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:59,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:59,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:59,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:59,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:58:59,895 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:59,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:58:59,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:58:59,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:58:59,897 INFO L87 Difference]: Start difference. First operand 16350 states and 23201 transitions. Second operand 7 states. [2019-09-10 06:59:01,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:01,131 INFO L93 Difference]: Finished difference Result 68962 states and 99075 transitions. [2019-09-10 06:59:01,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:59:01,132 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-09-10 06:59:01,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:01,246 INFO L225 Difference]: With dead ends: 68962 [2019-09-10 06:59:01,247 INFO L226 Difference]: Without dead ends: 68962 [2019-09-10 06:59:01,248 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:59:01,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68962 states. [2019-09-10 06:59:02,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68962 to 16447. [2019-09-10 06:59:02,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16447 states. [2019-09-10 06:59:02,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16447 states to 16447 states and 23330 transitions. [2019-09-10 06:59:02,633 INFO L78 Accepts]: Start accepts. Automaton has 16447 states and 23330 transitions. Word has length 72 [2019-09-10 06:59:02,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:02,633 INFO L475 AbstractCegarLoop]: Abstraction has 16447 states and 23330 transitions. [2019-09-10 06:59:02,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:59:02,633 INFO L276 IsEmpty]: Start isEmpty. Operand 16447 states and 23330 transitions. [2019-09-10 06:59:02,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:59:02,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:02,641 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:02,642 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:02,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:02,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1445608023, now seen corresponding path program 1 times [2019-09-10 06:59:02,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:02,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:02,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:02,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:02,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:02,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:02,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:02,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:59:02,842 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:02,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:59:02,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:59:02,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:59:02,845 INFO L87 Difference]: Start difference. First operand 16447 states and 23330 transitions. Second operand 9 states. [2019-09-10 06:59:05,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:05,003 INFO L93 Difference]: Finished difference Result 67139 states and 97485 transitions. [2019-09-10 06:59:05,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:59:05,004 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-09-10 06:59:05,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:05,110 INFO L225 Difference]: With dead ends: 67139 [2019-09-10 06:59:05,110 INFO L226 Difference]: Without dead ends: 67139 [2019-09-10 06:59:05,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:59:05,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67139 states. [2019-09-10 06:59:05,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67139 to 16443. [2019-09-10 06:59:05,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16443 states. [2019-09-10 06:59:05,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16443 states to 16443 states and 23322 transitions. [2019-09-10 06:59:05,822 INFO L78 Accepts]: Start accepts. Automaton has 16443 states and 23322 transitions. Word has length 73 [2019-09-10 06:59:05,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:05,822 INFO L475 AbstractCegarLoop]: Abstraction has 16443 states and 23322 transitions. [2019-09-10 06:59:05,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:59:05,822 INFO L276 IsEmpty]: Start isEmpty. Operand 16443 states and 23322 transitions. [2019-09-10 06:59:05,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:59:05,829 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:05,830 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:05,830 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:05,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:05,830 INFO L82 PathProgramCache]: Analyzing trace with hash 185692076, now seen corresponding path program 1 times [2019-09-10 06:59:05,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:05,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:05,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:05,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:05,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:06,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:06,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:06,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:59:06,063 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:06,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:59:06,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:59:06,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:59:06,064 INFO L87 Difference]: Start difference. First operand 16443 states and 23322 transitions. Second operand 10 states. [2019-09-10 06:59:10,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:10,302 INFO L93 Difference]: Finished difference Result 83789 states and 121127 transitions. [2019-09-10 06:59:10,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 06:59:10,303 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2019-09-10 06:59:10,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:10,400 INFO L225 Difference]: With dead ends: 83789 [2019-09-10 06:59:10,400 INFO L226 Difference]: Without dead ends: 83789 [2019-09-10 06:59:10,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=374, Invalid=1108, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 06:59:10,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83789 states. [2019-09-10 06:59:10,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83789 to 16443. [2019-09-10 06:59:10,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16443 states. [2019-09-10 06:59:10,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16443 states to 16443 states and 23320 transitions. [2019-09-10 06:59:10,951 INFO L78 Accepts]: Start accepts. Automaton has 16443 states and 23320 transitions. Word has length 73 [2019-09-10 06:59:10,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:10,951 INFO L475 AbstractCegarLoop]: Abstraction has 16443 states and 23320 transitions. [2019-09-10 06:59:10,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:59:10,951 INFO L276 IsEmpty]: Start isEmpty. Operand 16443 states and 23320 transitions. [2019-09-10 06:59:10,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:59:10,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:10,957 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:59:10,957 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:10,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:10,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1531312438, now seen corresponding path program 1 times [2019-09-10 06:59:10,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:10,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:10,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:10,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:10,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:11,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:11,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:11,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:59:11,510 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:11,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:59:11,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:59:11,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:59:11,511 INFO L87 Difference]: Start difference. First operand 16443 states and 23320 transitions. Second operand 12 states. [2019-09-10 06:59:14,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:14,091 INFO L93 Difference]: Finished difference Result 89686 states and 130116 transitions. [2019-09-10 06:59:14,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:59:14,091 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2019-09-10 06:59:14,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:14,238 INFO L225 Difference]: With dead ends: 89686 [2019-09-10 06:59:14,238 INFO L226 Difference]: Without dead ends: 89686 [2019-09-10 06:59:14,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=204, Invalid=666, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:59:14,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89686 states. [2019-09-10 06:59:14,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89686 to 16411. [2019-09-10 06:59:14,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16411 states. [2019-09-10 06:59:14,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16411 states to 16411 states and 23278 transitions. [2019-09-10 06:59:14,778 INFO L78 Accepts]: Start accepts. Automaton has 16411 states and 23278 transitions. Word has length 74 [2019-09-10 06:59:14,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:14,779 INFO L475 AbstractCegarLoop]: Abstraction has 16411 states and 23278 transitions. [2019-09-10 06:59:14,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:59:14,779 INFO L276 IsEmpty]: Start isEmpty. Operand 16411 states and 23278 transitions. [2019-09-10 06:59:14,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:59:14,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:14,785 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:59:14,785 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:14,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:14,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1383262957, now seen corresponding path program 1 times [2019-09-10 06:59:14,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:14,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:14,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:14,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:14,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:14,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:14,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:14,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:59:14,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:14,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:59:14,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:59:14,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:59:14,940 INFO L87 Difference]: Start difference. First operand 16411 states and 23278 transitions. Second operand 9 states. [2019-09-10 06:59:15,089 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-09-10 06:59:16,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:16,927 INFO L93 Difference]: Finished difference Result 67110 states and 97449 transitions. [2019-09-10 06:59:16,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:59:16,928 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 74 [2019-09-10 06:59:16,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:16,994 INFO L225 Difference]: With dead ends: 67110 [2019-09-10 06:59:16,995 INFO L226 Difference]: Without dead ends: 67110 [2019-09-10 06:59:16,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:59:17,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67110 states. [2019-09-10 06:59:17,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67110 to 16383. [2019-09-10 06:59:17,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16383 states. [2019-09-10 06:59:17,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16383 states to 16383 states and 23234 transitions. [2019-09-10 06:59:17,395 INFO L78 Accepts]: Start accepts. Automaton has 16383 states and 23234 transitions. Word has length 74 [2019-09-10 06:59:17,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:17,395 INFO L475 AbstractCegarLoop]: Abstraction has 16383 states and 23234 transitions. [2019-09-10 06:59:17,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:59:17,395 INFO L276 IsEmpty]: Start isEmpty. Operand 16383 states and 23234 transitions. [2019-09-10 06:59:17,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:59:17,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:17,401 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:59:17,402 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:17,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:17,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1378132539, now seen corresponding path program 1 times [2019-09-10 06:59:17,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:17,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:17,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:17,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:17,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:17,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:17,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:17,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:59:17,509 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:17,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:59:17,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:59:17,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:59:17,510 INFO L87 Difference]: Start difference. First operand 16383 states and 23234 transitions. Second operand 7 states. [2019-09-10 06:59:18,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:18,772 INFO L93 Difference]: Finished difference Result 59217 states and 84820 transitions. [2019-09-10 06:59:18,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:59:18,773 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-10 06:59:18,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:18,840 INFO L225 Difference]: With dead ends: 59217 [2019-09-10 06:59:18,840 INFO L226 Difference]: Without dead ends: 59217 [2019-09-10 06:59:18,841 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:59:19,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59217 states. [2019-09-10 06:59:19,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59217 to 16471. [2019-09-10 06:59:19,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16471 states. [2019-09-10 06:59:19,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16471 states to 16471 states and 23355 transitions. [2019-09-10 06:59:19,274 INFO L78 Accepts]: Start accepts. Automaton has 16471 states and 23355 transitions. Word has length 74 [2019-09-10 06:59:19,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:19,274 INFO L475 AbstractCegarLoop]: Abstraction has 16471 states and 23355 transitions. [2019-09-10 06:59:19,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:59:19,274 INFO L276 IsEmpty]: Start isEmpty. Operand 16471 states and 23355 transitions. [2019-09-10 06:59:19,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:59:19,280 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:19,280 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:59:19,280 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:19,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:19,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1178441383, now seen corresponding path program 1 times [2019-09-10 06:59:19,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:19,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:19,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:19,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:19,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:19,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:19,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:19,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:59:19,664 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:19,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:59:19,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:59:19,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:59:19,666 INFO L87 Difference]: Start difference. First operand 16471 states and 23355 transitions. Second operand 12 states. [2019-09-10 06:59:21,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:21,825 INFO L93 Difference]: Finished difference Result 90130 states and 130624 transitions. [2019-09-10 06:59:21,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:59:21,826 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2019-09-10 06:59:21,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:21,924 INFO L225 Difference]: With dead ends: 90130 [2019-09-10 06:59:21,925 INFO L226 Difference]: Without dead ends: 90130 [2019-09-10 06:59:21,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:59:21,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90130 states. [2019-09-10 06:59:22,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90130 to 16247. [2019-09-10 06:59:22,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16247 states. [2019-09-10 06:59:22,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16247 states to 16247 states and 23075 transitions. [2019-09-10 06:59:22,542 INFO L78 Accepts]: Start accepts. Automaton has 16247 states and 23075 transitions. Word has length 74 [2019-09-10 06:59:22,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:22,542 INFO L475 AbstractCegarLoop]: Abstraction has 16247 states and 23075 transitions. [2019-09-10 06:59:22,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:59:22,542 INFO L276 IsEmpty]: Start isEmpty. Operand 16247 states and 23075 transitions. [2019-09-10 06:59:22,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:59:22,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:22,548 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:59:22,548 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:22,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:22,548 INFO L82 PathProgramCache]: Analyzing trace with hash -675118073, now seen corresponding path program 1 times [2019-09-10 06:59:22,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:22,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:22,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:22,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:22,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:22,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:22,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:22,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:59:22,646 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:22,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:59:22,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:59:22,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:59:22,647 INFO L87 Difference]: Start difference. First operand 16247 states and 23075 transitions. Second operand 7 states. [2019-09-10 06:59:23,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:23,844 INFO L93 Difference]: Finished difference Result 58949 states and 84500 transitions. [2019-09-10 06:59:23,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:59:23,849 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-09-10 06:59:23,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:23,922 INFO L225 Difference]: With dead ends: 58949 [2019-09-10 06:59:23,922 INFO L226 Difference]: Without dead ends: 58949 [2019-09-10 06:59:23,923 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:59:23,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58949 states. [2019-09-10 06:59:24,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58949 to 16290. [2019-09-10 06:59:24,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16290 states. [2019-09-10 06:59:24,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16290 states to 16290 states and 23136 transitions. [2019-09-10 06:59:24,304 INFO L78 Accepts]: Start accepts. Automaton has 16290 states and 23136 transitions. Word has length 75 [2019-09-10 06:59:24,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:24,304 INFO L475 AbstractCegarLoop]: Abstraction has 16290 states and 23136 transitions. [2019-09-10 06:59:24,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:59:24,305 INFO L276 IsEmpty]: Start isEmpty. Operand 16290 states and 23136 transitions. [2019-09-10 06:59:24,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:59:24,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:24,311 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:59:24,311 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:24,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:24,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1666989368, now seen corresponding path program 1 times [2019-09-10 06:59:24,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:24,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:24,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:24,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:24,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:24,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:24,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:24,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 06:59:24,734 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:24,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:59:24,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:59:24,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:59:24,735 INFO L87 Difference]: Start difference. First operand 16290 states and 23136 transitions. Second operand 13 states. [2019-09-10 06:59:25,422 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 06:59:25,606 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 06:59:25,787 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 06:59:26,007 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 06:59:26,251 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 06:59:26,573 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 06:59:26,979 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 06:59:27,951 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 06:59:28,491 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 06:59:28,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:28,858 INFO L93 Difference]: Finished difference Result 95896 states and 138310 transitions. [2019-09-10 06:59:28,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 06:59:28,859 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 75 [2019-09-10 06:59:28,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:28,967 INFO L225 Difference]: With dead ends: 95896 [2019-09-10 06:59:28,967 INFO L226 Difference]: Without dead ends: 95896 [2019-09-10 06:59:28,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=332, Invalid=1000, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 06:59:29,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95896 states. [2019-09-10 06:59:29,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95896 to 16258. [2019-09-10 06:59:29,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16258 states. [2019-09-10 06:59:29,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16258 states to 16258 states and 23092 transitions. [2019-09-10 06:59:29,412 INFO L78 Accepts]: Start accepts. Automaton has 16258 states and 23092 transitions. Word has length 75 [2019-09-10 06:59:29,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:29,412 INFO L475 AbstractCegarLoop]: Abstraction has 16258 states and 23092 transitions. [2019-09-10 06:59:29,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:59:29,413 INFO L276 IsEmpty]: Start isEmpty. Operand 16258 states and 23092 transitions. [2019-09-10 06:59:29,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:59:29,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:29,418 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:59:29,418 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:29,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:29,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1354273678, now seen corresponding path program 1 times [2019-09-10 06:59:29,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:29,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:29,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:29,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:29,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:29,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:29,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:59:29,521 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:29,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:59:29,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:59:29,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:59:29,523 INFO L87 Difference]: Start difference. First operand 16258 states and 23092 transitions. Second operand 7 states. [2019-09-10 06:59:30,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:30,668 INFO L93 Difference]: Finished difference Result 68579 states and 98617 transitions. [2019-09-10 06:59:30,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:59:30,669 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-09-10 06:59:30,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:30,737 INFO L225 Difference]: With dead ends: 68579 [2019-09-10 06:59:30,737 INFO L226 Difference]: Without dead ends: 68579 [2019-09-10 06:59:30,737 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:59:30,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68579 states. [2019-09-10 06:59:31,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68579 to 16288. [2019-09-10 06:59:31,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16288 states. [2019-09-10 06:59:31,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16288 states to 16288 states and 23132 transitions. [2019-09-10 06:59:31,246 INFO L78 Accepts]: Start accepts. Automaton has 16288 states and 23132 transitions. Word has length 75 [2019-09-10 06:59:31,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:31,247 INFO L475 AbstractCegarLoop]: Abstraction has 16288 states and 23132 transitions. [2019-09-10 06:59:31,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:59:31,247 INFO L276 IsEmpty]: Start isEmpty. Operand 16288 states and 23132 transitions. [2019-09-10 06:59:31,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:59:31,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:31,253 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:59:31,253 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:31,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:31,254 INFO L82 PathProgramCache]: Analyzing trace with hash 869290451, now seen corresponding path program 1 times [2019-09-10 06:59:31,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:31,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:31,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:31,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:31,256 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:31,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:31,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:31,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:59:31,453 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:31,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:59:31,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:59:31,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:59:31,455 INFO L87 Difference]: Start difference. First operand 16288 states and 23132 transitions. Second operand 10 states. [2019-09-10 06:59:33,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:33,542 INFO L93 Difference]: Finished difference Result 69563 states and 100353 transitions. [2019-09-10 06:59:33,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 06:59:33,542 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2019-09-10 06:59:33,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:33,611 INFO L225 Difference]: With dead ends: 69563 [2019-09-10 06:59:33,612 INFO L226 Difference]: Without dead ends: 69563 [2019-09-10 06:59:33,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:59:33,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69563 states. [2019-09-10 06:59:33,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69563 to 16102. [2019-09-10 06:59:33,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16102 states. [2019-09-10 06:59:33,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16102 states to 16102 states and 22891 transitions. [2019-09-10 06:59:33,987 INFO L78 Accepts]: Start accepts. Automaton has 16102 states and 22891 transitions. Word has length 75 [2019-09-10 06:59:33,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:33,987 INFO L475 AbstractCegarLoop]: Abstraction has 16102 states and 22891 transitions. [2019-09-10 06:59:33,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:59:33,988 INFO L276 IsEmpty]: Start isEmpty. Operand 16102 states and 22891 transitions. [2019-09-10 06:59:33,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:59:33,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:33,993 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:59:33,993 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:33,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:33,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1936163638, now seen corresponding path program 1 times [2019-09-10 06:59:33,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:33,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:33,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:33,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:33,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:34,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:34,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:34,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:59:34,221 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:34,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:59:34,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:59:34,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:59:34,223 INFO L87 Difference]: Start difference. First operand 16102 states and 22891 transitions. Second operand 10 states. [2019-09-10 06:59:37,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:37,949 INFO L93 Difference]: Finished difference Result 96750 states and 140221 transitions. [2019-09-10 06:59:37,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 06:59:37,951 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 76 [2019-09-10 06:59:37,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:38,047 INFO L225 Difference]: With dead ends: 96750 [2019-09-10 06:59:38,047 INFO L226 Difference]: Without dead ends: 96750 [2019-09-10 06:59:38,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=374, Invalid=1108, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 06:59:38,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96750 states. [2019-09-10 06:59:38,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96750 to 16102. [2019-09-10 06:59:38,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16102 states. [2019-09-10 06:59:38,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16102 states to 16102 states and 22889 transitions. [2019-09-10 06:59:38,563 INFO L78 Accepts]: Start accepts. Automaton has 16102 states and 22889 transitions. Word has length 76 [2019-09-10 06:59:38,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:38,564 INFO L475 AbstractCegarLoop]: Abstraction has 16102 states and 22889 transitions. [2019-09-10 06:59:38,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:59:38,564 INFO L276 IsEmpty]: Start isEmpty. Operand 16102 states and 22889 transitions. [2019-09-10 06:59:38,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:59:38,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:38,568 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:59:38,568 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:38,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:38,568 INFO L82 PathProgramCache]: Analyzing trace with hash -16696217, now seen corresponding path program 1 times [2019-09-10 06:59:38,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:38,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:38,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:38,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:38,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:38,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:38,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:38,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:59:38,628 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:38,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:59:38,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:59:38,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:59:38,629 INFO L87 Difference]: Start difference. First operand 16102 states and 22889 transitions. Second operand 3 states. [2019-09-10 06:59:38,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:38,697 INFO L93 Difference]: Finished difference Result 16106 states and 22653 transitions. [2019-09-10 06:59:38,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:59:38,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-10 06:59:38,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:38,716 INFO L225 Difference]: With dead ends: 16106 [2019-09-10 06:59:38,716 INFO L226 Difference]: Without dead ends: 16106 [2019-09-10 06:59:38,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:59:38,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16106 states. [2019-09-10 06:59:38,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16106 to 16102. [2019-09-10 06:59:38,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16102 states. [2019-09-10 06:59:38,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16102 states to 16102 states and 22651 transitions. [2019-09-10 06:59:38,903 INFO L78 Accepts]: Start accepts. Automaton has 16102 states and 22651 transitions. Word has length 76 [2019-09-10 06:59:38,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:38,904 INFO L475 AbstractCegarLoop]: Abstraction has 16102 states and 22651 transitions. [2019-09-10 06:59:38,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:59:38,904 INFO L276 IsEmpty]: Start isEmpty. Operand 16102 states and 22651 transitions. [2019-09-10 06:59:38,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:59:38,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:38,911 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:59:38,911 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:38,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:38,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1575765556, now seen corresponding path program 1 times [2019-09-10 06:59:38,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:38,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:38,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:38,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:38,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:38,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:38,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:38,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:59:38,963 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:38,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:59:38,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:59:38,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:59:38,965 INFO L87 Difference]: Start difference. First operand 16102 states and 22651 transitions. Second operand 3 states. [2019-09-10 06:59:39,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:39,121 INFO L93 Difference]: Finished difference Result 23321 states and 33139 transitions. [2019-09-10 06:59:39,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:59:39,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-10 06:59:39,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:39,143 INFO L225 Difference]: With dead ends: 23321 [2019-09-10 06:59:39,144 INFO L226 Difference]: Without dead ends: 23321 [2019-09-10 06:59:39,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:59:39,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23321 states. [2019-09-10 06:59:39,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23321 to 18457. [2019-09-10 06:59:39,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18457 states. [2019-09-10 06:59:39,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18457 states to 18457 states and 26157 transitions. [2019-09-10 06:59:39,298 INFO L78 Accepts]: Start accepts. Automaton has 18457 states and 26157 transitions. Word has length 76 [2019-09-10 06:59:39,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:39,299 INFO L475 AbstractCegarLoop]: Abstraction has 18457 states and 26157 transitions. [2019-09-10 06:59:39,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:59:39,299 INFO L276 IsEmpty]: Start isEmpty. Operand 18457 states and 26157 transitions. [2019-09-10 06:59:39,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:59:39,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:39,303 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:59:39,303 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:39,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:39,303 INFO L82 PathProgramCache]: Analyzing trace with hash 843711097, now seen corresponding path program 1 times [2019-09-10 06:59:39,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:39,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:39,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:39,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:39,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:39,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:39,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:39,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:59:39,845 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:39,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:59:39,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:59:39,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:59:39,846 INFO L87 Difference]: Start difference. First operand 18457 states and 26157 transitions. Second operand 12 states. [2019-09-10 06:59:40,490 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 06:59:40,703 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 06:59:40,932 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 06:59:41,162 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 06:59:41,364 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 06:59:41,721 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-10 06:59:42,098 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 06:59:42,696 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 06:59:43,018 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-10 06:59:43,212 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 06:59:43,468 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 06:59:43,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:43,679 INFO L93 Difference]: Finished difference Result 44617 states and 63429 transitions. [2019-09-10 06:59:43,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 06:59:43,679 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 76 [2019-09-10 06:59:43,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:43,719 INFO L225 Difference]: With dead ends: 44617 [2019-09-10 06:59:43,719 INFO L226 Difference]: Without dead ends: 44617 [2019-09-10 06:59:43,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=245, Invalid=685, Unknown=0, NotChecked=0, Total=930 [2019-09-10 06:59:43,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44617 states. [2019-09-10 06:59:43,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44617 to 18448. [2019-09-10 06:59:43,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18448 states. [2019-09-10 06:59:43,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18448 states to 18448 states and 26146 transitions. [2019-09-10 06:59:43,937 INFO L78 Accepts]: Start accepts. Automaton has 18448 states and 26146 transitions. Word has length 76 [2019-09-10 06:59:43,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:43,938 INFO L475 AbstractCegarLoop]: Abstraction has 18448 states and 26146 transitions. [2019-09-10 06:59:43,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:59:43,938 INFO L276 IsEmpty]: Start isEmpty. Operand 18448 states and 26146 transitions. [2019-09-10 06:59:43,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 06:59:43,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:43,942 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] [2019-09-10 06:59:43,942 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:43,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:43,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1246526496, now seen corresponding path program 1 times [2019-09-10 06:59:43,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:43,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:43,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:43,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:43,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:43,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:43,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:43,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:59:43,998 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:43,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:59:43,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:59:43,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:59:44,000 INFO L87 Difference]: Start difference. First operand 18448 states and 26146 transitions. Second operand 3 states. [2019-09-10 06:59:44,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:44,076 INFO L93 Difference]: Finished difference Result 18450 states and 25891 transitions. [2019-09-10 06:59:44,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:59:44,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-10 06:59:44,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:44,095 INFO L225 Difference]: With dead ends: 18450 [2019-09-10 06:59:44,096 INFO L226 Difference]: Without dead ends: 18450 [2019-09-10 06:59:44,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:59:44,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18450 states. [2019-09-10 06:59:44,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18450 to 18448. [2019-09-10 06:59:44,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18448 states. [2019-09-10 06:59:44,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18448 states to 18448 states and 25890 transitions. [2019-09-10 06:59:44,353 INFO L78 Accepts]: Start accepts. Automaton has 18448 states and 25890 transitions. Word has length 77 [2019-09-10 06:59:44,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:44,353 INFO L475 AbstractCegarLoop]: Abstraction has 18448 states and 25890 transitions. [2019-09-10 06:59:44,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:59:44,354 INFO L276 IsEmpty]: Start isEmpty. Operand 18448 states and 25890 transitions. [2019-09-10 06:59:44,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 06:59:44,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:44,361 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] [2019-09-10 06:59:44,361 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:44,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:44,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1512534225, now seen corresponding path program 1 times [2019-09-10 06:59:44,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:44,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:44,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:44,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:44,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:44,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:44,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:44,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:59:44,431 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:44,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:59:44,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:59:44,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:59:44,432 INFO L87 Difference]: Start difference. First operand 18448 states and 25890 transitions. Second operand 3 states. [2019-09-10 06:59:44,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:44,510 INFO L93 Difference]: Finished difference Result 18117 states and 25173 transitions. [2019-09-10 06:59:44,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:59:44,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-10 06:59:44,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:44,535 INFO L225 Difference]: With dead ends: 18117 [2019-09-10 06:59:44,535 INFO L226 Difference]: Without dead ends: 18117 [2019-09-10 06:59:44,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:59:44,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18117 states. [2019-09-10 06:59:44,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18117 to 18115. [2019-09-10 06:59:44,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18115 states. [2019-09-10 06:59:44,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18115 states to 18115 states and 25172 transitions. [2019-09-10 06:59:44,744 INFO L78 Accepts]: Start accepts. Automaton has 18115 states and 25172 transitions. Word has length 77 [2019-09-10 06:59:44,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:44,745 INFO L475 AbstractCegarLoop]: Abstraction has 18115 states and 25172 transitions. [2019-09-10 06:59:44,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:59:44,745 INFO L276 IsEmpty]: Start isEmpty. Operand 18115 states and 25172 transitions. [2019-09-10 06:59:44,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 06:59:44,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:44,751 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:44,752 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:44,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:44,752 INFO L82 PathProgramCache]: Analyzing trace with hash 54165991, now seen corresponding path program 1 times [2019-09-10 06:59:44,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:44,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:44,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:44,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:44,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:44,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:44,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:44,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:59:44,932 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:44,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:59:44,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:59:44,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:59:44,933 INFO L87 Difference]: Start difference. First operand 18115 states and 25172 transitions. Second operand 9 states. [2019-09-10 06:59:46,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:46,589 INFO L93 Difference]: Finished difference Result 44287 states and 62147 transitions. [2019-09-10 06:59:46,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:59:46,590 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-09-10 06:59:46,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:46,632 INFO L225 Difference]: With dead ends: 44287 [2019-09-10 06:59:46,632 INFO L226 Difference]: Without dead ends: 44287 [2019-09-10 06:59:46,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-10 06:59:46,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44287 states. [2019-09-10 06:59:46,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44287 to 18111. [2019-09-10 06:59:46,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18111 states. [2019-09-10 06:59:46,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18111 states to 18111 states and 25164 transitions. [2019-09-10 06:59:46,863 INFO L78 Accepts]: Start accepts. Automaton has 18111 states and 25164 transitions. Word has length 78 [2019-09-10 06:59:46,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:46,863 INFO L475 AbstractCegarLoop]: Abstraction has 18111 states and 25164 transitions. [2019-09-10 06:59:46,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:59:46,863 INFO L276 IsEmpty]: Start isEmpty. Operand 18111 states and 25164 transitions. [2019-09-10 06:59:46,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 06:59:46,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:46,867 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:46,868 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:46,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:46,868 INFO L82 PathProgramCache]: Analyzing trace with hash -246734376, now seen corresponding path program 1 times [2019-09-10 06:59:46,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:46,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:46,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:46,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:46,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:46,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:47,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:47,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:47,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:59:47,027 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:47,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:59:47,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:59:47,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:59:47,028 INFO L87 Difference]: Start difference. First operand 18111 states and 25164 transitions. Second operand 9 states. [2019-09-10 06:59:49,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:49,194 INFO L93 Difference]: Finished difference Result 49102 states and 68965 transitions. [2019-09-10 06:59:49,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:59:49,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-09-10 06:59:49,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:49,243 INFO L225 Difference]: With dead ends: 49102 [2019-09-10 06:59:49,244 INFO L226 Difference]: Without dead ends: 49102 [2019-09-10 06:59:49,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:59:49,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49102 states. [2019-09-10 06:59:49,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49102 to 18111. [2019-09-10 06:59:49,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18111 states. [2019-09-10 06:59:49,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18111 states to 18111 states and 25162 transitions. [2019-09-10 06:59:49,532 INFO L78 Accepts]: Start accepts. Automaton has 18111 states and 25162 transitions. Word has length 78 [2019-09-10 06:59:49,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:49,532 INFO L475 AbstractCegarLoop]: Abstraction has 18111 states and 25162 transitions. [2019-09-10 06:59:49,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:59:49,532 INFO L276 IsEmpty]: Start isEmpty. Operand 18111 states and 25162 transitions. [2019-09-10 06:59:49,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 06:59:49,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:49,536 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:49,536 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:49,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:49,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1310156377, now seen corresponding path program 1 times [2019-09-10 06:59:49,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:49,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:49,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:49,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:49,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:49,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:49,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:49,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:59:49,593 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:49,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:59:49,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:59:49,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:59:49,594 INFO L87 Difference]: Start difference. First operand 18111 states and 25162 transitions. Second operand 3 states. [2019-09-10 06:59:49,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:49,739 INFO L93 Difference]: Finished difference Result 26991 states and 37727 transitions. [2019-09-10 06:59:49,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:59:49,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-10 06:59:49,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:49,774 INFO L225 Difference]: With dead ends: 26991 [2019-09-10 06:59:49,774 INFO L226 Difference]: Without dead ends: 26991 [2019-09-10 06:59:49,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:59:49,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26991 states. [2019-09-10 06:59:49,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26991 to 17813. [2019-09-10 06:59:49,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17813 states. [2019-09-10 06:59:49,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17813 states to 17813 states and 24735 transitions. [2019-09-10 06:59:49,945 INFO L78 Accepts]: Start accepts. Automaton has 17813 states and 24735 transitions. Word has length 78 [2019-09-10 06:59:49,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:49,945 INFO L475 AbstractCegarLoop]: Abstraction has 17813 states and 24735 transitions. [2019-09-10 06:59:49,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:59:49,945 INFO L276 IsEmpty]: Start isEmpty. Operand 17813 states and 24735 transitions. [2019-09-10 06:59:49,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 06:59:49,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:49,950 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:49,950 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:49,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:49,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1823471132, now seen corresponding path program 1 times [2019-09-10 06:59:49,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:49,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:49,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:49,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:49,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:50,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:50,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:50,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:59:50,006 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:50,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:59:50,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:59:50,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:59:50,007 INFO L87 Difference]: Start difference. First operand 17813 states and 24735 transitions. Second operand 3 states. [2019-09-10 06:59:50,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:50,125 INFO L93 Difference]: Finished difference Result 26634 states and 37206 transitions. [2019-09-10 06:59:50,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:59:50,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-10 06:59:50,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:50,158 INFO L225 Difference]: With dead ends: 26634 [2019-09-10 06:59:50,158 INFO L226 Difference]: Without dead ends: 26634 [2019-09-10 06:59:50,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:59:50,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26634 states. [2019-09-10 06:59:50,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26634 to 17458. [2019-09-10 06:59:50,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17458 states. [2019-09-10 06:59:50,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17458 states to 17458 states and 24251 transitions. [2019-09-10 06:59:50,370 INFO L78 Accepts]: Start accepts. Automaton has 17458 states and 24251 transitions. Word has length 78 [2019-09-10 06:59:50,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:50,370 INFO L475 AbstractCegarLoop]: Abstraction has 17458 states and 24251 transitions. [2019-09-10 06:59:50,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:59:50,370 INFO L276 IsEmpty]: Start isEmpty. Operand 17458 states and 24251 transitions. [2019-09-10 06:59:50,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 06:59:50,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:50,373 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:50,374 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:50,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:50,374 INFO L82 PathProgramCache]: Analyzing trace with hash 942311866, now seen corresponding path program 1 times [2019-09-10 06:59:50,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:50,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:50,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:50,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:50,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:50,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:50,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:50,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:59:50,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:50,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:59:50,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:59:50,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:59:50,512 INFO L87 Difference]: Start difference. First operand 17458 states and 24251 transitions. Second operand 9 states. [2019-09-10 06:59:51,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:51,661 INFO L93 Difference]: Finished difference Result 32104 states and 44841 transitions. [2019-09-10 06:59:51,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 06:59:51,662 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2019-09-10 06:59:51,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:51,690 INFO L225 Difference]: With dead ends: 32104 [2019-09-10 06:59:51,690 INFO L226 Difference]: Without dead ends: 32104 [2019-09-10 06:59:51,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:59:51,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32104 states. [2019-09-10 06:59:51,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32104 to 17435. [2019-09-10 06:59:51,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17435 states. [2019-09-10 06:59:51,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17435 states to 17435 states and 24221 transitions. [2019-09-10 06:59:51,872 INFO L78 Accepts]: Start accepts. Automaton has 17435 states and 24221 transitions. Word has length 79 [2019-09-10 06:59:51,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:51,872 INFO L475 AbstractCegarLoop]: Abstraction has 17435 states and 24221 transitions. [2019-09-10 06:59:51,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:59:51,872 INFO L276 IsEmpty]: Start isEmpty. Operand 17435 states and 24221 transitions. [2019-09-10 06:59:51,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 06:59:51,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:51,876 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:51,876 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:51,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:51,876 INFO L82 PathProgramCache]: Analyzing trace with hash -399904747, now seen corresponding path program 1 times [2019-09-10 06:59:51,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:51,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:51,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:51,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:51,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:51,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:51,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:51,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:59:51,936 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:51,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:59:51,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:59:51,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:59:51,942 INFO L87 Difference]: Start difference. First operand 17435 states and 24221 transitions. Second operand 3 states. [2019-09-10 06:59:52,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:52,026 INFO L93 Difference]: Finished difference Result 17403 states and 23848 transitions. [2019-09-10 06:59:52,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:59:52,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-10 06:59:52,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:52,046 INFO L225 Difference]: With dead ends: 17403 [2019-09-10 06:59:52,047 INFO L226 Difference]: Without dead ends: 17403 [2019-09-10 06:59:52,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:59:52,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17403 states. [2019-09-10 06:59:52,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17403 to 14671. [2019-09-10 06:59:52,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14671 states. [2019-09-10 06:59:52,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14671 states to 14671 states and 20042 transitions. [2019-09-10 06:59:52,178 INFO L78 Accepts]: Start accepts. Automaton has 14671 states and 20042 transitions. Word has length 79 [2019-09-10 06:59:52,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:52,178 INFO L475 AbstractCegarLoop]: Abstraction has 14671 states and 20042 transitions. [2019-09-10 06:59:52,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:59:52,179 INFO L276 IsEmpty]: Start isEmpty. Operand 14671 states and 20042 transitions. [2019-09-10 06:59:52,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 06:59:52,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:52,184 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:52,184 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:52,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:52,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1296925749, now seen corresponding path program 1 times [2019-09-10 06:59:52,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:52,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:52,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:52,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:52,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:52,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:52,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:52,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:59:52,318 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:52,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:59:52,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:59:52,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:59:52,319 INFO L87 Difference]: Start difference. First operand 14671 states and 20042 transitions. Second operand 9 states. [2019-09-10 06:59:53,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:53,981 INFO L93 Difference]: Finished difference Result 36737 states and 50699 transitions. [2019-09-10 06:59:53,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:59:53,982 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2019-09-10 06:59:53,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:54,015 INFO L225 Difference]: With dead ends: 36737 [2019-09-10 06:59:54,015 INFO L226 Difference]: Without dead ends: 36737 [2019-09-10 06:59:54,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-10 06:59:54,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36737 states. [2019-09-10 06:59:54,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36737 to 14671. [2019-09-10 06:59:54,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14671 states. [2019-09-10 06:59:54,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14671 states to 14671 states and 20040 transitions. [2019-09-10 06:59:54,201 INFO L78 Accepts]: Start accepts. Automaton has 14671 states and 20040 transitions. Word has length 79 [2019-09-10 06:59:54,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:54,201 INFO L475 AbstractCegarLoop]: Abstraction has 14671 states and 20040 transitions. [2019-09-10 06:59:54,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:59:54,201 INFO L276 IsEmpty]: Start isEmpty. Operand 14671 states and 20040 transitions. [2019-09-10 06:59:54,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 06:59:54,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:54,204 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:54,204 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:54,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:54,205 INFO L82 PathProgramCache]: Analyzing trace with hash -774477418, now seen corresponding path program 1 times [2019-09-10 06:59:54,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:54,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:54,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:54,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:54,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:54,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:54,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:54,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:59:54,358 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:54,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:59:54,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:59:54,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:59:54,359 INFO L87 Difference]: Start difference. First operand 14671 states and 20040 transitions. Second operand 9 states. [2019-09-10 06:59:55,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:55,645 INFO L93 Difference]: Finished difference Result 24832 states and 34109 transitions. [2019-09-10 06:59:55,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 06:59:55,645 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2019-09-10 06:59:55,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:55,671 INFO L225 Difference]: With dead ends: 24832 [2019-09-10 06:59:55,671 INFO L226 Difference]: Without dead ends: 24832 [2019-09-10 06:59:55,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:59:55,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24832 states. [2019-09-10 06:59:55,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24832 to 14671. [2019-09-10 06:59:55,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14671 states. [2019-09-10 06:59:55,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14671 states to 14671 states and 20038 transitions. [2019-09-10 06:59:55,824 INFO L78 Accepts]: Start accepts. Automaton has 14671 states and 20038 transitions. Word has length 79 [2019-09-10 06:59:55,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:55,824 INFO L475 AbstractCegarLoop]: Abstraction has 14671 states and 20038 transitions. [2019-09-10 06:59:55,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:59:55,824 INFO L276 IsEmpty]: Start isEmpty. Operand 14671 states and 20038 transitions. [2019-09-10 06:59:55,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:59:55,828 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:55,828 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:55,828 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:55,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:55,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1684566900, now seen corresponding path program 1 times [2019-09-10 06:59:55,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:55,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:55,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:55,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:55,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:56,231 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-09-10 06:59:57,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:59:57,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:57,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 06:59:57,226 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:57,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:59:57,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:59:57,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:59:57,227 INFO L87 Difference]: Start difference. First operand 14671 states and 20038 transitions. Second operand 22 states. [2019-09-10 06:59:58,396 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-10 06:59:58,645 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-09-10 06:59:59,008 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2019-09-10 06:59:59,505 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2019-09-10 06:59:59,820 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-09-10 07:00:00,238 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-09-10 07:00:00,550 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-09-10 07:00:00,878 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-09-10 07:00:01,176 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2019-09-10 07:00:01,426 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2019-09-10 07:00:01,998 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-09-10 07:00:04,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:04,716 INFO L93 Difference]: Finished difference Result 31733 states and 43724 transitions. [2019-09-10 07:00:04,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 07:00:04,717 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 81 [2019-09-10 07:00:04,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:04,747 INFO L225 Difference]: With dead ends: 31733 [2019-09-10 07:00:04,747 INFO L226 Difference]: Without dead ends: 31733 [2019-09-10 07:00:04,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=398, Invalid=1324, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 07:00:04,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31733 states. [2019-09-10 07:00:04,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31733 to 14663. [2019-09-10 07:00:04,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14663 states. [2019-09-10 07:00:04,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14663 states to 14663 states and 20024 transitions. [2019-09-10 07:00:04,921 INFO L78 Accepts]: Start accepts. Automaton has 14663 states and 20024 transitions. Word has length 81 [2019-09-10 07:00:04,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:04,921 INFO L475 AbstractCegarLoop]: Abstraction has 14663 states and 20024 transitions. [2019-09-10 07:00:04,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 07:00:04,921 INFO L276 IsEmpty]: Start isEmpty. Operand 14663 states and 20024 transitions. [2019-09-10 07:00:04,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:00:04,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:04,926 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:04,926 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:04,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:04,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1922309466, now seen corresponding path program 1 times [2019-09-10 07:00:04,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:04,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:04,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:04,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:04,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:05,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:05,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:05,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 07:00:05,713 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:05,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:00:05,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:00:05,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:00:05,715 INFO L87 Difference]: Start difference. First operand 14663 states and 20024 transitions. Second operand 18 states. [2019-09-10 07:00:06,321 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-09-10 07:00:06,514 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-10 07:00:06,785 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-10 07:00:07,058 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 07:00:07,367 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-10 07:00:07,718 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 07:00:07,982 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 07:00:08,154 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 07:00:09,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:09,784 INFO L93 Difference]: Finished difference Result 28623 states and 39334 transitions. [2019-09-10 07:00:09,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 07:00:09,785 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 82 [2019-09-10 07:00:09,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:09,810 INFO L225 Difference]: With dead ends: 28623 [2019-09-10 07:00:09,811 INFO L226 Difference]: Without dead ends: 28623 [2019-09-10 07:00:09,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=312, Invalid=1094, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 07:00:09,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28623 states. [2019-09-10 07:00:09,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28623 to 14632. [2019-09-10 07:00:09,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14632 states. [2019-09-10 07:00:09,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14632 states to 14632 states and 19987 transitions. [2019-09-10 07:00:09,963 INFO L78 Accepts]: Start accepts. Automaton has 14632 states and 19987 transitions. Word has length 82 [2019-09-10 07:00:09,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:09,963 INFO L475 AbstractCegarLoop]: Abstraction has 14632 states and 19987 transitions. [2019-09-10 07:00:09,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:00:09,963 INFO L276 IsEmpty]: Start isEmpty. Operand 14632 states and 19987 transitions. [2019-09-10 07:00:09,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:00:09,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:09,968 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:09,968 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:09,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:09,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1311989212, now seen corresponding path program 1 times [2019-09-10 07:00:09,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:09,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:09,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:09,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:09,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:10,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:10,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:10,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 07:00:10,559 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:10,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 07:00:10,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 07:00:10,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:00:10,560 INFO L87 Difference]: Start difference. First operand 14632 states and 19987 transitions. Second operand 14 states. [2019-09-10 07:00:11,020 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-10 07:00:11,204 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 07:00:11,424 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 07:00:11,694 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-09-10 07:00:11,895 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 07:00:12,137 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 07:00:13,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:13,181 INFO L93 Difference]: Finished difference Result 31922 states and 43904 transitions. [2019-09-10 07:00:13,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:00:13,182 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 82 [2019-09-10 07:00:13,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:13,217 INFO L225 Difference]: With dead ends: 31922 [2019-09-10 07:00:13,217 INFO L226 Difference]: Without dead ends: 31922 [2019-09-10 07:00:13,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:00:13,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31922 states. [2019-09-10 07:00:13,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31922 to 14588. [2019-09-10 07:00:13,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14588 states. [2019-09-10 07:00:13,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14588 states to 14588 states and 19931 transitions. [2019-09-10 07:00:13,408 INFO L78 Accepts]: Start accepts. Automaton has 14588 states and 19931 transitions. Word has length 82 [2019-09-10 07:00:13,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:13,409 INFO L475 AbstractCegarLoop]: Abstraction has 14588 states and 19931 transitions. [2019-09-10 07:00:13,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 07:00:13,409 INFO L276 IsEmpty]: Start isEmpty. Operand 14588 states and 19931 transitions. [2019-09-10 07:00:13,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:00:13,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:13,414 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:13,414 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:13,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:13,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1478063430, now seen corresponding path program 1 times [2019-09-10 07:00:13,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:13,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:13,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:13,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:13,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:14,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:14,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:14,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:00:14,195 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:14,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:00:14,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:00:14,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:00:14,195 INFO L87 Difference]: Start difference. First operand 14588 states and 19931 transitions. Second operand 17 states. [2019-09-10 07:00:14,722 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 07:00:15,104 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-10 07:00:15,290 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-10 07:00:15,457 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 07:00:15,630 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 07:00:15,942 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 07:00:16,103 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 07:00:16,335 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 07:00:17,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:17,903 INFO L93 Difference]: Finished difference Result 27278 states and 37258 transitions. [2019-09-10 07:00:17,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:00:17,903 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 82 [2019-09-10 07:00:17,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:17,933 INFO L225 Difference]: With dead ends: 27278 [2019-09-10 07:00:17,933 INFO L226 Difference]: Without dead ends: 27278 [2019-09-10 07:00:17,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=243, Invalid=813, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 07:00:17,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27278 states. [2019-09-10 07:00:18,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27278 to 14534. [2019-09-10 07:00:18,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14534 states. [2019-09-10 07:00:18,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14534 states to 14534 states and 19866 transitions. [2019-09-10 07:00:18,088 INFO L78 Accepts]: Start accepts. Automaton has 14534 states and 19866 transitions. Word has length 82 [2019-09-10 07:00:18,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:18,088 INFO L475 AbstractCegarLoop]: Abstraction has 14534 states and 19866 transitions. [2019-09-10 07:00:18,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:00:18,088 INFO L276 IsEmpty]: Start isEmpty. Operand 14534 states and 19866 transitions. [2019-09-10 07:00:18,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:00:18,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:18,093 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:18,093 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:18,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:18,093 INFO L82 PathProgramCache]: Analyzing trace with hash -319630535, now seen corresponding path program 1 times [2019-09-10 07:00:18,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:18,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:18,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:18,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:18,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:18,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:18,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:00:18,490 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:18,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:00:18,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:00:18,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:00:18,491 INFO L87 Difference]: Start difference. First operand 14534 states and 19866 transitions. Second operand 12 states. [2019-09-10 07:00:20,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:20,316 INFO L93 Difference]: Finished difference Result 28312 states and 39014 transitions. [2019-09-10 07:00:20,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:00:20,316 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 83 [2019-09-10 07:00:20,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:20,347 INFO L225 Difference]: With dead ends: 28312 [2019-09-10 07:00:20,347 INFO L226 Difference]: Without dead ends: 28312 [2019-09-10 07:00:20,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2019-09-10 07:00:20,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28312 states. [2019-09-10 07:00:20,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28312 to 14533. [2019-09-10 07:00:20,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14533 states. [2019-09-10 07:00:20,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14533 states to 14533 states and 19864 transitions. [2019-09-10 07:00:20,512 INFO L78 Accepts]: Start accepts. Automaton has 14533 states and 19864 transitions. Word has length 83 [2019-09-10 07:00:20,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:20,513 INFO L475 AbstractCegarLoop]: Abstraction has 14533 states and 19864 transitions. [2019-09-10 07:00:20,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:00:20,513 INFO L276 IsEmpty]: Start isEmpty. Operand 14533 states and 19864 transitions. [2019-09-10 07:00:20,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:00:20,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:20,518 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:20,518 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:20,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:20,518 INFO L82 PathProgramCache]: Analyzing trace with hash -450542762, now seen corresponding path program 1 times [2019-09-10 07:00:20,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:20,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:20,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:20,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:20,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:21,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:21,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:21,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:00:21,120 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:21,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:00:21,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:00:21,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:00:21,121 INFO L87 Difference]: Start difference. First operand 14533 states and 19864 transitions. Second operand 13 states. [2019-09-10 07:00:21,705 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2019-09-10 07:00:22,089 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 07:00:22,310 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 07:00:22,550 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-09-10 07:00:22,847 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-09-10 07:00:23,053 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 07:00:23,244 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:00:23,586 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-10 07:00:23,807 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 07:00:24,281 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 07:00:24,535 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-09-10 07:00:24,740 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 07:00:25,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:25,185 INFO L93 Difference]: Finished difference Result 49051 states and 67709 transitions. [2019-09-10 07:00:25,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 07:00:25,185 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 83 [2019-09-10 07:00:25,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:25,227 INFO L225 Difference]: With dead ends: 49051 [2019-09-10 07:00:25,228 INFO L226 Difference]: Without dead ends: 49051 [2019-09-10 07:00:25,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=267, Invalid=725, Unknown=0, NotChecked=0, Total=992 [2019-09-10 07:00:25,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49051 states. [2019-09-10 07:00:25,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49051 to 14474. [2019-09-10 07:00:25,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14474 states. [2019-09-10 07:00:25,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14474 states to 14474 states and 19794 transitions. [2019-09-10 07:00:25,444 INFO L78 Accepts]: Start accepts. Automaton has 14474 states and 19794 transitions. Word has length 83 [2019-09-10 07:00:25,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:25,444 INFO L475 AbstractCegarLoop]: Abstraction has 14474 states and 19794 transitions. [2019-09-10 07:00:25,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:00:25,444 INFO L276 IsEmpty]: Start isEmpty. Operand 14474 states and 19794 transitions. [2019-09-10 07:00:25,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:00:25,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:25,452 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:25,452 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:25,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:25,453 INFO L82 PathProgramCache]: Analyzing trace with hash -492516632, now seen corresponding path program 1 times [2019-09-10 07:00:25,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:25,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:25,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:25,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:25,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:25,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:25,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:25,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:00:25,533 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:25,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:00:25,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:00:25,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:00:25,534 INFO L87 Difference]: Start difference. First operand 14474 states and 19794 transitions. Second operand 7 states. [2019-09-10 07:00:25,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:25,876 INFO L93 Difference]: Finished difference Result 72489 states and 98874 transitions. [2019-09-10 07:00:25,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:00:25,877 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-09-10 07:00:25,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:25,958 INFO L225 Difference]: With dead ends: 72489 [2019-09-10 07:00:25,958 INFO L226 Difference]: Without dead ends: 72489 [2019-09-10 07:00:25,958 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:00:25,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72489 states. [2019-09-10 07:00:26,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72489 to 45963. [2019-09-10 07:00:26,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45963 states. [2019-09-10 07:00:26,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45963 states to 45963 states and 62528 transitions. [2019-09-10 07:00:26,435 INFO L78 Accepts]: Start accepts. Automaton has 45963 states and 62528 transitions. Word has length 86 [2019-09-10 07:00:26,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:26,435 INFO L475 AbstractCegarLoop]: Abstraction has 45963 states and 62528 transitions. [2019-09-10 07:00:26,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:00:26,436 INFO L276 IsEmpty]: Start isEmpty. Operand 45963 states and 62528 transitions. [2019-09-10 07:00:26,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:00:26,445 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:26,445 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:26,445 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:26,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:26,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1251473893, now seen corresponding path program 1 times [2019-09-10 07:00:26,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:26,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:26,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:26,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:26,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:26,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:26,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:26,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:00:26,593 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:26,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:00:26,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:00:26,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:00:26,594 INFO L87 Difference]: Start difference. First operand 45963 states and 62528 transitions. Second operand 6 states. [2019-09-10 07:00:26,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:26,936 INFO L93 Difference]: Finished difference Result 44658 states and 60806 transitions. [2019-09-10 07:00:26,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:00:26,937 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-09-10 07:00:26,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:26,981 INFO L225 Difference]: With dead ends: 44658 [2019-09-10 07:00:26,981 INFO L226 Difference]: Without dead ends: 44658 [2019-09-10 07:00:26,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:00:27,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44658 states. [2019-09-10 07:00:27,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44658 to 44652. [2019-09-10 07:00:27,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44652 states. [2019-09-10 07:00:27,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44652 states to 44652 states and 60803 transitions. [2019-09-10 07:00:27,337 INFO L78 Accepts]: Start accepts. Automaton has 44652 states and 60803 transitions. Word has length 87 [2019-09-10 07:00:27,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:27,337 INFO L475 AbstractCegarLoop]: Abstraction has 44652 states and 60803 transitions. [2019-09-10 07:00:27,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:00:27,337 INFO L276 IsEmpty]: Start isEmpty. Operand 44652 states and 60803 transitions. [2019-09-10 07:00:27,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:00:27,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:27,347 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:27,347 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:27,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:27,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1916938305, now seen corresponding path program 1 times [2019-09-10 07:00:27,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:27,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:27,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:27,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:27,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:27,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:27,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:27,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:00:27,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:27,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:00:27,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:00:27,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:00:27,418 INFO L87 Difference]: Start difference. First operand 44652 states and 60803 transitions. Second operand 6 states. [2019-09-10 07:00:27,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:27,903 INFO L93 Difference]: Finished difference Result 86211 states and 115690 transitions. [2019-09-10 07:00:27,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:00:27,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2019-09-10 07:00:27,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:27,987 INFO L225 Difference]: With dead ends: 86211 [2019-09-10 07:00:27,987 INFO L226 Difference]: Without dead ends: 86211 [2019-09-10 07:00:27,988 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 07:00:28,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86211 states. [2019-09-10 07:00:28,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86211 to 45567. [2019-09-10 07:00:28,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45567 states. [2019-09-10 07:00:28,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45567 states to 45567 states and 61413 transitions. [2019-09-10 07:00:28,561 INFO L78 Accepts]: Start accepts. Automaton has 45567 states and 61413 transitions. Word has length 88 [2019-09-10 07:00:28,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:28,562 INFO L475 AbstractCegarLoop]: Abstraction has 45567 states and 61413 transitions. [2019-09-10 07:00:28,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:00:28,562 INFO L276 IsEmpty]: Start isEmpty. Operand 45567 states and 61413 transitions. [2019-09-10 07:00:28,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:00:28,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:28,572 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:28,573 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:28,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:28,574 INFO L82 PathProgramCache]: Analyzing trace with hash -317561574, now seen corresponding path program 1 times [2019-09-10 07:00:28,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:28,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:28,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:28,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:28,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:28,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:28,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:28,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:00:28,620 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:28,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:00:28,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:00:28,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:28,621 INFO L87 Difference]: Start difference. First operand 45567 states and 61413 transitions. Second operand 3 states. [2019-09-10 07:00:28,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:28,808 INFO L93 Difference]: Finished difference Result 82808 states and 110135 transitions. [2019-09-10 07:00:28,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:00:28,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-10 07:00:28,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:28,902 INFO L225 Difference]: With dead ends: 82808 [2019-09-10 07:00:28,903 INFO L226 Difference]: Without dead ends: 82808 [2019-09-10 07:00:28,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:28,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82808 states. [2019-09-10 07:00:29,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82808 to 81991. [2019-09-10 07:00:29,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81991 states. [2019-09-10 07:00:29,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81991 states to 81991 states and 109319 transitions. [2019-09-10 07:00:29,544 INFO L78 Accepts]: Start accepts. Automaton has 81991 states and 109319 transitions. Word has length 89 [2019-09-10 07:00:29,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:29,545 INFO L475 AbstractCegarLoop]: Abstraction has 81991 states and 109319 transitions. [2019-09-10 07:00:29,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:00:29,545 INFO L276 IsEmpty]: Start isEmpty. Operand 81991 states and 109319 transitions. [2019-09-10 07:00:29,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:00:29,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:29,563 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:29,564 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:29,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:29,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1381285837, now seen corresponding path program 1 times [2019-09-10 07:00:29,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:29,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:29,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:29,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:29,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:29,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:29,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:29,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:00:29,610 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:29,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:00:29,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:00:29,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:00:29,611 INFO L87 Difference]: Start difference. First operand 81991 states and 109319 transitions. Second operand 5 states. [2019-09-10 07:00:30,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:30,366 INFO L93 Difference]: Finished difference Result 181177 states and 238216 transitions. [2019-09-10 07:00:30,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:00:30,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-10 07:00:30,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:30,570 INFO L225 Difference]: With dead ends: 181177 [2019-09-10 07:00:30,571 INFO L226 Difference]: Without dead ends: 181177 [2019-09-10 07:00:30,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:00:30,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181177 states. [2019-09-10 07:00:33,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181177 to 101563. [2019-09-10 07:00:33,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101563 states. [2019-09-10 07:00:33,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101563 states to 101563 states and 133813 transitions. [2019-09-10 07:00:33,798 INFO L78 Accepts]: Start accepts. Automaton has 101563 states and 133813 transitions. Word has length 90 [2019-09-10 07:00:33,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:33,798 INFO L475 AbstractCegarLoop]: Abstraction has 101563 states and 133813 transitions. [2019-09-10 07:00:33,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:00:33,799 INFO L276 IsEmpty]: Start isEmpty. Operand 101563 states and 133813 transitions. [2019-09-10 07:00:33,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:00:33,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:33,814 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:33,814 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:33,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:33,814 INFO L82 PathProgramCache]: Analyzing trace with hash -713275310, now seen corresponding path program 1 times [2019-09-10 07:00:33,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:33,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:33,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:33,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:33,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:33,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:33,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:33,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:00:33,868 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:33,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:00:33,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:00:33,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:00:33,869 INFO L87 Difference]: Start difference. First operand 101563 states and 133813 transitions. Second operand 5 states. [2019-09-10 07:00:35,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:35,032 INFO L93 Difference]: Finished difference Result 348489 states and 453986 transitions. [2019-09-10 07:00:35,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:00:35,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-10 07:00:35,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:35,473 INFO L225 Difference]: With dead ends: 348489 [2019-09-10 07:00:35,474 INFO L226 Difference]: Without dead ends: 348489 [2019-09-10 07:00:35,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:00:35,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348489 states. [2019-09-10 07:00:40,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348489 to 191037. [2019-09-10 07:00:40,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191037 states. [2019-09-10 07:00:40,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191037 states to 191037 states and 251119 transitions. [2019-09-10 07:00:40,871 INFO L78 Accepts]: Start accepts. Automaton has 191037 states and 251119 transitions. Word has length 90 [2019-09-10 07:00:40,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:40,871 INFO L475 AbstractCegarLoop]: Abstraction has 191037 states and 251119 transitions. [2019-09-10 07:00:40,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:00:40,871 INFO L276 IsEmpty]: Start isEmpty. Operand 191037 states and 251119 transitions. [2019-09-10 07:00:40,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:00:40,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:40,888 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:40,888 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:40,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:40,889 INFO L82 PathProgramCache]: Analyzing trace with hash 745726939, now seen corresponding path program 1 times [2019-09-10 07:00:40,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:40,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:40,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:40,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:40,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:40,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:40,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:40,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:00:40,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:40,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:00:40,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:00:40,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:40,940 INFO L87 Difference]: Start difference. First operand 191037 states and 251119 transitions. Second operand 3 states. [2019-09-10 07:00:41,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:41,880 INFO L93 Difference]: Finished difference Result 368379 states and 478248 transitions. [2019-09-10 07:00:41,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:00:41,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-09-10 07:00:41,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:42,320 INFO L225 Difference]: With dead ends: 368379 [2019-09-10 07:00:42,320 INFO L226 Difference]: Without dead ends: 368379 [2019-09-10 07:00:42,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:42,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368379 states. [2019-09-10 07:00:49,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368379 to 350712. [2019-09-10 07:00:49,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350712 states. [2019-09-10 07:00:49,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350712 states to 350712 states and 456840 transitions. [2019-09-10 07:00:49,905 INFO L78 Accepts]: Start accepts. Automaton has 350712 states and 456840 transitions. Word has length 91 [2019-09-10 07:00:49,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:49,905 INFO L475 AbstractCegarLoop]: Abstraction has 350712 states and 456840 transitions. [2019-09-10 07:00:49,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:00:49,905 INFO L276 IsEmpty]: Start isEmpty. Operand 350712 states and 456840 transitions. [2019-09-10 07:00:49,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:00:49,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:49,920 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:49,920 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:49,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:49,921 INFO L82 PathProgramCache]: Analyzing trace with hash 2045695167, now seen corresponding path program 1 times [2019-09-10 07:00:49,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:49,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:49,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:49,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:49,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:49,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 07:00:49,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:49,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:00:49,959 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:49,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:00:49,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:00:49,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:49,960 INFO L87 Difference]: Start difference. First operand 350712 states and 456840 transitions. Second operand 3 states. [2019-09-10 07:00:54,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:54,381 INFO L93 Difference]: Finished difference Result 367760 states and 470851 transitions. [2019-09-10 07:00:54,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:00:54,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-09-10 07:00:54,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:54,852 INFO L225 Difference]: With dead ends: 367760 [2019-09-10 07:00:54,853 INFO L226 Difference]: Without dead ends: 367760 [2019-09-10 07:00:54,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:55,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367760 states. [2019-09-10 07:00:57,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367760 to 365094. [2019-09-10 07:00:57,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365094 states. [2019-09-10 07:01:05,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365094 states to 365094 states and 468186 transitions. [2019-09-10 07:01:05,525 INFO L78 Accepts]: Start accepts. Automaton has 365094 states and 468186 transitions. Word has length 92 [2019-09-10 07:01:05,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:05,525 INFO L475 AbstractCegarLoop]: Abstraction has 365094 states and 468186 transitions. [2019-09-10 07:01:05,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:01:05,526 INFO L276 IsEmpty]: Start isEmpty. Operand 365094 states and 468186 transitions. [2019-09-10 07:01:05,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 07:01:05,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:05,557 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:05,558 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:05,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:05,558 INFO L82 PathProgramCache]: Analyzing trace with hash -254269298, now seen corresponding path program 1 times [2019-09-10 07:01:05,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:05,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:05,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:05,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:05,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:05,618 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 07:01:05,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:05,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:01:05,619 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:05,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:01:05,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:01:05,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:05,620 INFO L87 Difference]: Start difference. First operand 365094 states and 468186 transitions. Second operand 3 states. [2019-09-10 07:01:06,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:06,435 INFO L93 Difference]: Finished difference Result 380167 states and 478022 transitions. [2019-09-10 07:01:06,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:01:06,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-09-10 07:01:06,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:06,874 INFO L225 Difference]: With dead ends: 380167 [2019-09-10 07:01:06,874 INFO L226 Difference]: Without dead ends: 380167 [2019-09-10 07:01:06,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:07,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380167 states. [2019-09-10 07:01:11,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380167 to 366059. [2019-09-10 07:01:11,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366059 states. [2019-09-10 07:01:20,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366059 states to 366059 states and 463915 transitions. [2019-09-10 07:01:20,469 INFO L78 Accepts]: Start accepts. Automaton has 366059 states and 463915 transitions. Word has length 115 [2019-09-10 07:01:20,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:20,469 INFO L475 AbstractCegarLoop]: Abstraction has 366059 states and 463915 transitions. [2019-09-10 07:01:20,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:01:20,469 INFO L276 IsEmpty]: Start isEmpty. Operand 366059 states and 463915 transitions. [2019-09-10 07:01:20,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 07:01:20,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:20,495 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:20,495 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:20,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:20,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1454164330, now seen corresponding path program 1 times [2019-09-10 07:01:20,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:20,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:20,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:20,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:20,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:20,547 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:20,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:20,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:01:20,547 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:20,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:01:20,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:01:20,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:20,548 INFO L87 Difference]: Start difference. First operand 366059 states and 463915 transitions. Second operand 3 states. [2019-09-10 07:01:22,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:22,742 INFO L93 Difference]: Finished difference Result 697869 states and 866148 transitions. [2019-09-10 07:01:22,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:01:22,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-10 07:01:22,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:23,697 INFO L225 Difference]: With dead ends: 697869 [2019-09-10 07:01:23,697 INFO L226 Difference]: Without dead ends: 697869 [2019-09-10 07:01:23,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:24,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697869 states. [2019-09-10 07:01:35,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697869 to 625129. [2019-09-10 07:01:35,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625129 states. [2019-09-10 07:01:37,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625129 states to 625129 states and 780851 transitions. [2019-09-10 07:01:37,235 INFO L78 Accepts]: Start accepts. Automaton has 625129 states and 780851 transitions. Word has length 116 [2019-09-10 07:01:37,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:37,235 INFO L475 AbstractCegarLoop]: Abstraction has 625129 states and 780851 transitions. [2019-09-10 07:01:37,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:01:37,236 INFO L276 IsEmpty]: Start isEmpty. Operand 625129 states and 780851 transitions. [2019-09-10 07:01:37,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 07:01:37,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:37,265 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:37,265 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:37,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:37,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1567316303, now seen corresponding path program 1 times [2019-09-10 07:01:37,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:37,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:37,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:37,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:37,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:37,407 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 07:01:37,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:37,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:01:37,407 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:37,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:01:37,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:01:37,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:01:37,409 INFO L87 Difference]: Start difference. First operand 625129 states and 780851 transitions. Second operand 9 states. [2019-09-10 07:01:48,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:48,960 INFO L93 Difference]: Finished difference Result 1584346 states and 1974733 transitions. [2019-09-10 07:01:48,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:01:48,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 07:01:48,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:00,017 INFO L225 Difference]: With dead ends: 1584346 [2019-09-10 07:02:00,017 INFO L226 Difference]: Without dead ends: 1584346 [2019-09-10 07:02:00,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:02:00,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584346 states. [2019-09-10 07:02:11,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584346 to 625036. [2019-09-10 07:02:11,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625036 states. [2019-09-10 07:02:23,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625036 states to 625036 states and 780734 transitions. [2019-09-10 07:02:23,492 INFO L78 Accepts]: Start accepts. Automaton has 625036 states and 780734 transitions. Word has length 119 [2019-09-10 07:02:23,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:23,493 INFO L475 AbstractCegarLoop]: Abstraction has 625036 states and 780734 transitions. [2019-09-10 07:02:23,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:02:23,493 INFO L276 IsEmpty]: Start isEmpty. Operand 625036 states and 780734 transitions. [2019-09-10 07:02:23,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 07:02:23,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:23,520 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:23,520 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:23,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:23,520 INFO L82 PathProgramCache]: Analyzing trace with hash -279983093, now seen corresponding path program 1 times [2019-09-10 07:02:23,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:23,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:23,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:23,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:23,521 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:23,653 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 07:02:23,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:23,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:02:23,653 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:23,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:02:23,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:02:23,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:02:23,654 INFO L87 Difference]: Start difference. First operand 625036 states and 780734 transitions. Second operand 9 states. [2019-09-10 07:02:30,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:30,886 INFO L93 Difference]: Finished difference Result 1483844 states and 1847213 transitions. [2019-09-10 07:02:30,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:02:30,886 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 07:02:30,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:32,870 INFO L225 Difference]: With dead ends: 1483844 [2019-09-10 07:02:32,870 INFO L226 Difference]: Without dead ends: 1483844 [2019-09-10 07:02:32,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:02:33,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483844 states. [2019-09-10 07:02:58,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483844 to 624996. [2019-09-10 07:02:58,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624996 states. [2019-09-10 07:03:00,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624996 states to 624996 states and 780674 transitions. [2019-09-10 07:03:00,328 INFO L78 Accepts]: Start accepts. Automaton has 624996 states and 780674 transitions. Word has length 119 [2019-09-10 07:03:00,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:00,328 INFO L475 AbstractCegarLoop]: Abstraction has 624996 states and 780674 transitions. [2019-09-10 07:03:00,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:03:00,328 INFO L276 IsEmpty]: Start isEmpty. Operand 624996 states and 780674 transitions. [2019-09-10 07:03:00,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 07:03:00,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:00,358 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:00,358 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:00,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:00,359 INFO L82 PathProgramCache]: Analyzing trace with hash -716127616, now seen corresponding path program 1 times [2019-09-10 07:03:00,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:00,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:00,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:00,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:00,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:00,584 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:00,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:03:00,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:03:00,586 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 121 with the following transitions: [2019-09-10 07:03:00,588 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [147], [150], [154], [167], [170], [183], [186], [189], [199], [202], [215], [218], [221], [225], [227], [230], [235], [246], [248], [251], [262], [264], [267], [278], [280], [283], [294], [296], [298], [301], [304], [306], [308], [311], [312], [314], [317], [322], [335], [337], [350], [358], [377], [388], [390], [403], [411], [430], [441], [443], [446], [449], [452], [454], [456], [494], [496], [498], [511], [519], [544], [598], [716], [987], [1820], [1824], [1827], [1830], [1833], [1835], [1839], [1977], [2055], [2059], [2089], [2105], [2108], [2111], [2115], [2730], [2731], [2735], [2736], [2737] [2019-09-10 07:03:00,660 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:03:00,661 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:03:00,976 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:03:01,862 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:03:01,868 INFO L272 AbstractInterpreter]: Visited 111 different actions 539 times. Merged at 46 different actions 373 times. Widened at 17 different actions 58 times. Performed 1839 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1839 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 58 fixpoints after 14 different actions. Largest state had 255 variables. [2019-09-10 07:03:01,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:01,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:03:01,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:03:01,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:03:01,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:01,891 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:03:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:02,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 1400 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 07:03:02,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:03:02,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:03:02,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:03:03,191 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:03,191 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:03:03,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:03:03,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:03:03,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:03:03,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:03:03,484 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:03,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:03:03,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 23 [2019-09-10 07:03:03,492 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:03:03,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 07:03:03,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 07:03:03,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:03:03,494 INFO L87 Difference]: Start difference. First operand 624996 states and 780674 transitions. Second operand 19 states. [2019-09-10 07:03:03,924 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 07:03:05,602 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2019-09-10 07:03:11,338 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-09-10 07:03:11,739 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2019-09-10 07:03:12,299 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-09-10 07:03:12,593 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 07:03:13,043 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-09-10 07:03:13,682 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-09-10 07:03:13,905 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-09-10 07:03:14,108 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-09-10 07:03:14,360 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-10 07:03:14,913 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 07:03:15,879 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2019-09-10 07:03:16,986 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 07:03:17,979 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 07:03:18,136 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 07:03:18,584 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:03:20,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:20,734 INFO L93 Difference]: Finished difference Result 1158544 states and 1434115 transitions. [2019-09-10 07:03:20,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-10 07:03:20,734 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 120 [2019-09-10 07:03:20,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:24,036 INFO L225 Difference]: With dead ends: 1158544 [2019-09-10 07:03:24,036 INFO L226 Difference]: Without dead ends: 1158544 [2019-09-10 07:03:24,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 215 SyntacticMatches, 13 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=972, Invalid=2934, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 07:03:24,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158544 states. [2019-09-10 07:03:39,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158544 to 711358. [2019-09-10 07:03:39,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711358 states. [2019-09-10 07:03:41,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711358 states to 711358 states and 887224 transitions. [2019-09-10 07:03:41,811 INFO L78 Accepts]: Start accepts. Automaton has 711358 states and 887224 transitions. Word has length 120 [2019-09-10 07:03:41,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:41,811 INFO L475 AbstractCegarLoop]: Abstraction has 711358 states and 887224 transitions. [2019-09-10 07:03:41,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 07:03:41,811 INFO L276 IsEmpty]: Start isEmpty. Operand 711358 states and 887224 transitions. [2019-09-10 07:03:41,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 07:03:41,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:41,908 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:41,909 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:41,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:41,909 INFO L82 PathProgramCache]: Analyzing trace with hash -699338810, now seen corresponding path program 1 times [2019-09-10 07:03:41,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:41,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:41,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:41,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:41,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:42,183 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:42,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:03:42,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:03:42,184 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 121 with the following transitions: [2019-09-10 07:03:42,184 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [147], [150], [154], [167], [170], [183], [186], [199], [202], [205], [215], [218], [221], [225], [227], [230], [235], [246], [248], [251], [262], [264], [267], [278], [280], [283], [294], [296], [298], [301], [304], [306], [308], [311], [312], [314], [317], [322], [335], [337], [350], [358], [377], [388], [390], [393], [396], [399], [401], [403], [441], [443], [456], [464], [483], [494], [496], [498], [511], [519], [542], [600], [716], [987], [1820], [1824], [2404], [2418], [2422], [2425], [2428], [2431], [2435], [2465], [2481], [2484], [2487], [2491], [2702], [2730], [2731], [2735], [2736], [2737] [2019-09-10 07:03:42,201 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:03:42,202 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:03:42,292 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:03:42,863 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:03:42,864 INFO L272 AbstractInterpreter]: Visited 111 different actions 527 times. Merged at 46 different actions 364 times. Widened at 16 different actions 50 times. Performed 1785 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1785 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 55 fixpoints after 14 different actions. Largest state had 255 variables. [2019-09-10 07:03:42,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:42,864 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:03:42,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:03:42,864 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) [2019-09-10 07:03:42,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:42,891 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:03:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:43,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 1400 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 07:03:43,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:03:43,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:03:43,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:03:43,862 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:43,863 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:03:44,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:03:44,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:03:44,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:03:44,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:03:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:52,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:03:52,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 22 [2019-09-10 07:03:52,254 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:03:52,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:03:52,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:03:52,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:03:52,255 INFO L87 Difference]: Start difference. First operand 711358 states and 887224 transitions. Second operand 18 states. [2019-09-10 07:03:52,602 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 07:03:55,852 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-09-10 07:03:56,558 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-09-10 07:03:57,628 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 07:03:58,690 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 07:03:59,166 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 07:04:00,228 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 07:04:00,502 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-09-10 07:04:01,267 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 07:04:01,932 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-10 07:04:02,647 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 07:04:02,974 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-10 07:04:07,158 WARN L188 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-10 07:04:07,401 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 07:04:23,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:04:23,632 INFO L93 Difference]: Finished difference Result 2710620 states and 3345647 transitions. [2019-09-10 07:04:23,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-10 07:04:23,633 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 120 [2019-09-10 07:04:23,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:28,582 INFO L225 Difference]: With dead ends: 2710620 [2019-09-10 07:04:28,582 INFO L226 Difference]: Without dead ends: 2710620 [2019-09-10 07:04:28,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 220 SyntacticMatches, 9 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2524 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=1894, Invalid=6662, Unknown=0, NotChecked=0, Total=8556 [2019-09-10 07:04:30,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2710620 states. [2019-09-10 07:05:08,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2710620 to 963487. [2019-09-10 07:05:08,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963487 states. [2019-09-10 07:05:12,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963487 states to 963487 states and 1202233 transitions. [2019-09-10 07:05:12,456 INFO L78 Accepts]: Start accepts. Automaton has 963487 states and 1202233 transitions. Word has length 120 [2019-09-10 07:05:12,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:12,456 INFO L475 AbstractCegarLoop]: Abstraction has 963487 states and 1202233 transitions. [2019-09-10 07:05:12,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:05:12,456 INFO L276 IsEmpty]: Start isEmpty. Operand 963487 states and 1202233 transitions. [2019-09-10 07:05:12,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 07:05:12,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:12,512 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:05:12,513 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:12,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:12,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1735499205, now seen corresponding path program 1 times [2019-09-10 07:05:12,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:12,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:12,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:12,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:12,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:12,578 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:05:12,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:12,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:05:12,578 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:12,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:05:12,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:05:12,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:05:12,579 INFO L87 Difference]: Start difference. First operand 963487 states and 1202233 transitions. Second operand 3 states. [2019-09-10 07:05:16,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:16,348 INFO L93 Difference]: Finished difference Result 949029 states and 1163900 transitions. [2019-09-10 07:05:16,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:05:16,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-10 07:05:16,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:17,829 INFO L225 Difference]: With dead ends: 949029 [2019-09-10 07:05:17,829 INFO L226 Difference]: Without dead ends: 949029 [2019-09-10 07:05:17,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:05:18,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949029 states.