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/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:59:48,745 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:59:48,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:59:48,764 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:59:48,765 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:59:48,766 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:59:48,767 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:59:48,769 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:59:48,771 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:59:48,772 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:59:48,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:59:48,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:59:48,774 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:59:48,775 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:59:48,776 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:59:48,777 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:59:48,778 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:59:48,779 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:59:48,781 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:59:48,783 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:59:48,784 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:59:48,785 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:59:48,786 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:59:48,787 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:59:48,789 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:59:48,789 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:59:48,790 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:59:48,791 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:59:48,791 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:59:48,792 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:59:48,792 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:59:48,793 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:59:48,794 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:59:48,795 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:59:48,796 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:59:48,796 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:59:48,797 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:59:48,797 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:59:48,797 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:59:48,798 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:59:48,799 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:59:48,800 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 04:59:48,814 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:59:48,815 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:59:48,815 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:59:48,815 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:59:48,816 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:59:48,816 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:59:48,817 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:59:48,817 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:59:48,817 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:59:48,817 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:59:48,818 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:59:48,818 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:59:48,818 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:59:48,819 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:59:48,819 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:59:48,819 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:59:48,819 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:59:48,819 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:59:48,820 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:59:48,820 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:59:48,820 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:59:48,820 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:59:48,820 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:59:48,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:59:48,821 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:59:48,821 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:59:48,821 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:59:48,821 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:59:48,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:59:48,822 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:59:48,851 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:59:48,868 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:59:48,872 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:59:48,874 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:59:48,874 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:59:48,875 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c [2019-09-10 04:59:48,945 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37d8188b4/0a460f86a3c245809974c0641fbd5798/FLAGdf99eb12c [2019-09-10 04:59:49,578 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:59:49,579 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c [2019-09-10 04:59:49,597 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37d8188b4/0a460f86a3c245809974c0641fbd5798/FLAGdf99eb12c [2019-09-10 04:59:49,837 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37d8188b4/0a460f86a3c245809974c0641fbd5798 [2019-09-10 04:59:49,847 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:59:49,849 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:59:49,850 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:59:49,850 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:59:49,854 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:59:49,855 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:59:49" (1/1) ... [2019-09-10 04:59:49,858 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f91d846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:59:49, skipping insertion in model container [2019-09-10 04:59:49,858 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:59:49" (1/1) ... [2019-09-10 04:59:49,866 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:59:49,933 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:59:50,377 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:59:50,389 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:59:50,515 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:59:50,541 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:59:50,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:59:50 WrapperNode [2019-09-10 04:59:50,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:59:50,543 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:59:50,543 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:59:50,543 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:59:50,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:59:50" (1/1) ... [2019-09-10 04:59:50,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:59:50" (1/1) ... [2019-09-10 04:59:50,571 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:59:50" (1/1) ... [2019-09-10 04:59:50,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:59:50" (1/1) ... [2019-09-10 04:59:50,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:59:50" (1/1) ... [2019-09-10 04:59:50,628 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:59:50" (1/1) ... [2019-09-10 04:59:50,639 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:59:50" (1/1) ... [2019-09-10 04:59:50,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:59:50,658 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:59:50,658 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:59:50,658 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:59:50,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:59:50" (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 04:59:50,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:59:50,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:59:50,756 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:59:50,756 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:59:50,756 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:59:50,757 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:59:50,757 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:59:50,757 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:59:50,757 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:59:50,757 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:59:50,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:59:50,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:59:50,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:59:50,760 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:59:50,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:59:50,761 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:59:50,762 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:59:50,762 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:59:50,762 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:59:50,762 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:59:50,762 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:59:50,763 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:59:50,763 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:59:50,763 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:59:50,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:59:50,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:59:52,400 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:59:52,401 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:59:52,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:59:52 BoogieIcfgContainer [2019-09-10 04:59:52,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:59:52,405 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:59:52,405 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:59:52,408 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:59:52,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:59:49" (1/3) ... [2019-09-10 04:59:52,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dec349c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:59:52, skipping insertion in model container [2019-09-10 04:59:52,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:59:50" (2/3) ... [2019-09-10 04:59:52,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dec349c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:59:52, skipping insertion in model container [2019-09-10 04:59:52,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:59:52" (3/3) ... [2019-09-10 04:59:52,414 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c [2019-09-10 04:59:52,424 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:59:52,436 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:59:52,453 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:59:52,499 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:59:52,499 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:59:52,499 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:59:52,499 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:59:52,500 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:59:52,500 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:59:52,500 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:59:52,500 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:59:52,539 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states. [2019-09-10 04:59:52,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 04:59:52,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:59:52,560 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:59:52,562 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:59:52,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:59:52,568 INFO L82 PathProgramCache]: Analyzing trace with hash -2107138659, now seen corresponding path program 1 times [2019-09-10 04:59:52,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:59:52,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:52,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:59:52,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:52,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:59:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:59:53,138 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 04:59:53,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:59:53,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:59:53,141 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:59:53,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:59:53,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:59:53,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:59:53,167 INFO L87 Difference]: Start difference. First operand 352 states. Second operand 5 states. [2019-09-10 04:59:53,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:59:53,378 INFO L93 Difference]: Finished difference Result 356 states and 610 transitions. [2019-09-10 04:59:53,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:59:53,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-10 04:59:53,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:59:53,413 INFO L225 Difference]: With dead ends: 356 [2019-09-10 04:59:53,413 INFO L226 Difference]: Without dead ends: 347 [2019-09-10 04:59:53,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:59:53,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-09-10 04:59:53,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2019-09-10 04:59:53,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-09-10 04:59:53,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 556 transitions. [2019-09-10 04:59:53,519 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 556 transitions. Word has length 102 [2019-09-10 04:59:53,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:59:53,520 INFO L475 AbstractCegarLoop]: Abstraction has 347 states and 556 transitions. [2019-09-10 04:59:53,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:59:53,520 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 556 transitions. [2019-09-10 04:59:53,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 04:59:53,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:59:53,532 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:59:53,533 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:59:53,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:59:53,533 INFO L82 PathProgramCache]: Analyzing trace with hash 149921471, now seen corresponding path program 1 times [2019-09-10 04:59:53,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:59:53,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:53,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:59:53,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:53,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:59:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:59:53,796 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 04:59:53,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:59:53,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:59:53,796 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:59:53,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:59:53,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:59:53,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:59:53,799 INFO L87 Difference]: Start difference. First operand 347 states and 556 transitions. Second operand 5 states. [2019-09-10 04:59:55,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:59:55,154 INFO L93 Difference]: Finished difference Result 491 states and 775 transitions. [2019-09-10 04:59:55,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:59:55,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-09-10 04:59:55,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:59:55,162 INFO L225 Difference]: With dead ends: 491 [2019-09-10 04:59:55,162 INFO L226 Difference]: Without dead ends: 491 [2019-09-10 04:59:55,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:59:55,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-09-10 04:59:55,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 483. [2019-09-10 04:59:55,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-09-10 04:59:55,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 768 transitions. [2019-09-10 04:59:55,197 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 768 transitions. Word has length 147 [2019-09-10 04:59:55,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:59:55,199 INFO L475 AbstractCegarLoop]: Abstraction has 483 states and 768 transitions. [2019-09-10 04:59:55,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:59:55,199 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 768 transitions. [2019-09-10 04:59:55,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 04:59:55,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:59:55,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:59:55,205 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:59:55,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:59:55,205 INFO L82 PathProgramCache]: Analyzing trace with hash -849632732, now seen corresponding path program 1 times [2019-09-10 04:59:55,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:59:55,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:55,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:59:55,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:55,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:59:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:59:55,426 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 04:59:55,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:59:55,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:59:55,432 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:59:55,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:59:55,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:59:55,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:59:55,442 INFO L87 Difference]: Start difference. First operand 483 states and 768 transitions. Second operand 5 states. [2019-09-10 04:59:56,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:59:56,790 INFO L93 Difference]: Finished difference Result 754 states and 1188 transitions. [2019-09-10 04:59:56,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:59:56,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 04:59:56,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:59:56,798 INFO L225 Difference]: With dead ends: 754 [2019-09-10 04:59:56,798 INFO L226 Difference]: Without dead ends: 754 [2019-09-10 04:59:56,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:59:56,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-09-10 04:59:56,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 746. [2019-09-10 04:59:56,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-09-10 04:59:56,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1181 transitions. [2019-09-10 04:59:56,830 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1181 transitions. Word has length 150 [2019-09-10 04:59:56,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:59:56,831 INFO L475 AbstractCegarLoop]: Abstraction has 746 states and 1181 transitions. [2019-09-10 04:59:56,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:59:56,831 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1181 transitions. [2019-09-10 04:59:56,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 04:59:56,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:59:56,835 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:59:56,835 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:59:56,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:59:56,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1519039157, now seen corresponding path program 1 times [2019-09-10 04:59:56,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:59:56,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:56,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:59:56,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:56,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:59:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:59:57,064 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 04:59:57,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:59:57,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:59:57,066 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:59:57,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:59:57,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:59:57,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:59:57,067 INFO L87 Difference]: Start difference. First operand 746 states and 1181 transitions. Second operand 5 states. [2019-09-10 04:59:58,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:59:58,303 INFO L93 Difference]: Finished difference Result 1270 states and 1988 transitions. [2019-09-10 04:59:58,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:59:58,304 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-09-10 04:59:58,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:59:58,312 INFO L225 Difference]: With dead ends: 1270 [2019-09-10 04:59:58,312 INFO L226 Difference]: Without dead ends: 1270 [2019-09-10 04:59:58,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:59:58,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2019-09-10 04:59:58,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1256. [2019-09-10 04:59:58,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-09-10 04:59:58,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1975 transitions. [2019-09-10 04:59:58,362 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1975 transitions. Word has length 153 [2019-09-10 04:59:58,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:59:58,362 INFO L475 AbstractCegarLoop]: Abstraction has 1256 states and 1975 transitions. [2019-09-10 04:59:58,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:59:58,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1975 transitions. [2019-09-10 04:59:58,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 04:59:58,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:59:58,367 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:59:58,367 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:59:58,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:59:58,367 INFO L82 PathProgramCache]: Analyzing trace with hash -409144026, now seen corresponding path program 1 times [2019-09-10 04:59:58,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:59:58,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:58,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:59:58,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:58,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:59:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:59:58,542 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 04:59:58,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:59:58,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:59:58,543 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:59:58,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:59:58,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:59:58,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:59:58,544 INFO L87 Difference]: Start difference. First operand 1256 states and 1975 transitions. Second operand 5 states. [2019-09-10 04:59:59,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:59:59,792 INFO L93 Difference]: Finished difference Result 2270 states and 3524 transitions. [2019-09-10 04:59:59,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:59:59,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-09-10 04:59:59,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:59:59,815 INFO L225 Difference]: With dead ends: 2270 [2019-09-10 04:59:59,815 INFO L226 Difference]: Without dead ends: 2270 [2019-09-10 04:59:59,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:59:59,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2019-09-10 04:59:59,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 2244. [2019-09-10 04:59:59,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2244 states. [2019-09-10 04:59:59,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 3499 transitions. [2019-09-10 04:59:59,997 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 3499 transitions. Word has length 156 [2019-09-10 04:59:59,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:59:59,998 INFO L475 AbstractCegarLoop]: Abstraction has 2244 states and 3499 transitions. [2019-09-10 04:59:59,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:59:59,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 3499 transitions. [2019-09-10 05:00:00,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 05:00:00,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:00,007 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:00:00,009 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:00,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:00,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1622684031, now seen corresponding path program 1 times [2019-09-10 05:00:00,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:00,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:00,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:00,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:00,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:00,412 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 05:00:00,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:00,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 05:00:00,413 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:00,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 05:00:00,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 05:00:00,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-10 05:00:00,414 INFO L87 Difference]: Start difference. First operand 2244 states and 3499 transitions. Second operand 11 states. [2019-09-10 05:00:06,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:00:06,881 INFO L93 Difference]: Finished difference Result 10219 states and 16280 transitions. [2019-09-10 05:00:06,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 05:00:06,881 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 159 [2019-09-10 05:00:06,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:00:06,944 INFO L225 Difference]: With dead ends: 10219 [2019-09-10 05:00:06,944 INFO L226 Difference]: Without dead ends: 10219 [2019-09-10 05:00:06,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=416, Invalid=1390, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 05:00:06,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10219 states. [2019-09-10 05:00:07,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10219 to 8745. [2019-09-10 05:00:07,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8745 states. [2019-09-10 05:00:07,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8745 states to 8745 states and 13789 transitions. [2019-09-10 05:00:07,317 INFO L78 Accepts]: Start accepts. Automaton has 8745 states and 13789 transitions. Word has length 159 [2019-09-10 05:00:07,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:00:07,318 INFO L475 AbstractCegarLoop]: Abstraction has 8745 states and 13789 transitions. [2019-09-10 05:00:07,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 05:00:07,322 INFO L276 IsEmpty]: Start isEmpty. Operand 8745 states and 13789 transitions. [2019-09-10 05:00:07,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 05:00:07,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:07,336 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:00:07,337 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:07,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:07,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1757376658, now seen corresponding path program 1 times [2019-09-10 05:00:07,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:07,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:07,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:07,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:07,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:07,535 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 05:00:07,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:07,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:00:07,536 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:07,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:00:07,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:00:07,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:00:07,538 INFO L87 Difference]: Start difference. First operand 8745 states and 13789 transitions. Second operand 6 states. [2019-09-10 05:00:10,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:00:10,342 INFO L93 Difference]: Finished difference Result 17374 states and 27371 transitions. [2019-09-10 05:00:10,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 05:00:10,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 160 [2019-09-10 05:00:10,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:00:10,480 INFO L225 Difference]: With dead ends: 17374 [2019-09-10 05:00:10,480 INFO L226 Difference]: Without dead ends: 17374 [2019-09-10 05:00:10,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 05:00:10,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17374 states. [2019-09-10 05:00:11,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17374 to 17218. [2019-09-10 05:00:11,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17218 states. [2019-09-10 05:00:11,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17218 states to 17218 states and 27183 transitions. [2019-09-10 05:00:11,112 INFO L78 Accepts]: Start accepts. Automaton has 17218 states and 27183 transitions. Word has length 160 [2019-09-10 05:00:11,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:00:11,113 INFO L475 AbstractCegarLoop]: Abstraction has 17218 states and 27183 transitions. [2019-09-10 05:00:11,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:00:11,113 INFO L276 IsEmpty]: Start isEmpty. Operand 17218 states and 27183 transitions. [2019-09-10 05:00:11,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 05:00:11,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:11,124 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:00:11,125 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:11,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:11,125 INFO L82 PathProgramCache]: Analyzing trace with hash 141600103, now seen corresponding path program 1 times [2019-09-10 05:00:11,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:11,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:11,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:11,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:11,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:11,404 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 05:00:11,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:11,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 05:00:11,405 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:11,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 05:00:11,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 05:00:11,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-10 05:00:11,407 INFO L87 Difference]: Start difference. First operand 17218 states and 27183 transitions. Second operand 11 states. [2019-09-10 05:00:19,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:00:19,534 INFO L93 Difference]: Finished difference Result 28770 states and 45862 transitions. [2019-09-10 05:00:19,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-10 05:00:19,535 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 161 [2019-09-10 05:00:19,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:00:19,668 INFO L225 Difference]: With dead ends: 28770 [2019-09-10 05:00:19,668 INFO L226 Difference]: Without dead ends: 28770 [2019-09-10 05:00:19,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=607, Invalid=2473, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 05:00:19,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28770 states. [2019-09-10 05:00:20,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28770 to 25974. [2019-09-10 05:00:20,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25974 states. [2019-09-10 05:00:20,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25974 states to 25974 states and 41015 transitions. [2019-09-10 05:00:20,902 INFO L78 Accepts]: Start accepts. Automaton has 25974 states and 41015 transitions. Word has length 161 [2019-09-10 05:00:20,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:00:20,904 INFO L475 AbstractCegarLoop]: Abstraction has 25974 states and 41015 transitions. [2019-09-10 05:00:20,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 05:00:20,904 INFO L276 IsEmpty]: Start isEmpty. Operand 25974 states and 41015 transitions. [2019-09-10 05:00:20,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 05:00:20,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:20,917 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:00:20,918 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:20,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:20,918 INFO L82 PathProgramCache]: Analyzing trace with hash -671538649, now seen corresponding path program 1 times [2019-09-10 05:00:20,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:20,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:20,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:20,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:20,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:21,215 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 05:00:21,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:21,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 05:00:21,215 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:21,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 05:00:21,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 05:00:21,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-10 05:00:21,217 INFO L87 Difference]: Start difference. First operand 25974 states and 41015 transitions. Second operand 11 states. [2019-09-10 05:00:30,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:00:30,052 INFO L93 Difference]: Finished difference Result 40876 states and 65240 transitions. [2019-09-10 05:00:30,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-10 05:00:30,053 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 161 [2019-09-10 05:00:30,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:00:30,207 INFO L225 Difference]: With dead ends: 40876 [2019-09-10 05:00:30,207 INFO L226 Difference]: Without dead ends: 40876 [2019-09-10 05:00:30,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=607, Invalid=2473, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 05:00:30,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40876 states. [2019-09-10 05:00:31,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40876 to 35896. [2019-09-10 05:00:31,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35896 states. [2019-09-10 05:00:31,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35896 states to 35896 states and 56891 transitions. [2019-09-10 05:00:31,187 INFO L78 Accepts]: Start accepts. Automaton has 35896 states and 56891 transitions. Word has length 161 [2019-09-10 05:00:31,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:00:31,188 INFO L475 AbstractCegarLoop]: Abstraction has 35896 states and 56891 transitions. [2019-09-10 05:00:31,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 05:00:31,188 INFO L276 IsEmpty]: Start isEmpty. Operand 35896 states and 56891 transitions. [2019-09-10 05:00:31,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 05:00:31,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:31,201 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:00:31,201 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:31,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:31,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1699484185, now seen corresponding path program 1 times [2019-09-10 05:00:31,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:31,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:31,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:31,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:31,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:31,421 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 05:00:31,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:31,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 05:00:31,423 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:31,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 05:00:31,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 05:00:31,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-10 05:00:31,424 INFO L87 Difference]: Start difference. First operand 35896 states and 56891 transitions. Second operand 11 states. [2019-09-10 05:00:40,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:00:40,907 INFO L93 Difference]: Finished difference Result 51464 states and 82135 transitions. [2019-09-10 05:00:40,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-10 05:00:40,909 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 161 [2019-09-10 05:00:40,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:00:41,102 INFO L225 Difference]: With dead ends: 51464 [2019-09-10 05:00:41,102 INFO L226 Difference]: Without dead ends: 51464 [2019-09-10 05:00:41,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1090 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=625, Invalid=2567, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 05:00:41,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51464 states. [2019-09-10 05:00:42,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51464 to 46484. [2019-09-10 05:00:42,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46484 states. [2019-09-10 05:00:42,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46484 states to 46484 states and 73741 transitions. [2019-09-10 05:00:42,123 INFO L78 Accepts]: Start accepts. Automaton has 46484 states and 73741 transitions. Word has length 161 [2019-09-10 05:00:42,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:00:42,124 INFO L475 AbstractCegarLoop]: Abstraction has 46484 states and 73741 transitions. [2019-09-10 05:00:42,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 05:00:42,124 INFO L276 IsEmpty]: Start isEmpty. Operand 46484 states and 73741 transitions. [2019-09-10 05:00:42,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 05:00:42,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:42,135 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:00:42,135 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:42,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:42,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1689565736, now seen corresponding path program 1 times [2019-09-10 05:00:42,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:42,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:42,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:42,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:42,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:43,378 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 05:00:43,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:43,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:00:43,378 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:43,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:00:43,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:00:43,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:00:43,380 INFO L87 Difference]: Start difference. First operand 46484 states and 73741 transitions. Second operand 6 states. [2019-09-10 05:00:45,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:00:45,998 INFO L93 Difference]: Finished difference Result 92556 states and 146663 transitions. [2019-09-10 05:00:46,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 05:00:46,000 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2019-09-10 05:00:46,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:00:46,278 INFO L225 Difference]: With dead ends: 92556 [2019-09-10 05:00:46,278 INFO L226 Difference]: Without dead ends: 92556 [2019-09-10 05:00:46,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 05:00:46,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92556 states. [2019-09-10 05:00:47,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92556 to 91932. [2019-09-10 05:00:47,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91932 states. [2019-09-10 05:00:47,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91932 states to 91932 states and 145795 transitions. [2019-09-10 05:00:47,895 INFO L78 Accepts]: Start accepts. Automaton has 91932 states and 145795 transitions. Word has length 161 [2019-09-10 05:00:47,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:00:47,896 INFO L475 AbstractCegarLoop]: Abstraction has 91932 states and 145795 transitions. [2019-09-10 05:00:47,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:00:47,896 INFO L276 IsEmpty]: Start isEmpty. Operand 91932 states and 145795 transitions. [2019-09-10 05:00:47,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 05:00:47,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:47,910 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:00:47,911 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:47,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:47,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1523949593, now seen corresponding path program 1 times [2019-09-10 05:00:47,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:47,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:47,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:47,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:47,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:48,124 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 05:00:48,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:48,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:00:48,125 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:48,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:00:48,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:00:48,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:00:48,128 INFO L87 Difference]: Start difference. First operand 91932 states and 145795 transitions. Second operand 6 states. [2019-09-10 05:00:50,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:00:50,017 INFO L93 Difference]: Finished difference Result 97374 states and 154932 transitions. [2019-09-10 05:00:50,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 05:00:50,019 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2019-09-10 05:00:50,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:00:50,299 INFO L225 Difference]: With dead ends: 97374 [2019-09-10 05:00:50,300 INFO L226 Difference]: Without dead ends: 97374 [2019-09-10 05:00:50,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 05:00:50,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97374 states. [2019-09-10 05:00:51,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97374 to 92164. [2019-09-10 05:00:51,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92164 states. [2019-09-10 05:00:52,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92164 states to 92164 states and 145795 transitions. [2019-09-10 05:00:52,004 INFO L78 Accepts]: Start accepts. Automaton has 92164 states and 145795 transitions. Word has length 161 [2019-09-10 05:00:52,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:00:52,005 INFO L475 AbstractCegarLoop]: Abstraction has 92164 states and 145795 transitions. [2019-09-10 05:00:52,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:00:52,005 INFO L276 IsEmpty]: Start isEmpty. Operand 92164 states and 145795 transitions. [2019-09-10 05:00:54,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-10 05:00:54,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:54,277 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:00:54,277 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:54,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:54,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1042735562, now seen corresponding path program 1 times [2019-09-10 05:00:54,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:54,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:54,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:54,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:54,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:54,460 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 05:00:54,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:54,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 05:00:54,461 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:54,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 05:00:54,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 05:00:54,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 05:00:54,463 INFO L87 Difference]: Start difference. First operand 92164 states and 145795 transitions. Second operand 7 states. [2019-09-10 05:00:56,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:00:56,956 INFO L93 Difference]: Finished difference Result 96692 states and 153678 transitions. [2019-09-10 05:00:56,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 05:00:56,957 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 162 [2019-09-10 05:00:56,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:00:57,214 INFO L225 Difference]: With dead ends: 96692 [2019-09-10 05:00:57,215 INFO L226 Difference]: Without dead ends: 96692 [2019-09-10 05:00:57,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 05:00:57,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96692 states. [2019-09-10 05:00:58,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96692 to 78362. [2019-09-10 05:00:58,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78362 states. [2019-09-10 05:00:58,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78362 states to 78362 states and 123947 transitions. [2019-09-10 05:00:58,895 INFO L78 Accepts]: Start accepts. Automaton has 78362 states and 123947 transitions. Word has length 162 [2019-09-10 05:00:58,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:00:58,895 INFO L475 AbstractCegarLoop]: Abstraction has 78362 states and 123947 transitions. [2019-09-10 05:00:58,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 05:00:58,895 INFO L276 IsEmpty]: Start isEmpty. Operand 78362 states and 123947 transitions. [2019-09-10 05:00:58,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-10 05:00:58,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:58,907 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:00:58,908 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:58,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:58,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1395823944, now seen corresponding path program 1 times [2019-09-10 05:00:58,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:58,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:58,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:58,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:58,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:59,130 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 05:00:59,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:59,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 05:00:59,131 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:59,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 05:00:59,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 05:00:59,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-10 05:00:59,132 INFO L87 Difference]: Start difference. First operand 78362 states and 123947 transitions. Second operand 12 states. [2019-09-10 05:01:09,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:01:09,904 INFO L93 Difference]: Finished difference Result 177072 states and 286432 transitions. [2019-09-10 05:01:09,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-10 05:01:09,905 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 162 [2019-09-10 05:01:09,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:01:10,582 INFO L225 Difference]: With dead ends: 177072 [2019-09-10 05:01:10,582 INFO L226 Difference]: Without dead ends: 177000 [2019-09-10 05:01:10,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=771, Invalid=2651, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 05:01:10,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177000 states. [2019-09-10 05:01:13,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177000 to 166722. [2019-09-10 05:01:13,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166722 states. [2019-09-10 05:01:13,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166722 states to 166722 states and 267964 transitions. [2019-09-10 05:01:13,581 INFO L78 Accepts]: Start accepts. Automaton has 166722 states and 267964 transitions. Word has length 162 [2019-09-10 05:01:13,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:01:13,582 INFO L475 AbstractCegarLoop]: Abstraction has 166722 states and 267964 transitions. [2019-09-10 05:01:13,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 05:01:13,582 INFO L276 IsEmpty]: Start isEmpty. Operand 166722 states and 267964 transitions. [2019-09-10 05:01:13,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-10 05:01:13,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:01:13,592 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:01:13,592 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:01:13,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:01:13,593 INFO L82 PathProgramCache]: Analyzing trace with hash 360887909, now seen corresponding path program 1 times [2019-09-10 05:01:13,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:01:13,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:01:13,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:01:13,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:01:13,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:01:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:01:16,753 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 05:01:16,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:01:16,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:01:16,754 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:01:16,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:01:16,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:01:16,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:01:16,755 INFO L87 Difference]: Start difference. First operand 166722 states and 267964 transitions. Second operand 6 states. [2019-09-10 05:01:19,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:01:19,905 INFO L93 Difference]: Finished difference Result 333205 states and 535262 transitions. [2019-09-10 05:01:19,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 05:01:19,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 162 [2019-09-10 05:01:19,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:01:20,828 INFO L225 Difference]: With dead ends: 333205 [2019-09-10 05:01:20,828 INFO L226 Difference]: Without dead ends: 333205 [2019-09-10 05:01:20,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 05:01:21,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333205 states. [2019-09-10 05:01:28,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333205 to 330994. [2019-09-10 05:01:28,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330994 states. [2019-09-10 05:01:29,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330994 states to 330994 states and 532040 transitions. [2019-09-10 05:01:29,259 INFO L78 Accepts]: Start accepts. Automaton has 330994 states and 532040 transitions. Word has length 162 [2019-09-10 05:01:29,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:01:29,260 INFO L475 AbstractCegarLoop]: Abstraction has 330994 states and 532040 transitions. [2019-09-10 05:01:29,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:01:29,260 INFO L276 IsEmpty]: Start isEmpty. Operand 330994 states and 532040 transitions. [2019-09-10 05:01:29,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-10 05:01:29,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:01:29,271 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:01:29,271 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:01:29,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:01:29,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1706567795, now seen corresponding path program 1 times [2019-09-10 05:01:29,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:01:29,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:01:29,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:01:29,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:01:29,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:01:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:01:29,484 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 05:01:29,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:01:29,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:01:29,485 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:01:29,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:01:29,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:01:29,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:01:29,486 INFO L87 Difference]: Start difference. First operand 330994 states and 532040 transitions. Second operand 6 states. [2019-09-10 05:01:37,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:01:37,409 INFO L93 Difference]: Finished difference Result 362319 states and 606232 transitions. [2019-09-10 05:01:37,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 05:01:37,411 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2019-09-10 05:01:37,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:01:38,694 INFO L225 Difference]: With dead ends: 362319 [2019-09-10 05:01:38,695 INFO L226 Difference]: Without dead ends: 362315 [2019-09-10 05:01:38,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 05:01:38,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362315 states. [2019-09-10 05:01:43,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362315 to 296317. [2019-09-10 05:01:43,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296317 states. [2019-09-10 05:01:44,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296317 states to 296317 states and 475916 transitions. [2019-09-10 05:01:44,550 INFO L78 Accepts]: Start accepts. Automaton has 296317 states and 475916 transitions. Word has length 163 [2019-09-10 05:01:44,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:01:44,551 INFO L475 AbstractCegarLoop]: Abstraction has 296317 states and 475916 transitions. [2019-09-10 05:01:44,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:01:44,551 INFO L276 IsEmpty]: Start isEmpty. Operand 296317 states and 475916 transitions. [2019-09-10 05:01:44,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-10 05:01:44,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:01:44,557 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:01:44,557 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:01:44,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:01:44,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1818161165, now seen corresponding path program 1 times [2019-09-10 05:01:44,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:01:44,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:01:44,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:01:44,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:01:44,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:01:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:01:44,805 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 05:01:44,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:01:44,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:01:44,806 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:01:44,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:01:44,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:01:44,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:01:44,807 INFO L87 Difference]: Start difference. First operand 296317 states and 475916 transitions. Second operand 6 states. [2019-09-10 05:01:51,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:01:51,782 INFO L93 Difference]: Finished difference Result 323705 states and 540008 transitions. [2019-09-10 05:01:51,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 05:01:51,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2019-09-10 05:01:51,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:01:52,935 INFO L225 Difference]: With dead ends: 323705 [2019-09-10 05:01:52,935 INFO L226 Difference]: Without dead ends: 323697 [2019-09-10 05:01:52,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 05:01:53,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323697 states. [2019-09-10 05:02:04,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323697 to 298635. [2019-09-10 05:02:04,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298635 states. [2019-09-10 05:02:05,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298635 states to 298635 states and 479238 transitions. [2019-09-10 05:02:05,333 INFO L78 Accepts]: Start accepts. Automaton has 298635 states and 479238 transitions. Word has length 163 [2019-09-10 05:02:05,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:02:05,334 INFO L475 AbstractCegarLoop]: Abstraction has 298635 states and 479238 transitions. [2019-09-10 05:02:05,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:02:05,334 INFO L276 IsEmpty]: Start isEmpty. Operand 298635 states and 479238 transitions. [2019-09-10 05:02:05,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-10 05:02:05,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:02:05,337 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:02:05,337 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:02:05,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:02:05,337 INFO L82 PathProgramCache]: Analyzing trace with hash -551243473, now seen corresponding path program 1 times [2019-09-10 05:02:05,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:02:05,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:02:05,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:02:05,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:02:05,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:02:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:02:05,506 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 05:02:05,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:02:05,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:02:05,506 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:02:05,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:02:05,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:02:05,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:02:05,508 INFO L87 Difference]: Start difference. First operand 298635 states and 479238 transitions. Second operand 6 states. [2019-09-10 05:02:15,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:02:15,546 INFO L93 Difference]: Finished difference Result 723529 states and 1164951 transitions. [2019-09-10 05:02:15,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 05:02:15,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2019-09-10 05:02:15,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:02:17,459 INFO L225 Difference]: With dead ends: 723529 [2019-09-10 05:02:17,460 INFO L226 Difference]: Without dead ends: 723529 [2019-09-10 05:02:17,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 05:02:17,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723529 states. [2019-09-10 05:02:27,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723529 to 553888. [2019-09-10 05:02:27,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553888 states. [2019-09-10 05:02:40,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553888 states to 553888 states and 892623 transitions. [2019-09-10 05:02:40,074 INFO L78 Accepts]: Start accepts. Automaton has 553888 states and 892623 transitions. Word has length 163 [2019-09-10 05:02:40,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:02:40,075 INFO L475 AbstractCegarLoop]: Abstraction has 553888 states and 892623 transitions. [2019-09-10 05:02:40,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:02:40,075 INFO L276 IsEmpty]: Start isEmpty. Operand 553888 states and 892623 transitions. [2019-09-10 05:02:40,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 05:02:40,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:02:40,077 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:02:40,077 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:02:40,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:02:40,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1283695039, now seen corresponding path program 1 times [2019-09-10 05:02:40,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:02:40,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:02:40,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:02:40,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:02:40,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:02:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:02:40,178 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 05:02:40,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:02:40,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 05:02:40,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:02:40,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 05:02:40,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 05:02:40,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 05:02:40,180 INFO L87 Difference]: Start difference. First operand 553888 states and 892623 transitions. Second operand 5 states. [2019-09-10 05:02:53,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:02:53,074 INFO L93 Difference]: Finished difference Result 965304 states and 1566250 transitions. [2019-09-10 05:02:53,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 05:02:53,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 164 [2019-09-10 05:02:53,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:02:56,668 INFO L225 Difference]: With dead ends: 965304 [2019-09-10 05:02:56,668 INFO L226 Difference]: Without dead ends: 965304 [2019-09-10 05:02:56,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 05:02:57,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965304 states. [2019-09-10 05:03:16,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965304 to 958854. [2019-09-10 05:03:16,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958854 states. [2019-09-10 05:03:44,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958854 states to 958854 states and 1552932 transitions. [2019-09-10 05:03:44,450 INFO L78 Accepts]: Start accepts. Automaton has 958854 states and 1552932 transitions. Word has length 164 [2019-09-10 05:03:44,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:03:44,450 INFO L475 AbstractCegarLoop]: Abstraction has 958854 states and 1552932 transitions. [2019-09-10 05:03:44,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 05:03:44,451 INFO L276 IsEmpty]: Start isEmpty. Operand 958854 states and 1552932 transitions. [2019-09-10 05:03:44,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 05:03:44,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:03:44,454 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:03:44,454 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:03:44,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:03:44,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1625068863, now seen corresponding path program 1 times [2019-09-10 05:03:44,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:03:44,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:03:44,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:03:44,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:03:44,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:03:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:03:44,696 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 05:03:44,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:03:44,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 05:03:44,697 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:03:44,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 05:03:44,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 05:03:44,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-10 05:03:44,699 INFO L87 Difference]: Start difference. First operand 958854 states and 1552932 transitions. Second operand 12 states. [2019-09-10 05:04:14,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:04:14,122 INFO L93 Difference]: Finished difference Result 1581631 states and 2569090 transitions. [2019-09-10 05:04:14,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-10 05:04:14,122 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 164 [2019-09-10 05:04:14,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:04:19,625 INFO L225 Difference]: With dead ends: 1581631 [2019-09-10 05:04:19,625 INFO L226 Difference]: Without dead ends: 1581631 [2019-09-10 05:04:19,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=771, Invalid=2651, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 05:04:20,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581631 states. [2019-09-10 05:05:01,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581631 to 1562688. [2019-09-10 05:05:01,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1562688 states.