java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:52:48,653 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:52:48,655 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:52:48,667 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:52:48,667 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:52:48,668 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:52:48,669 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:52:48,671 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:52:48,673 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:52:48,673 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:52:48,674 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:52:48,675 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:52:48,676 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:52:48,677 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:52:48,677 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:52:48,679 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:52:48,679 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:52:48,680 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:52:48,682 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:52:48,684 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:52:48,685 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:52:48,686 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:52:48,687 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:52:48,688 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:52:48,690 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:52:48,690 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:52:48,690 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:52:48,691 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:52:48,692 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:52:48,693 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:52:48,693 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:52:48,694 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:52:48,694 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:52:48,695 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:52:48,696 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:52:48,696 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:52:48,697 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:52:48,697 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:52:48,697 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:52:48,698 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:52:48,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:52:48,699 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 08:52:48,714 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:52:48,714 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:52:48,714 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:52:48,714 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:52:48,715 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:52:48,715 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:52:48,715 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:52:48,716 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:52:48,716 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:52:48,716 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:52:48,717 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:52:48,717 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:52:48,717 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:52:48,717 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:52:48,717 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:52:48,718 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:52:48,718 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:52:48,718 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:52:48,718 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:52:48,718 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:52:48,719 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:52:48,719 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:52:48,719 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:52:48,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:52:48,719 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:52:48,720 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:52:48,720 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:52:48,720 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:52:48,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:52:48,720 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:52:48,747 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:52:48,759 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:52:48,762 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:52:48,763 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:52:48,763 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:52:48,764 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 08:52:48,827 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d61d5559/798e54cde6074ea8b3c7cc6f8db539c3/FLAG133176825 [2019-09-10 08:52:49,444 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:52:49,445 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 08:52:49,459 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d61d5559/798e54cde6074ea8b3c7cc6f8db539c3/FLAG133176825 [2019-09-10 08:52:49,664 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d61d5559/798e54cde6074ea8b3c7cc6f8db539c3 [2019-09-10 08:52:49,676 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:52:49,678 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:52:49,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:52:49,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:52:49,686 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:52:49,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:52:49" (1/1) ... [2019-09-10 08:52:49,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16572f88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:52:49, skipping insertion in model container [2019-09-10 08:52:49,690 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:52:49" (1/1) ... [2019-09-10 08:52:49,698 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:52:49,799 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:52:50,631 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:52:50,660 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:52:50,984 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:52:51,019 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:52:51,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:52:51 WrapperNode [2019-09-10 08:52:51,020 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:52:51,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:52:51,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:52:51,021 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:52:51,036 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:52:51" (1/1) ... [2019-09-10 08:52:51,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:52:51" (1/1) ... [2019-09-10 08:52:51,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:52:51" (1/1) ... [2019-09-10 08:52:51,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:52:51" (1/1) ... [2019-09-10 08:52:51,143 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:52:51" (1/1) ... [2019-09-10 08:52:51,163 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:52:51" (1/1) ... [2019-09-10 08:52:51,169 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:52:51" (1/1) ... [2019-09-10 08:52:51,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:52:51,185 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:52:51,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:52:51,186 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:52:51,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:52:51" (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 08:52:51,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:52:51,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:52:51,257 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:52:51,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:52:51,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:52:51,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:52:51,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:52:51,258 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:52:51,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:52:51,259 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:52:51,261 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:52:51,261 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:52:51,262 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:52:51,262 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:52:51,262 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:52:51,262 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:52:51,263 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:52:51,263 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:52:51,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:52:51,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:52:53,389 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:52:53,390 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:52:53,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:52:53 BoogieIcfgContainer [2019-09-10 08:52:53,391 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:52:53,393 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:52:53,393 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:52:53,396 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:52:53,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:52:49" (1/3) ... [2019-09-10 08:52:53,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ed02d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:52:53, skipping insertion in model container [2019-09-10 08:52:53,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:52:51" (2/3) ... [2019-09-10 08:52:53,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ed02d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:52:53, skipping insertion in model container [2019-09-10 08:52:53,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:52:53" (3/3) ... [2019-09-10 08:52:53,401 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 08:52:53,412 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:52:53,423 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:52:53,444 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:52:53,471 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:52:53,471 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:52:53,471 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:52:53,472 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:52:53,472 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:52:53,472 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:52:53,472 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:52:53,472 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:52:53,508 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states. [2019-09-10 08:52:53,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-10 08:52:53,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:53,571 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:53,574 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:53,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:53,582 INFO L82 PathProgramCache]: Analyzing trace with hash -625555481, now seen corresponding path program 1 times [2019-09-10 08:52:53,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:53,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:53,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:53,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:53,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:54,516 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 08:52:54,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:54,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:52:54,519 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:54,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:52:54,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:52:54,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:54,544 INFO L87 Difference]: Start difference. First operand 652 states. Second operand 3 states. [2019-09-10 08:52:54,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:54,794 INFO L93 Difference]: Finished difference Result 1007 states and 1770 transitions. [2019-09-10 08:52:54,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:54,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 254 [2019-09-10 08:52:54,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:54,819 INFO L225 Difference]: With dead ends: 1007 [2019-09-10 08:52:54,819 INFO L226 Difference]: Without dead ends: 999 [2019-09-10 08:52:54,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:54,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2019-09-10 08:52:54,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 997. [2019-09-10 08:52:54,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-09-10 08:52:54,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1568 transitions. [2019-09-10 08:52:54,979 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1568 transitions. Word has length 254 [2019-09-10 08:52:54,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:54,981 INFO L475 AbstractCegarLoop]: Abstraction has 997 states and 1568 transitions. [2019-09-10 08:52:54,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:52:54,981 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1568 transitions. [2019-09-10 08:52:54,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-10 08:52:54,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:54,991 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:54,991 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:54,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:54,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1696085954, now seen corresponding path program 1 times [2019-09-10 08:52:54,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:54,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:54,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:54,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:54,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:55,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:52:55,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:55,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:52:55,646 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:55,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:52:55,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:52:55,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:52:55,649 INFO L87 Difference]: Start difference. First operand 997 states and 1568 transitions. Second operand 4 states. [2019-09-10 08:52:55,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:55,803 INFO L93 Difference]: Finished difference Result 1950 states and 3047 transitions. [2019-09-10 08:52:55,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:52:55,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 254 [2019-09-10 08:52:55,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:55,815 INFO L225 Difference]: With dead ends: 1950 [2019-09-10 08:52:55,816 INFO L226 Difference]: Without dead ends: 1950 [2019-09-10 08:52:55,817 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:52:55,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2019-09-10 08:52:55,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1948. [2019-09-10 08:52:55,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1948 states. [2019-09-10 08:52:55,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1948 states to 1948 states and 3046 transitions. [2019-09-10 08:52:55,869 INFO L78 Accepts]: Start accepts. Automaton has 1948 states and 3046 transitions. Word has length 254 [2019-09-10 08:52:55,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:55,870 INFO L475 AbstractCegarLoop]: Abstraction has 1948 states and 3046 transitions. [2019-09-10 08:52:55,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:52:55,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1948 states and 3046 transitions. [2019-09-10 08:52:55,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-10 08:52:55,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:55,877 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:55,877 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:55,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:55,878 INFO L82 PathProgramCache]: Analyzing trace with hash 721618672, now seen corresponding path program 1 times [2019-09-10 08:52:55,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:55,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:55,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:55,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:55,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:56,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 08:52:56,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:56,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:52:56,131 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:56,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:52:56,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:52:56,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:56,135 INFO L87 Difference]: Start difference. First operand 1948 states and 3046 transitions. Second operand 3 states. [2019-09-10 08:52:56,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:56,292 INFO L93 Difference]: Finished difference Result 3820 states and 5940 transitions. [2019-09-10 08:52:56,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:56,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2019-09-10 08:52:56,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:56,321 INFO L225 Difference]: With dead ends: 3820 [2019-09-10 08:52:56,322 INFO L226 Difference]: Without dead ends: 3820 [2019-09-10 08:52:56,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:56,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3820 states. [2019-09-10 08:52:56,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3820 to 3818. [2019-09-10 08:52:56,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3818 states. [2019-09-10 08:52:56,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3818 states to 3818 states and 5939 transitions. [2019-09-10 08:52:56,423 INFO L78 Accepts]: Start accepts. Automaton has 3818 states and 5939 transitions. Word has length 256 [2019-09-10 08:52:56,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:56,423 INFO L475 AbstractCegarLoop]: Abstraction has 3818 states and 5939 transitions. [2019-09-10 08:52:56,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:52:56,424 INFO L276 IsEmpty]: Start isEmpty. Operand 3818 states and 5939 transitions. [2019-09-10 08:52:56,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-10 08:52:56,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:56,433 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:56,434 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:56,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:56,434 INFO L82 PathProgramCache]: Analyzing trace with hash -2042478027, now seen corresponding path program 1 times [2019-09-10 08:52:56,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:56,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:56,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:56,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:56,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:56,553 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 08:52:56,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:56,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:52:56,554 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:56,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:52:56,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:52:56,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:56,555 INFO L87 Difference]: Start difference. First operand 3818 states and 5939 transitions. Second operand 3 states. [2019-09-10 08:52:56,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:56,637 INFO L93 Difference]: Finished difference Result 7603 states and 11818 transitions. [2019-09-10 08:52:56,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:56,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2019-09-10 08:52:56,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:56,673 INFO L225 Difference]: With dead ends: 7603 [2019-09-10 08:52:56,673 INFO L226 Difference]: Without dead ends: 7603 [2019-09-10 08:52:56,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:56,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7603 states. [2019-09-10 08:52:56,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7603 to 3837. [2019-09-10 08:52:56,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3837 states. [2019-09-10 08:52:56,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3837 states to 3837 states and 5967 transitions. [2019-09-10 08:52:56,818 INFO L78 Accepts]: Start accepts. Automaton has 3837 states and 5967 transitions. Word has length 256 [2019-09-10 08:52:56,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:56,819 INFO L475 AbstractCegarLoop]: Abstraction has 3837 states and 5967 transitions. [2019-09-10 08:52:56,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:52:56,819 INFO L276 IsEmpty]: Start isEmpty. Operand 3837 states and 5967 transitions. [2019-09-10 08:52:56,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-10 08:52:56,828 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:56,829 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:56,829 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:56,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:56,830 INFO L82 PathProgramCache]: Analyzing trace with hash 911178296, now seen corresponding path program 1 times [2019-09-10 08:52:56,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:56,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:56,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:56,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:56,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:56,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:56,991 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 08:52:56,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:56,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:52:56,992 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:56,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:52:56,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:52:56,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:56,994 INFO L87 Difference]: Start difference. First operand 3837 states and 5967 transitions. Second operand 3 states. [2019-09-10 08:52:57,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:57,077 INFO L93 Difference]: Finished difference Result 7621 states and 11839 transitions. [2019-09-10 08:52:57,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:57,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2019-09-10 08:52:57,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:57,112 INFO L225 Difference]: With dead ends: 7621 [2019-09-10 08:52:57,112 INFO L226 Difference]: Without dead ends: 7621 [2019-09-10 08:52:57,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:57,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7621 states. [2019-09-10 08:52:57,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7621 to 3855. [2019-09-10 08:52:57,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3855 states. [2019-09-10 08:52:57,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3855 states to 3855 states and 5988 transitions. [2019-09-10 08:52:57,217 INFO L78 Accepts]: Start accepts. Automaton has 3855 states and 5988 transitions. Word has length 257 [2019-09-10 08:52:57,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:57,218 INFO L475 AbstractCegarLoop]: Abstraction has 3855 states and 5988 transitions. [2019-09-10 08:52:57,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:52:57,218 INFO L276 IsEmpty]: Start isEmpty. Operand 3855 states and 5988 transitions. [2019-09-10 08:52:57,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-10 08:52:57,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:57,227 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:57,228 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:57,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:57,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1063620725, now seen corresponding path program 1 times [2019-09-10 08:52:57,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:57,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:57,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:57,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:57,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:57,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:52:57,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:57,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:52:57,559 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:57,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:52:57,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:52:57,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:57,560 INFO L87 Difference]: Start difference. First operand 3855 states and 5988 transitions. Second operand 3 states. [2019-09-10 08:52:57,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:57,668 INFO L93 Difference]: Finished difference Result 7468 states and 11517 transitions. [2019-09-10 08:52:57,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:57,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2019-09-10 08:52:57,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:57,697 INFO L225 Difference]: With dead ends: 7468 [2019-09-10 08:52:57,697 INFO L226 Difference]: Without dead ends: 7468 [2019-09-10 08:52:57,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:57,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7468 states. [2019-09-10 08:52:57,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7468 to 7466. [2019-09-10 08:52:57,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2019-09-10 08:52:57,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 11516 transitions. [2019-09-10 08:52:57,833 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 11516 transitions. Word has length 258 [2019-09-10 08:52:57,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:57,834 INFO L475 AbstractCegarLoop]: Abstraction has 7466 states and 11516 transitions. [2019-09-10 08:52:57,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:52:57,834 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 11516 transitions. [2019-09-10 08:52:57,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-10 08:52:57,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:57,849 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:57,849 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:57,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:57,850 INFO L82 PathProgramCache]: Analyzing trace with hash 33763368, now seen corresponding path program 1 times [2019-09-10 08:52:57,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:57,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:57,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:57,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:57,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:58,212 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 08:52:58,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:58,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:52:58,213 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:58,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:52:58,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:52:58,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:52:58,214 INFO L87 Difference]: Start difference. First operand 7466 states and 11516 transitions. Second operand 4 states. [2019-09-10 08:52:58,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:58,318 INFO L93 Difference]: Finished difference Result 13738 states and 21096 transitions. [2019-09-10 08:52:58,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:52:58,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 258 [2019-09-10 08:52:58,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:58,347 INFO L225 Difference]: With dead ends: 13738 [2019-09-10 08:52:58,347 INFO L226 Difference]: Without dead ends: 13738 [2019-09-10 08:52:58,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:52:58,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13738 states. [2019-09-10 08:52:58,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13738 to 7701. [2019-09-10 08:52:58,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7701 states. [2019-09-10 08:52:58,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7701 states to 7701 states and 11904 transitions. [2019-09-10 08:52:58,514 INFO L78 Accepts]: Start accepts. Automaton has 7701 states and 11904 transitions. Word has length 258 [2019-09-10 08:52:58,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:58,514 INFO L475 AbstractCegarLoop]: Abstraction has 7701 states and 11904 transitions. [2019-09-10 08:52:58,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:52:58,515 INFO L276 IsEmpty]: Start isEmpty. Operand 7701 states and 11904 transitions. [2019-09-10 08:52:58,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-10 08:52:58,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:58,529 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:58,529 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:58,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:58,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1740963393, now seen corresponding path program 1 times [2019-09-10 08:52:58,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:58,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:58,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:58,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:58,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:58,653 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 08:52:58,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:58,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:52:58,653 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:58,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:52:58,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:52:58,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:58,655 INFO L87 Difference]: Start difference. First operand 7701 states and 11904 transitions. Second operand 3 states. [2019-09-10 08:52:58,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:58,750 INFO L93 Difference]: Finished difference Result 11111 states and 17325 transitions. [2019-09-10 08:52:58,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:58,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2019-09-10 08:52:58,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:58,773 INFO L225 Difference]: With dead ends: 11111 [2019-09-10 08:52:58,773 INFO L226 Difference]: Without dead ends: 11111 [2019-09-10 08:52:58,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:58,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11111 states. [2019-09-10 08:52:58,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11111 to 9685. [2019-09-10 08:52:58,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9685 states. [2019-09-10 08:52:58,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9685 states to 9685 states and 15180 transitions. [2019-09-10 08:52:58,974 INFO L78 Accepts]: Start accepts. Automaton has 9685 states and 15180 transitions. Word has length 258 [2019-09-10 08:52:58,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:58,974 INFO L475 AbstractCegarLoop]: Abstraction has 9685 states and 15180 transitions. [2019-09-10 08:52:58,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:52:58,974 INFO L276 IsEmpty]: Start isEmpty. Operand 9685 states and 15180 transitions. [2019-09-10 08:52:58,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-10 08:52:58,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:58,991 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:58,993 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:58,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:58,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1667579256, now seen corresponding path program 1 times [2019-09-10 08:52:58,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:58,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:58,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:58,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:58,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:59,135 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 08:52:59,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:59,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:52:59,135 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:59,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:52:59,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:52:59,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:59,137 INFO L87 Difference]: Start difference. First operand 9685 states and 15180 transitions. Second operand 3 states. [2019-09-10 08:52:59,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:59,234 INFO L93 Difference]: Finished difference Result 14527 states and 22961 transitions. [2019-09-10 08:52:59,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:59,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-09-10 08:52:59,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:59,265 INFO L225 Difference]: With dead ends: 14527 [2019-09-10 08:52:59,266 INFO L226 Difference]: Without dead ends: 14527 [2019-09-10 08:52:59,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:59,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14527 states. [2019-09-10 08:52:59,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14527 to 13261. [2019-09-10 08:52:59,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13261 states. [2019-09-10 08:52:59,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13261 states to 13261 states and 21064 transitions. [2019-09-10 08:52:59,490 INFO L78 Accepts]: Start accepts. Automaton has 13261 states and 21064 transitions. Word has length 260 [2019-09-10 08:52:59,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:59,491 INFO L475 AbstractCegarLoop]: Abstraction has 13261 states and 21064 transitions. [2019-09-10 08:52:59,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:52:59,492 INFO L276 IsEmpty]: Start isEmpty. Operand 13261 states and 21064 transitions. [2019-09-10 08:52:59,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-10 08:52:59,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:59,510 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:59,510 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:59,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:59,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1902966007, now seen corresponding path program 1 times [2019-09-10 08:52:59,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:59,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:59,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:59,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:59,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:59,755 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 08:52:59,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:59,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:52:59,755 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:59,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:52:59,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:52:59,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:59,757 INFO L87 Difference]: Start difference. First operand 13261 states and 21064 transitions. Second operand 3 states. [2019-09-10 08:52:59,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:59,851 INFO L93 Difference]: Finished difference Result 25755 states and 40772 transitions. [2019-09-10 08:52:59,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:59,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-09-10 08:52:59,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:59,895 INFO L225 Difference]: With dead ends: 25755 [2019-09-10 08:52:59,896 INFO L226 Difference]: Without dead ends: 25755 [2019-09-10 08:52:59,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:59,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25755 states. [2019-09-10 08:53:00,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25755 to 13365. [2019-09-10 08:53:00,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13365 states. [2019-09-10 08:53:00,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13365 states to 13365 states and 21207 transitions. [2019-09-10 08:53:00,214 INFO L78 Accepts]: Start accepts. Automaton has 13365 states and 21207 transitions. Word has length 260 [2019-09-10 08:53:00,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:00,215 INFO L475 AbstractCegarLoop]: Abstraction has 13365 states and 21207 transitions. [2019-09-10 08:53:00,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:53:00,215 INFO L276 IsEmpty]: Start isEmpty. Operand 13365 states and 21207 transitions. [2019-09-10 08:53:00,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-10 08:53:00,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:00,231 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:00,232 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:00,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:00,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1132182754, now seen corresponding path program 1 times [2019-09-10 08:53:00,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:00,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:00,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:00,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:00,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:00,342 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 08:53:00,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:00,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:53:00,342 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:00,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:53:00,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:53:00,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:00,343 INFO L87 Difference]: Start difference. First operand 13365 states and 21207 transitions. Second operand 3 states. [2019-09-10 08:53:00,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:00,473 INFO L93 Difference]: Finished difference Result 25880 states and 40918 transitions. [2019-09-10 08:53:00,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:53:00,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-09-10 08:53:00,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:00,515 INFO L225 Difference]: With dead ends: 25880 [2019-09-10 08:53:00,516 INFO L226 Difference]: Without dead ends: 25880 [2019-09-10 08:53:00,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:00,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25880 states. [2019-09-10 08:53:00,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25880 to 13490. [2019-09-10 08:53:00,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13490 states. [2019-09-10 08:53:00,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13490 states to 13490 states and 21353 transitions. [2019-09-10 08:53:00,863 INFO L78 Accepts]: Start accepts. Automaton has 13490 states and 21353 transitions. Word has length 261 [2019-09-10 08:53:00,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:00,863 INFO L475 AbstractCegarLoop]: Abstraction has 13490 states and 21353 transitions. [2019-09-10 08:53:00,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:53:00,864 INFO L276 IsEmpty]: Start isEmpty. Operand 13490 states and 21353 transitions. [2019-09-10 08:53:00,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-10 08:53:00,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:00,877 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:00,878 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:00,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:00,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1032258475, now seen corresponding path program 1 times [2019-09-10 08:53:00,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:00,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:00,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:00,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:00,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:01,202 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 08:53:01,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:01,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:53:01,202 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:01,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:53:01,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:53:01,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:53:01,204 INFO L87 Difference]: Start difference. First operand 13490 states and 21353 transitions. Second operand 5 states. [2019-09-10 08:53:01,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:01,753 INFO L93 Difference]: Finished difference Result 13492 states and 21274 transitions. [2019-09-10 08:53:01,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:53:01,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 261 [2019-09-10 08:53:01,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:01,771 INFO L225 Difference]: With dead ends: 13492 [2019-09-10 08:53:01,774 INFO L226 Difference]: Without dead ends: 13492 [2019-09-10 08:53:01,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:53:01,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13492 states. [2019-09-10 08:53:01,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13492 to 13490. [2019-09-10 08:53:01,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13490 states. [2019-09-10 08:53:01,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13490 states to 13490 states and 21273 transitions. [2019-09-10 08:53:01,954 INFO L78 Accepts]: Start accepts. Automaton has 13490 states and 21273 transitions. Word has length 261 [2019-09-10 08:53:01,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:01,955 INFO L475 AbstractCegarLoop]: Abstraction has 13490 states and 21273 transitions. [2019-09-10 08:53:01,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:53:01,955 INFO L276 IsEmpty]: Start isEmpty. Operand 13490 states and 21273 transitions. [2019-09-10 08:53:01,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-10 08:53:01,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:01,968 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:01,969 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:01,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:01,969 INFO L82 PathProgramCache]: Analyzing trace with hash -2103562182, now seen corresponding path program 1 times [2019-09-10 08:53:01,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:01,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:01,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:01,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:01,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:02,536 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 08:53:02,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:02,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:53:02,538 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:02,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:53:02,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:53:02,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:53:02,541 INFO L87 Difference]: Start difference. First operand 13490 states and 21273 transitions. Second operand 9 states. [2019-09-10 08:53:03,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:03,860 INFO L93 Difference]: Finished difference Result 31326 states and 49019 transitions. [2019-09-10 08:53:03,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:53:03,860 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 261 [2019-09-10 08:53:03,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:03,893 INFO L225 Difference]: With dead ends: 31326 [2019-09-10 08:53:03,893 INFO L226 Difference]: Without dead ends: 31326 [2019-09-10 08:53:03,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:53:03,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31326 states. [2019-09-10 08:53:04,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31326 to 16942. [2019-09-10 08:53:04,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16942 states. [2019-09-10 08:53:04,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16942 states to 16942 states and 26257 transitions. [2019-09-10 08:53:04,807 INFO L78 Accepts]: Start accepts. Automaton has 16942 states and 26257 transitions. Word has length 261 [2019-09-10 08:53:04,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:04,807 INFO L475 AbstractCegarLoop]: Abstraction has 16942 states and 26257 transitions. [2019-09-10 08:53:04,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:53:04,807 INFO L276 IsEmpty]: Start isEmpty. Operand 16942 states and 26257 transitions. [2019-09-10 08:53:04,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-10 08:53:04,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:04,820 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:04,820 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:04,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:04,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1561382285, now seen corresponding path program 1 times [2019-09-10 08:53:04,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:04,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:04,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:04,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:04,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:05,236 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 08:53:05,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:05,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:53:05,236 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:05,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:53:05,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:53:05,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:53:05,238 INFO L87 Difference]: Start difference. First operand 16942 states and 26257 transitions. Second operand 4 states. [2019-09-10 08:53:05,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:05,415 INFO L93 Difference]: Finished difference Result 32933 states and 50829 transitions. [2019-09-10 08:53:05,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:53:05,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2019-09-10 08:53:05,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:05,458 INFO L225 Difference]: With dead ends: 32933 [2019-09-10 08:53:05,459 INFO L226 Difference]: Without dead ends: 32933 [2019-09-10 08:53:05,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:53:05,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32933 states. [2019-09-10 08:53:05,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32933 to 32931. [2019-09-10 08:53:05,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32931 states. [2019-09-10 08:53:05,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32931 states to 32931 states and 50828 transitions. [2019-09-10 08:53:05,874 INFO L78 Accepts]: Start accepts. Automaton has 32931 states and 50828 transitions. Word has length 261 [2019-09-10 08:53:05,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:05,874 INFO L475 AbstractCegarLoop]: Abstraction has 32931 states and 50828 transitions. [2019-09-10 08:53:05,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:53:05,874 INFO L276 IsEmpty]: Start isEmpty. Operand 32931 states and 50828 transitions. [2019-09-10 08:53:05,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-10 08:53:05,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:05,898 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:05,898 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:05,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:05,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1771744488, now seen corresponding path program 1 times [2019-09-10 08:53:05,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:05,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:05,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:05,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:05,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:06,252 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 08:53:06,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:06,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:53:06,253 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:06,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:53:06,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:53:06,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:06,256 INFO L87 Difference]: Start difference. First operand 32931 states and 50828 transitions. Second operand 3 states. [2019-09-10 08:53:06,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:06,424 INFO L93 Difference]: Finished difference Result 64027 states and 98384 transitions. [2019-09-10 08:53:06,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:53:06,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-09-10 08:53:06,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:06,487 INFO L225 Difference]: With dead ends: 64027 [2019-09-10 08:53:06,487 INFO L226 Difference]: Without dead ends: 64027 [2019-09-10 08:53:06,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:06,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64027 states. [2019-09-10 08:53:06,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64027 to 64025. [2019-09-10 08:53:06,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64025 states. [2019-09-10 08:53:07,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64025 states to 64025 states and 98383 transitions. [2019-09-10 08:53:07,056 INFO L78 Accepts]: Start accepts. Automaton has 64025 states and 98383 transitions. Word has length 263 [2019-09-10 08:53:07,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:07,057 INFO L475 AbstractCegarLoop]: Abstraction has 64025 states and 98383 transitions. [2019-09-10 08:53:07,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:53:07,057 INFO L276 IsEmpty]: Start isEmpty. Operand 64025 states and 98383 transitions. [2019-09-10 08:53:07,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-10 08:53:07,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:07,075 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:07,075 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:07,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:07,076 INFO L82 PathProgramCache]: Analyzing trace with hash -475137260, now seen corresponding path program 1 times [2019-09-10 08:53:07,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:07,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:07,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:07,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:07,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:08,493 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 08:53:08,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:08,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:53:08,494 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:08,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:53:08,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:53:08,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:53:08,495 INFO L87 Difference]: Start difference. First operand 64025 states and 98383 transitions. Second operand 4 states. [2019-09-10 08:53:08,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:08,699 INFO L93 Difference]: Finished difference Result 61017 states and 93690 transitions. [2019-09-10 08:53:08,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:53:08,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 264 [2019-09-10 08:53:08,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:08,826 INFO L225 Difference]: With dead ends: 61017 [2019-09-10 08:53:08,826 INFO L226 Difference]: Without dead ends: 57863 [2019-09-10 08:53:08,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:53:08,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57863 states. [2019-09-10 08:53:09,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57863 to 57787. [2019-09-10 08:53:09,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57787 states. [2019-09-10 08:53:09,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57787 states to 57787 states and 88748 transitions. [2019-09-10 08:53:09,449 INFO L78 Accepts]: Start accepts. Automaton has 57787 states and 88748 transitions. Word has length 264 [2019-09-10 08:53:09,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:09,449 INFO L475 AbstractCegarLoop]: Abstraction has 57787 states and 88748 transitions. [2019-09-10 08:53:09,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:53:09,450 INFO L276 IsEmpty]: Start isEmpty. Operand 57787 states and 88748 transitions. [2019-09-10 08:53:09,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-10 08:53:09,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:09,473 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:09,474 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:09,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:09,474 INFO L82 PathProgramCache]: Analyzing trace with hash -927753442, now seen corresponding path program 1 times [2019-09-10 08:53:09,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:09,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:09,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:09,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:09,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:09,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:09,812 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 08:53:09,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:09,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:53:09,813 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:09,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:53:09,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:53:09,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:09,814 INFO L87 Difference]: Start difference. First operand 57787 states and 88748 transitions. Second operand 3 states. [2019-09-10 08:53:10,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:10,033 INFO L93 Difference]: Finished difference Result 94453 states and 145933 transitions. [2019-09-10 08:53:10,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:53:10,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 264 [2019-09-10 08:53:10,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:10,203 INFO L225 Difference]: With dead ends: 94453 [2019-09-10 08:53:10,203 INFO L226 Difference]: Without dead ends: 94453 [2019-09-10 08:53:10,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:10,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94453 states. [2019-09-10 08:53:12,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94453 to 88035. [2019-09-10 08:53:12,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88035 states. [2019-09-10 08:53:12,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88035 states to 88035 states and 136200 transitions. [2019-09-10 08:53:12,858 INFO L78 Accepts]: Start accepts. Automaton has 88035 states and 136200 transitions. Word has length 264 [2019-09-10 08:53:12,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:12,859 INFO L475 AbstractCegarLoop]: Abstraction has 88035 states and 136200 transitions. [2019-09-10 08:53:12,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:53:12,859 INFO L276 IsEmpty]: Start isEmpty. Operand 88035 states and 136200 transitions. [2019-09-10 08:53:12,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-10 08:53:12,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:12,884 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:12,884 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:12,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:12,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1867808595, now seen corresponding path program 1 times [2019-09-10 08:53:12,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:12,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:12,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:12,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:12,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:13,141 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 08:53:13,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:13,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:53:13,142 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:13,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:53:13,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:53:13,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:13,144 INFO L87 Difference]: Start difference. First operand 88035 states and 136200 transitions. Second operand 3 states. [2019-09-10 08:53:13,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:13,540 INFO L93 Difference]: Finished difference Result 172872 states and 266092 transitions. [2019-09-10 08:53:13,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:53:13,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2019-09-10 08:53:13,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:13,781 INFO L225 Difference]: With dead ends: 172872 [2019-09-10 08:53:13,781 INFO L226 Difference]: Without dead ends: 172872 [2019-09-10 08:53:13,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:13,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172872 states. [2019-09-10 08:53:15,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172872 to 172870. [2019-09-10 08:53:15,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172870 states. [2019-09-10 08:53:19,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172870 states to 172870 states and 266091 transitions. [2019-09-10 08:53:19,221 INFO L78 Accepts]: Start accepts. Automaton has 172870 states and 266091 transitions. Word has length 265 [2019-09-10 08:53:19,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:19,222 INFO L475 AbstractCegarLoop]: Abstraction has 172870 states and 266091 transitions. [2019-09-10 08:53:19,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:53:19,222 INFO L276 IsEmpty]: Start isEmpty. Operand 172870 states and 266091 transitions. [2019-09-10 08:53:19,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-10 08:53:19,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:19,251 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:19,251 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:19,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:19,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1633445328, now seen corresponding path program 1 times [2019-09-10 08:53:19,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:19,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:19,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:19,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:19,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:19,533 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 08:53:19,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:19,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:53:19,534 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:19,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:53:19,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:53:19,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:53:19,538 INFO L87 Difference]: Start difference. First operand 172870 states and 266091 transitions. Second operand 4 states. [2019-09-10 08:53:20,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:20,400 INFO L93 Difference]: Finished difference Result 298870 states and 458689 transitions. [2019-09-10 08:53:20,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:53:20,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 265 [2019-09-10 08:53:20,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:20,757 INFO L225 Difference]: With dead ends: 298870 [2019-09-10 08:53:20,757 INFO L226 Difference]: Without dead ends: 298870 [2019-09-10 08:53:20,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:53:20,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298870 states. [2019-09-10 08:53:26,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298870 to 169090. [2019-09-10 08:53:26,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169090 states. [2019-09-10 08:53:26,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169090 states to 169090 states and 260147 transitions. [2019-09-10 08:53:26,557 INFO L78 Accepts]: Start accepts. Automaton has 169090 states and 260147 transitions. Word has length 265 [2019-09-10 08:53:26,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:26,557 INFO L475 AbstractCegarLoop]: Abstraction has 169090 states and 260147 transitions. [2019-09-10 08:53:26,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:53:26,557 INFO L276 IsEmpty]: Start isEmpty. Operand 169090 states and 260147 transitions. [2019-09-10 08:53:26,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-10 08:53:26,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:26,587 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:26,588 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:26,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:26,588 INFO L82 PathProgramCache]: Analyzing trace with hash 341064440, now seen corresponding path program 1 times [2019-09-10 08:53:26,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:26,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:26,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:26,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:26,589 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:26,718 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 08:53:26,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:26,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:53:26,718 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:26,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:53:26,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:53:26,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:26,720 INFO L87 Difference]: Start difference. First operand 169090 states and 260147 transitions. Second operand 3 states. [2019-09-10 08:53:27,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:27,427 INFO L93 Difference]: Finished difference Result 295070 states and 457571 transitions. [2019-09-10 08:53:27,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:53:27,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 267 [2019-09-10 08:53:27,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:27,758 INFO L225 Difference]: With dead ends: 295070 [2019-09-10 08:53:27,758 INFO L226 Difference]: Without dead ends: 295070 [2019-09-10 08:53:27,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:28,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295070 states. [2019-09-10 08:53:33,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295070 to 270708. [2019-09-10 08:53:33,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270708 states. [2019-09-10 08:53:34,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270708 states to 270708 states and 422976 transitions. [2019-09-10 08:53:34,345 INFO L78 Accepts]: Start accepts. Automaton has 270708 states and 422976 transitions. Word has length 267 [2019-09-10 08:53:34,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:34,346 INFO L475 AbstractCegarLoop]: Abstraction has 270708 states and 422976 transitions. [2019-09-10 08:53:34,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:53:34,346 INFO L276 IsEmpty]: Start isEmpty. Operand 270708 states and 422976 transitions. [2019-09-10 08:53:34,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-10 08:53:34,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:34,382 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:34,382 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:34,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:34,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1490717262, now seen corresponding path program 1 times [2019-09-10 08:53:34,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:34,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:34,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:34,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:34,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:35,571 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 08:53:35,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:35,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:53:35,572 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:35,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:53:35,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:53:35,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:53:35,573 INFO L87 Difference]: Start difference. First operand 270708 states and 422976 transitions. Second operand 4 states. [2019-09-10 08:53:36,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:36,727 INFO L93 Difference]: Finished difference Result 510065 states and 793272 transitions. [2019-09-10 08:53:36,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:53:36,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 268 [2019-09-10 08:53:36,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:37,408 INFO L225 Difference]: With dead ends: 510065 [2019-09-10 08:53:37,408 INFO L226 Difference]: Without dead ends: 510065 [2019-09-10 08:53:37,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:53:37,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510065 states. [2019-09-10 08:53:47,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510065 to 510063. [2019-09-10 08:53:47,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510063 states. [2019-09-10 08:53:48,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510063 states to 510063 states and 793271 transitions. [2019-09-10 08:53:48,800 INFO L78 Accepts]: Start accepts. Automaton has 510063 states and 793271 transitions. Word has length 268 [2019-09-10 08:53:48,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:48,800 INFO L475 AbstractCegarLoop]: Abstraction has 510063 states and 793271 transitions. [2019-09-10 08:53:48,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:53:48,800 INFO L276 IsEmpty]: Start isEmpty. Operand 510063 states and 793271 transitions. [2019-09-10 08:53:48,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-10 08:53:48,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:48,857 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:48,857 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:48,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:48,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1388182148, now seen corresponding path program 1 times [2019-09-10 08:53:48,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:48,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:48,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:48,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:48,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:48,965 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 08:53:48,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:48,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:53:48,965 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:48,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:53:48,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:53:48,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:48,967 INFO L87 Difference]: Start difference. First operand 510063 states and 793271 transitions. Second operand 3 states. [2019-09-10 08:53:57,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:57,719 INFO L93 Difference]: Finished difference Result 871148 states and 1352495 transitions. [2019-09-10 08:53:57,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:53:57,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 269 [2019-09-10 08:53:57,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:58,943 INFO L225 Difference]: With dead ends: 871148 [2019-09-10 08:53:58,943 INFO L226 Difference]: Without dead ends: 871148 [2019-09-10 08:53:58,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:59,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871148 states. [2019-09-10 08:54:14,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871148 to 510862. [2019-09-10 08:54:14,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510862 states. [2019-09-10 08:54:15,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510862 states to 510862 states and 794258 transitions. [2019-09-10 08:54:15,555 INFO L78 Accepts]: Start accepts. Automaton has 510862 states and 794258 transitions. Word has length 269 [2019-09-10 08:54:15,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:15,555 INFO L475 AbstractCegarLoop]: Abstraction has 510862 states and 794258 transitions. [2019-09-10 08:54:15,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:54:15,555 INFO L276 IsEmpty]: Start isEmpty. Operand 510862 states and 794258 transitions. [2019-09-10 08:54:15,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-09-10 08:54:15,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:15,620 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:15,621 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:15,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:15,621 INFO L82 PathProgramCache]: Analyzing trace with hash -408395274, now seen corresponding path program 1 times [2019-09-10 08:54:15,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:15,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:15,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:15,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:15,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:15,819 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 08:54:15,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:15,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:15,820 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:15,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:15,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:15,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:15,822 INFO L87 Difference]: Start difference. First operand 510862 states and 794258 transitions. Second operand 3 states. [2019-09-10 08:54:28,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:28,536 INFO L93 Difference]: Finished difference Result 1002462 states and 1552752 transitions. [2019-09-10 08:54:28,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:28,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 270 [2019-09-10 08:54:28,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:30,211 INFO L225 Difference]: With dead ends: 1002462 [2019-09-10 08:54:30,211 INFO L226 Difference]: Without dead ends: 1002462 [2019-09-10 08:54:30,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:30,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002462 states. [2019-09-10 08:54:53,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002462 to 1002156. [2019-09-10 08:54:53,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002156 states. [2019-09-10 08:55:06,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002156 states to 1002156 states and 1552371 transitions. [2019-09-10 08:55:06,371 INFO L78 Accepts]: Start accepts. Automaton has 1002156 states and 1552371 transitions. Word has length 270 [2019-09-10 08:55:06,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:06,371 INFO L475 AbstractCegarLoop]: Abstraction has 1002156 states and 1552371 transitions. [2019-09-10 08:55:06,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:06,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1002156 states and 1552371 transitions. [2019-09-10 08:55:06,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-09-10 08:55:06,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:06,491 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:55:06,491 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:06,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:06,492 INFO L82 PathProgramCache]: Analyzing trace with hash 336811379, now seen corresponding path program 1 times [2019-09-10 08:55:06,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:06,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:06,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:06,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:06,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:06,744 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 08:55:06,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:06,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:55:06,744 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:06,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:55:06,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:55:06,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:55:06,746 INFO L87 Difference]: Start difference. First operand 1002156 states and 1552371 transitions. Second operand 4 states. [2019-09-10 08:55:10,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:10,744 INFO L93 Difference]: Finished difference Result 904050 states and 1396903 transitions. [2019-09-10 08:55:10,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:55:10,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 271 [2019-09-10 08:55:10,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:13,501 INFO L225 Difference]: With dead ends: 904050 [2019-09-10 08:55:13,501 INFO L226 Difference]: Without dead ends: 887869 [2019-09-10 08:55:13,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:55:14,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887869 states. [2019-09-10 08:55:32,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887869 to 886651. [2019-09-10 08:55:32,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886651 states. [2019-09-10 08:55:35,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886651 states to 886651 states and 1370754 transitions. [2019-09-10 08:55:35,629 INFO L78 Accepts]: Start accepts. Automaton has 886651 states and 1370754 transitions. Word has length 271 [2019-09-10 08:55:35,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:35,629 INFO L475 AbstractCegarLoop]: Abstraction has 886651 states and 1370754 transitions. [2019-09-10 08:55:35,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:55:35,629 INFO L276 IsEmpty]: Start isEmpty. Operand 886651 states and 1370754 transitions. [2019-09-10 08:55:35,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-09-10 08:55:35,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:35,738 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:55:35,738 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:35,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:35,739 INFO L82 PathProgramCache]: Analyzing trace with hash -168643119, now seen corresponding path program 1 times [2019-09-10 08:55:35,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:35,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:35,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:35,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:35,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:35,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:47,385 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 08:55:47,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:47,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:47,386 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:47,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:47,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:47,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:47,387 INFO L87 Difference]: Start difference. First operand 886651 states and 1370754 transitions. Second operand 3 states. [2019-09-10 08:55:53,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:53,296 INFO L93 Difference]: Finished difference Result 1740393 states and 2675974 transitions. [2019-09-10 08:55:53,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:53,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 272 [2019-09-10 08:55:53,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:55,887 INFO L225 Difference]: With dead ends: 1740393 [2019-09-10 08:55:55,887 INFO L226 Difference]: Without dead ends: 1740393 [2019-09-10 08:55:55,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:58,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1740393 states. [2019-09-10 08:56:43,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1740393 to 1740391. [2019-09-10 08:56:43,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1740391 states.