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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/systemc/transmitter.06.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:29:55,595 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:29:55,597 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:29:55,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:29:55,616 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:29:55,618 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:29:55,620 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:29:55,632 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:29:55,634 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:29:55,634 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:29:55,635 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:29:55,636 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:29:55,637 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:29:55,638 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:29:55,639 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:29:55,641 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:29:55,642 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:29:55,642 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:29:55,644 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:29:55,647 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:29:55,651 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:29:55,652 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:29:55,653 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:29:55,654 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:29:55,657 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:29:55,658 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:29:55,658 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:29:55,660 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:29:55,660 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:29:55,663 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:29:55,663 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:29:55,665 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:29:55,665 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:29:55,666 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:29:55,669 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:29:55,670 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:29:55,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:29:55,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:29:55,671 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:29:55,672 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:29:55,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:29:55,674 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:29:55,688 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:29:55,688 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:29:55,689 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:29:55,690 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:29:55,690 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:29:55,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:29:55,690 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:29:55,691 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:29:55,691 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:29:55,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:29:55,691 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:29:55,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:29:55,692 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:29:55,692 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:29:55,692 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:29:55,692 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:29:55,692 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:29:55,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:29:55,693 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:29:55,693 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:29:55,693 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:29:55,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:29:55,694 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:29:55,694 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:29:55,694 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:29:55,694 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:29:55,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:29:55,695 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:29:55,695 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:29:55,984 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:29:56,001 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:29:56,004 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:29:56,006 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:29:56,006 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:29:56,007 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.06.cil.c [2019-10-13 21:29:56,069 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fce5a9d9/9459d709a3724758af8cfebcfc0bbd5a/FLAG8d97805b7 [2019-10-13 21:29:56,548 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:29:56,548 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.06.cil.c [2019-10-13 21:29:56,560 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fce5a9d9/9459d709a3724758af8cfebcfc0bbd5a/FLAG8d97805b7 [2019-10-13 21:29:56,904 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fce5a9d9/9459d709a3724758af8cfebcfc0bbd5a [2019-10-13 21:29:56,914 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:29:56,916 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:29:56,917 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:29:56,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:29:56,920 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:29:56,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:29:56" (1/1) ... [2019-10-13 21:29:56,925 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7de122ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:56, skipping insertion in model container [2019-10-13 21:29:56,925 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:29:56" (1/1) ... [2019-10-13 21:29:56,933 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:29:56,987 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:29:57,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:29:57,269 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:29:57,424 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:29:57,455 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:29:57,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:57 WrapperNode [2019-10-13 21:29:57,456 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:29:57,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:29:57,457 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:29:57,457 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:29:57,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:57" (1/1) ... [2019-10-13 21:29:57,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:57" (1/1) ... [2019-10-13 21:29:57,478 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:57" (1/1) ... [2019-10-13 21:29:57,478 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:57" (1/1) ... [2019-10-13 21:29:57,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:57" (1/1) ... [2019-10-13 21:29:57,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:57" (1/1) ... [2019-10-13 21:29:57,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:57" (1/1) ... [2019-10-13 21:29:57,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:29:57,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:29:57,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:29:57,519 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:29:57,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:57" (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-10-13 21:29:57,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:29:57,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:29:57,579 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-13 21:29:57,580 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-13 21:29:57,580 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-13 21:29:57,580 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-10-13 21:29:57,580 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-10-13 21:29:57,581 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-10-13 21:29:57,581 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-10-13 21:29:57,582 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit6 [2019-10-13 21:29:57,582 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-13 21:29:57,582 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-13 21:29:57,582 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-10-13 21:29:57,583 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-10-13 21:29:57,583 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-10-13 21:29:57,583 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-10-13 21:29:57,585 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit6_triggered [2019-10-13 21:29:57,585 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-13 21:29:57,585 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-13 21:29:57,585 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-13 21:29:57,586 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-13 21:29:57,586 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-13 21:29:57,586 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-13 21:29:57,586 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-13 21:29:57,586 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-13 21:29:57,586 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-13 21:29:57,586 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-13 21:29:57,587 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-13 21:29:57,587 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-13 21:29:57,587 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-13 21:29:57,587 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:29:57,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:29:57,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:29:57,588 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-13 21:29:57,588 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-13 21:29:57,588 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-13 21:29:57,588 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-10-13 21:29:57,589 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-10-13 21:29:57,589 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-10-13 21:29:57,589 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-10-13 21:29:57,589 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit6_triggered [2019-10-13 21:29:57,589 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-13 21:29:57,589 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-13 21:29:57,590 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-13 21:29:57,590 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-10-13 21:29:57,590 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-10-13 21:29:57,590 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-10-13 21:29:57,590 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-10-13 21:29:57,590 INFO L130 BoogieDeclarations]: Found specification of procedure transmit6 [2019-10-13 21:29:57,590 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-13 21:29:57,591 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-13 21:29:57,591 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-13 21:29:57,591 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-13 21:29:57,591 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-13 21:29:57,591 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-13 21:29:57,591 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-13 21:29:57,592 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-13 21:29:57,592 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-13 21:29:57,592 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-13 21:29:57,592 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-13 21:29:57,592 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-13 21:29:57,592 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:29:57,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:29:57,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:29:58,410 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:29:58,411 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:29:58,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:29:58 BoogieIcfgContainer [2019-10-13 21:29:58,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:29:58,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:29:58,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:29:58,416 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:29:58,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:29:56" (1/3) ... [2019-10-13 21:29:58,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7367ef84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:29:58, skipping insertion in model container [2019-10-13 21:29:58,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:57" (2/3) ... [2019-10-13 21:29:58,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7367ef84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:29:58, skipping insertion in model container [2019-10-13 21:29:58,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:29:58" (3/3) ... [2019-10-13 21:29:58,421 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.06.cil.c [2019-10-13 21:29:58,431 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:29:58,439 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:29:58,450 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:29:58,478 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:29:58,478 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:29:58,479 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:29:58,479 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:29:58,479 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:29:58,479 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:29:58,479 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:29:58,480 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:29:58,507 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states. [2019-10-13 21:29:58,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:29:58,523 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:58,525 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:58,527 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:58,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:58,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1616556766, now seen corresponding path program 1 times [2019-10-13 21:29:58,542 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:58,542 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685498191] [2019-10-13 21:29:58,543 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:58,543 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:58,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:58,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:58,994 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685498191] [2019-10-13 21:29:58,995 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:58,995 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:29:58,996 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536261566] [2019-10-13 21:29:59,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:29:59,003 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:59,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:29:59,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:29:59,020 INFO L87 Difference]: Start difference. First operand 289 states. Second operand 4 states. [2019-10-13 21:29:59,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:59,337 INFO L93 Difference]: Finished difference Result 556 states and 834 transitions. [2019-10-13 21:29:59,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:29:59,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-10-13 21:29:59,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:59,355 INFO L225 Difference]: With dead ends: 556 [2019-10-13 21:29:59,356 INFO L226 Difference]: Without dead ends: 280 [2019-10-13 21:29:59,362 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:29:59,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-10-13 21:29:59,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2019-10-13 21:29:59,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-13 21:29:59,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 396 transitions. [2019-10-13 21:29:59,443 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 396 transitions. Word has length 150 [2019-10-13 21:29:59,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:59,446 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 396 transitions. [2019-10-13 21:29:59,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:29:59,447 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 396 transitions. [2019-10-13 21:29:59,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:29:59,457 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:59,457 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:59,458 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:59,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:59,459 INFO L82 PathProgramCache]: Analyzing trace with hash -668504800, now seen corresponding path program 1 times [2019-10-13 21:29:59,459 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:59,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892040820] [2019-10-13 21:29:59,460 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:59,462 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:59,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:59,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:59,729 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892040820] [2019-10-13 21:29:59,730 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:59,731 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:59,739 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289221468] [2019-10-13 21:29:59,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:59,745 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:59,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:59,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:59,746 INFO L87 Difference]: Start difference. First operand 280 states and 396 transitions. Second operand 5 states. [2019-10-13 21:30:00,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:30:00,475 INFO L93 Difference]: Finished difference Result 580 states and 842 transitions. [2019-10-13 21:30:00,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:30:00,476 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-13 21:30:00,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:30:00,480 INFO L225 Difference]: With dead ends: 580 [2019-10-13 21:30:00,480 INFO L226 Difference]: Without dead ends: 324 [2019-10-13 21:30:00,482 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:30:00,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-10-13 21:30:00,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 280. [2019-10-13 21:30:00,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-13 21:30:00,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 395 transitions. [2019-10-13 21:30:00,516 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 395 transitions. Word has length 150 [2019-10-13 21:30:00,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:30:00,516 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 395 transitions. [2019-10-13 21:30:00,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:30:00,517 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 395 transitions. [2019-10-13 21:30:00,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:30:00,519 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:30:00,520 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:30:00,520 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:30:00,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:30:00,520 INFO L82 PathProgramCache]: Analyzing trace with hash 278533086, now seen corresponding path program 1 times [2019-10-13 21:30:00,520 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:30:00,521 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33087839] [2019-10-13 21:30:00,521 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:00,521 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:00,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:30:00,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:00,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:30:00,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33087839] [2019-10-13 21:30:00,685 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:30:00,685 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:30:00,685 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463168991] [2019-10-13 21:30:00,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:30:00,689 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:30:00,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:30:00,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:30:00,690 INFO L87 Difference]: Start difference. First operand 280 states and 395 transitions. Second operand 5 states. [2019-10-13 21:30:01,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:30:01,252 INFO L93 Difference]: Finished difference Result 580 states and 841 transitions. [2019-10-13 21:30:01,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:30:01,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-13 21:30:01,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:30:01,259 INFO L225 Difference]: With dead ends: 580 [2019-10-13 21:30:01,259 INFO L226 Difference]: Without dead ends: 324 [2019-10-13 21:30:01,261 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:30:01,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-10-13 21:30:01,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 280. [2019-10-13 21:30:01,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-13 21:30:01,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 394 transitions. [2019-10-13 21:30:01,307 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 394 transitions. Word has length 150 [2019-10-13 21:30:01,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:30:01,308 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 394 transitions. [2019-10-13 21:30:01,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:30:01,308 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 394 transitions. [2019-10-13 21:30:01,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:30:01,311 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:30:01,311 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:30:01,311 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:30:01,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:30:01,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1140366688, now seen corresponding path program 1 times [2019-10-13 21:30:01,312 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:30:01,312 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922070814] [2019-10-13 21:30:01,312 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:01,312 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:01,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:30:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:01,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:30:01,413 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922070814] [2019-10-13 21:30:01,414 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:30:01,414 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:30:01,414 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728649052] [2019-10-13 21:30:01,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:30:01,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:30:01,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:30:01,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:30:01,416 INFO L87 Difference]: Start difference. First operand 280 states and 394 transitions. Second operand 5 states. [2019-10-13 21:30:01,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:30:01,976 INFO L93 Difference]: Finished difference Result 578 states and 835 transitions. [2019-10-13 21:30:01,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:30:01,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-13 21:30:01,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:30:01,980 INFO L225 Difference]: With dead ends: 578 [2019-10-13 21:30:01,980 INFO L226 Difference]: Without dead ends: 322 [2019-10-13 21:30:01,982 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:30:01,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-10-13 21:30:02,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 280. [2019-10-13 21:30:02,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-13 21:30:02,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 393 transitions. [2019-10-13 21:30:02,014 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 393 transitions. Word has length 150 [2019-10-13 21:30:02,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:30:02,015 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 393 transitions. [2019-10-13 21:30:02,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:30:02,015 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 393 transitions. [2019-10-13 21:30:02,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:30:02,017 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:30:02,017 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:30:02,018 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:30:02,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:30:02,018 INFO L82 PathProgramCache]: Analyzing trace with hash -910042210, now seen corresponding path program 1 times [2019-10-13 21:30:02,018 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:30:02,020 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717987291] [2019-10-13 21:30:02,020 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:02,020 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:02,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:30:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:02,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:30:02,143 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717987291] [2019-10-13 21:30:02,143 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:30:02,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:30:02,144 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466048181] [2019-10-13 21:30:02,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:30:02,146 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:30:02,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:30:02,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:30:02,151 INFO L87 Difference]: Start difference. First operand 280 states and 393 transitions. Second operand 5 states. [2019-10-13 21:30:02,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:30:02,684 INFO L93 Difference]: Finished difference Result 576 states and 829 transitions. [2019-10-13 21:30:02,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:30:02,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-13 21:30:02,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:30:02,688 INFO L225 Difference]: With dead ends: 576 [2019-10-13 21:30:02,688 INFO L226 Difference]: Without dead ends: 320 [2019-10-13 21:30:02,690 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:30:02,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-13 21:30:02,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 280. [2019-10-13 21:30:02,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-13 21:30:02,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 392 transitions. [2019-10-13 21:30:02,711 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 392 transitions. Word has length 150 [2019-10-13 21:30:02,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:30:02,711 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 392 transitions. [2019-10-13 21:30:02,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:30:02,711 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 392 transitions. [2019-10-13 21:30:02,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:30:02,713 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:30:02,714 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:30:02,714 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:30:02,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:30:02,714 INFO L82 PathProgramCache]: Analyzing trace with hash -421995104, now seen corresponding path program 1 times [2019-10-13 21:30:02,714 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:30:02,715 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762372278] [2019-10-13 21:30:02,715 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:02,715 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:02,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:30:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:02,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:30:02,793 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762372278] [2019-10-13 21:30:02,793 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:30:02,793 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:30:02,794 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693601017] [2019-10-13 21:30:02,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:30:02,794 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:30:02,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:30:02,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:30:02,795 INFO L87 Difference]: Start difference. First operand 280 states and 392 transitions. Second operand 5 states. [2019-10-13 21:30:03,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:30:03,313 INFO L93 Difference]: Finished difference Result 574 states and 823 transitions. [2019-10-13 21:30:03,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:30:03,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-13 21:30:03,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:30:03,317 INFO L225 Difference]: With dead ends: 574 [2019-10-13 21:30:03,317 INFO L226 Difference]: Without dead ends: 318 [2019-10-13 21:30:03,318 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:30:03,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-10-13 21:30:03,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 280. [2019-10-13 21:30:03,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-13 21:30:03,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 391 transitions. [2019-10-13 21:30:03,338 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 391 transitions. Word has length 150 [2019-10-13 21:30:03,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:30:03,339 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 391 transitions. [2019-10-13 21:30:03,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:30:03,339 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 391 transitions. [2019-10-13 21:30:03,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:30:03,341 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:30:03,341 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:30:03,342 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:30:03,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:30:03,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1514630306, now seen corresponding path program 1 times [2019-10-13 21:30:03,342 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:30:03,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540948299] [2019-10-13 21:30:03,343 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:03,343 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:03,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:30:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:03,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:30:03,429 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540948299] [2019-10-13 21:30:03,429 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:30:03,430 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:30:03,430 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715543888] [2019-10-13 21:30:03,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:30:03,431 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:30:03,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:30:03,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:30:03,432 INFO L87 Difference]: Start difference. First operand 280 states and 391 transitions. Second operand 5 states. [2019-10-13 21:30:04,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:30:04,066 INFO L93 Difference]: Finished difference Result 570 states and 813 transitions. [2019-10-13 21:30:04,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:30:04,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-13 21:30:04,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:30:04,069 INFO L225 Difference]: With dead ends: 570 [2019-10-13 21:30:04,069 INFO L226 Difference]: Without dead ends: 314 [2019-10-13 21:30:04,070 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:30:04,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-10-13 21:30:04,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 280. [2019-10-13 21:30:04,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-13 21:30:04,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 390 transitions. [2019-10-13 21:30:04,091 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 390 transitions. Word has length 150 [2019-10-13 21:30:04,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:30:04,092 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 390 transitions. [2019-10-13 21:30:04,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:30:04,092 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 390 transitions. [2019-10-13 21:30:04,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:30:04,094 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:30:04,094 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:30:04,095 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:30:04,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:30:04,095 INFO L82 PathProgramCache]: Analyzing trace with hash 937861276, now seen corresponding path program 1 times [2019-10-13 21:30:04,095 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:30:04,096 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632032981] [2019-10-13 21:30:04,096 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:04,096 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:04,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:30:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:04,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:30:04,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632032981] [2019-10-13 21:30:04,170 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:30:04,170 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:30:04,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626106883] [2019-10-13 21:30:04,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:30:04,171 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:30:04,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:30:04,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:30:04,171 INFO L87 Difference]: Start difference. First operand 280 states and 390 transitions. Second operand 5 states. [2019-10-13 21:30:04,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:30:04,741 INFO L93 Difference]: Finished difference Result 599 states and 863 transitions. [2019-10-13 21:30:04,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:30:04,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-13 21:30:04,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:30:04,745 INFO L225 Difference]: With dead ends: 599 [2019-10-13 21:30:04,745 INFO L226 Difference]: Without dead ends: 343 [2019-10-13 21:30:04,746 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:30:04,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-10-13 21:30:04,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 280. [2019-10-13 21:30:04,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-13 21:30:04,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 389 transitions. [2019-10-13 21:30:04,770 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 389 transitions. Word has length 150 [2019-10-13 21:30:04,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:30:04,770 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 389 transitions. [2019-10-13 21:30:04,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:30:04,771 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 389 transitions. [2019-10-13 21:30:04,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:30:04,772 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:30:04,773 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:30:04,773 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:30:04,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:30:04,773 INFO L82 PathProgramCache]: Analyzing trace with hash -784141410, now seen corresponding path program 1 times [2019-10-13 21:30:04,773 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:30:04,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306358023] [2019-10-13 21:30:04,774 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:04,774 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:04,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:30:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:04,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:30:04,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306358023] [2019-10-13 21:30:04,897 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:30:04,897 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:30:04,897 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830629907] [2019-10-13 21:30:04,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:30:04,898 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:30:04,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:30:04,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:30:04,898 INFO L87 Difference]: Start difference. First operand 280 states and 389 transitions. Second operand 5 states. [2019-10-13 21:30:05,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:30:05,390 INFO L93 Difference]: Finished difference Result 597 states and 857 transitions. [2019-10-13 21:30:05,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:30:05,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-13 21:30:05,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:30:05,395 INFO L225 Difference]: With dead ends: 597 [2019-10-13 21:30:05,395 INFO L226 Difference]: Without dead ends: 341 [2019-10-13 21:30:05,396 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:30:05,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-10-13 21:30:05,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 280. [2019-10-13 21:30:05,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-13 21:30:05,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 388 transitions. [2019-10-13 21:30:05,420 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 388 transitions. Word has length 150 [2019-10-13 21:30:05,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:30:05,420 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 388 transitions. [2019-10-13 21:30:05,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:30:05,420 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 388 transitions. [2019-10-13 21:30:05,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:30:05,422 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:30:05,423 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:30:05,423 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:30:05,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:30:05,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1116784548, now seen corresponding path program 1 times [2019-10-13 21:30:05,423 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:30:05,424 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768353389] [2019-10-13 21:30:05,424 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:05,424 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:05,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:30:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:05,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:30:05,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768353389] [2019-10-13 21:30:05,502 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:30:05,502 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:30:05,503 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091069345] [2019-10-13 21:30:05,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:30:05,504 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:30:05,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:30:05,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:30:05,504 INFO L87 Difference]: Start difference. First operand 280 states and 388 transitions. Second operand 5 states. [2019-10-13 21:30:06,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:30:06,047 INFO L93 Difference]: Finished difference Result 595 states and 851 transitions. [2019-10-13 21:30:06,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:30:06,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-13 21:30:06,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:30:06,050 INFO L225 Difference]: With dead ends: 595 [2019-10-13 21:30:06,050 INFO L226 Difference]: Without dead ends: 339 [2019-10-13 21:30:06,051 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:30:06,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-10-13 21:30:06,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 280. [2019-10-13 21:30:06,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-13 21:30:06,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 387 transitions. [2019-10-13 21:30:06,076 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 387 transitions. Word has length 150 [2019-10-13 21:30:06,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:30:06,076 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 387 transitions. [2019-10-13 21:30:06,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:30:06,076 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 387 transitions. [2019-10-13 21:30:06,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:30:06,078 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:30:06,078 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:30:06,078 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:30:06,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:30:06,079 INFO L82 PathProgramCache]: Analyzing trace with hash 812147678, now seen corresponding path program 1 times [2019-10-13 21:30:06,079 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:30:06,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556715873] [2019-10-13 21:30:06,079 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:06,080 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:06,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:30:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:06,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:30:06,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556715873] [2019-10-13 21:30:06,150 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:30:06,150 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:30:06,151 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854292747] [2019-10-13 21:30:06,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:30:06,151 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:30:06,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:30:06,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:30:06,152 INFO L87 Difference]: Start difference. First operand 280 states and 387 transitions. Second operand 5 states. [2019-10-13 21:30:06,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:30:06,633 INFO L93 Difference]: Finished difference Result 593 states and 845 transitions. [2019-10-13 21:30:06,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:30:06,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-13 21:30:06,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:30:06,636 INFO L225 Difference]: With dead ends: 593 [2019-10-13 21:30:06,637 INFO L226 Difference]: Without dead ends: 337 [2019-10-13 21:30:06,638 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:30:06,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-10-13 21:30:06,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 280. [2019-10-13 21:30:06,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-13 21:30:06,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 386 transitions. [2019-10-13 21:30:06,665 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 386 transitions. Word has length 150 [2019-10-13 21:30:06,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:30:06,666 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 386 transitions. [2019-10-13 21:30:06,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:30:06,666 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 386 transitions. [2019-10-13 21:30:06,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:30:06,667 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:30:06,668 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:30:06,668 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:30:06,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:30:06,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1480933348, now seen corresponding path program 1 times [2019-10-13 21:30:06,669 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:30:06,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552103526] [2019-10-13 21:30:06,669 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:06,669 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:06,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:30:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:06,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:30:06,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552103526] [2019-10-13 21:30:06,772 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:30:06,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:30:06,773 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911917208] [2019-10-13 21:30:06,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:30:06,773 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:30:06,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:30:06,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:30:06,774 INFO L87 Difference]: Start difference. First operand 280 states and 386 transitions. Second operand 5 states. [2019-10-13 21:30:07,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:30:07,511 INFO L93 Difference]: Finished difference Result 591 states and 839 transitions. [2019-10-13 21:30:07,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:30:07,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-13 21:30:07,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:30:07,514 INFO L225 Difference]: With dead ends: 591 [2019-10-13 21:30:07,515 INFO L226 Difference]: Without dead ends: 335 [2019-10-13 21:30:07,516 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:30:07,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-10-13 21:30:07,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 280. [2019-10-13 21:30:07,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-13 21:30:07,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 385 transitions. [2019-10-13 21:30:07,554 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 385 transitions. Word has length 150 [2019-10-13 21:30:07,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:30:07,555 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 385 transitions. [2019-10-13 21:30:07,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:30:07,555 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 385 transitions. [2019-10-13 21:30:07,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:30:07,558 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:30:07,559 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:30:07,559 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:30:07,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:30:07,559 INFO L82 PathProgramCache]: Analyzing trace with hash 246211614, now seen corresponding path program 1 times [2019-10-13 21:30:07,560 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:30:07,560 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300290950] [2019-10-13 21:30:07,560 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:07,560 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:07,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:30:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:07,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:30:07,643 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300290950] [2019-10-13 21:30:07,643 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:30:07,643 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:30:07,643 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954211297] [2019-10-13 21:30:07,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:30:07,644 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:30:07,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:30:07,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:30:07,645 INFO L87 Difference]: Start difference. First operand 280 states and 385 transitions. Second operand 5 states. [2019-10-13 21:30:08,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:30:08,139 INFO L93 Difference]: Finished difference Result 589 states and 833 transitions. [2019-10-13 21:30:08,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:30:08,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-13 21:30:08,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:30:08,143 INFO L225 Difference]: With dead ends: 589 [2019-10-13 21:30:08,143 INFO L226 Difference]: Without dead ends: 333 [2019-10-13 21:30:08,145 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:30:08,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-10-13 21:30:08,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 280. [2019-10-13 21:30:08,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-13 21:30:08,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 384 transitions. [2019-10-13 21:30:08,183 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 384 transitions. Word has length 150 [2019-10-13 21:30:08,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:30:08,184 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 384 transitions. [2019-10-13 21:30:08,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:30:08,184 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 384 transitions. [2019-10-13 21:30:08,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:30:08,186 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:30:08,187 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:30:08,187 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:30:08,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:30:08,188 INFO L82 PathProgramCache]: Analyzing trace with hash 717567964, now seen corresponding path program 1 times [2019-10-13 21:30:08,188 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:30:08,188 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415494274] [2019-10-13 21:30:08,188 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:08,189 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:08,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:30:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:08,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:30:08,304 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415494274] [2019-10-13 21:30:08,305 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:30:08,305 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:30:08,305 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758780907] [2019-10-13 21:30:08,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:30:08,307 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:30:08,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:30:08,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:30:08,308 INFO L87 Difference]: Start difference. First operand 280 states and 384 transitions. Second operand 4 states. [2019-10-13 21:30:08,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:30:08,683 INFO L93 Difference]: Finished difference Result 782 states and 1109 transitions. [2019-10-13 21:30:08,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:30:08,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-10-13 21:30:08,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:30:08,689 INFO L225 Difference]: With dead ends: 782 [2019-10-13 21:30:08,689 INFO L226 Difference]: Without dead ends: 527 [2019-10-13 21:30:08,692 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:30:08,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-10-13 21:30:08,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 522. [2019-10-13 21:30:08,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2019-10-13 21:30:08,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 716 transitions. [2019-10-13 21:30:08,782 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 716 transitions. Word has length 150 [2019-10-13 21:30:08,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:30:08,782 INFO L462 AbstractCegarLoop]: Abstraction has 522 states and 716 transitions. [2019-10-13 21:30:08,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:30:08,782 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 716 transitions. [2019-10-13 21:30:08,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:30:08,785 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:30:08,785 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:30:08,785 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:30:08,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:30:08,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1005027869, now seen corresponding path program 1 times [2019-10-13 21:30:08,786 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:30:08,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588592969] [2019-10-13 21:30:08,786 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:08,787 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:08,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:30:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:08,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:30:08,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588592969] [2019-10-13 21:30:08,885 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:30:08,885 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:30:08,885 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653840740] [2019-10-13 21:30:08,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:30:08,886 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:30:08,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:30:08,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:30:08,887 INFO L87 Difference]: Start difference. First operand 522 states and 716 transitions. Second operand 6 states. [2019-10-13 21:30:08,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:30:08,974 INFO L93 Difference]: Finished difference Result 1044 states and 1470 transitions. [2019-10-13 21:30:08,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:30:08,974 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-10-13 21:30:08,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:30:08,978 INFO L225 Difference]: With dead ends: 1044 [2019-10-13 21:30:08,978 INFO L226 Difference]: Without dead ends: 547 [2019-10-13 21:30:08,982 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:30:08,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-10-13 21:30:09,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 527. [2019-10-13 21:30:09,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-10-13 21:30:09,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 720 transitions. [2019-10-13 21:30:09,041 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 720 transitions. Word has length 150 [2019-10-13 21:30:09,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:30:09,041 INFO L462 AbstractCegarLoop]: Abstraction has 527 states and 720 transitions. [2019-10-13 21:30:09,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:30:09,042 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 720 transitions. [2019-10-13 21:30:09,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:30:09,043 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:30:09,044 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:30:09,044 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:30:09,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:30:09,044 INFO L82 PathProgramCache]: Analyzing trace with hash 2036068767, now seen corresponding path program 1 times [2019-10-13 21:30:09,044 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:30:09,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688430633] [2019-10-13 21:30:09,045 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:09,045 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:09,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:30:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:09,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:30:09,119 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688430633] [2019-10-13 21:30:09,123 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:30:09,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:30:09,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119661534] [2019-10-13 21:30:09,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:30:09,125 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:30:09,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:30:09,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:30:09,126 INFO L87 Difference]: Start difference. First operand 527 states and 720 transitions. Second operand 4 states. [2019-10-13 21:30:09,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:30:09,458 INFO L93 Difference]: Finished difference Result 1518 states and 2144 transitions. [2019-10-13 21:30:09,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:30:09,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-10-13 21:30:09,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:30:09,465 INFO L225 Difference]: With dead ends: 1518 [2019-10-13 21:30:09,465 INFO L226 Difference]: Without dead ends: 1016 [2019-10-13 21:30:09,468 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:30:09,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2019-10-13 21:30:09,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1009. [2019-10-13 21:30:09,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2019-10-13 21:30:09,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1377 transitions. [2019-10-13 21:30:09,583 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1377 transitions. Word has length 150 [2019-10-13 21:30:09,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:30:09,583 INFO L462 AbstractCegarLoop]: Abstraction has 1009 states and 1377 transitions. [2019-10-13 21:30:09,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:30:09,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1377 transitions. [2019-10-13 21:30:09,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:30:09,586 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:30:09,586 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:30:09,586 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:30:09,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:30:09,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1903302082, now seen corresponding path program 1 times [2019-10-13 21:30:09,587 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:30:09,587 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713431410] [2019-10-13 21:30:09,587 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:09,587 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:09,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:30:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:09,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:30:09,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713431410] [2019-10-13 21:30:09,648 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:30:09,648 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:30:09,648 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183537758] [2019-10-13 21:30:09,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:30:09,648 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:30:09,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:30:09,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:30:09,649 INFO L87 Difference]: Start difference. First operand 1009 states and 1377 transitions. Second operand 6 states. [2019-10-13 21:30:09,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:30:09,797 INFO L93 Difference]: Finished difference Result 2037 states and 2852 transitions. [2019-10-13 21:30:09,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:30:09,798 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-10-13 21:30:09,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:30:09,808 INFO L225 Difference]: With dead ends: 2037 [2019-10-13 21:30:09,808 INFO L226 Difference]: Without dead ends: 1053 [2019-10-13 21:30:09,813 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:30:09,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-10-13 21:30:09,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1019. [2019-10-13 21:30:09,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2019-10-13 21:30:09,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1385 transitions. [2019-10-13 21:30:09,943 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1385 transitions. Word has length 150 [2019-10-13 21:30:09,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:30:09,943 INFO L462 AbstractCegarLoop]: Abstraction has 1019 states and 1385 transitions. [2019-10-13 21:30:09,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:30:09,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1385 transitions. [2019-10-13 21:30:09,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:30:09,948 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:30:09,949 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:30:09,949 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:30:09,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:30:09,950 INFO L82 PathProgramCache]: Analyzing trace with hash -26238852, now seen corresponding path program 1 times [2019-10-13 21:30:09,950 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:30:09,950 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535113317] [2019-10-13 21:30:09,950 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:09,951 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:09,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:30:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:10,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:30:10,056 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535113317] [2019-10-13 21:30:10,056 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:30:10,056 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:30:10,057 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612023362] [2019-10-13 21:30:10,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:30:10,059 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:30:10,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:30:10,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:30:10,059 INFO L87 Difference]: Start difference. First operand 1019 states and 1385 transitions. Second operand 4 states. [2019-10-13 21:30:10,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:30:10,519 INFO L93 Difference]: Finished difference Result 2982 states and 4193 transitions. [2019-10-13 21:30:10,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:30:10,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-10-13 21:30:10,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:30:10,541 INFO L225 Difference]: With dead ends: 2982 [2019-10-13 21:30:10,541 INFO L226 Difference]: Without dead ends: 1988 [2019-10-13 21:30:10,547 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:30:10,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2019-10-13 21:30:10,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1977. [2019-10-13 21:30:10,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1977 states. [2019-10-13 21:30:10,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 2685 transitions. [2019-10-13 21:30:10,779 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 2685 transitions. Word has length 150 [2019-10-13 21:30:10,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:30:10,780 INFO L462 AbstractCegarLoop]: Abstraction has 1977 states and 2685 transitions. [2019-10-13 21:30:10,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:30:10,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2685 transitions. [2019-10-13 21:30:10,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:30:10,782 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:30:10,782 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:30:10,782 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:30:10,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:30:10,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1511479043, now seen corresponding path program 1 times [2019-10-13 21:30:10,784 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:30:10,785 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860209278] [2019-10-13 21:30:10,785 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:10,785 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:10,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:30:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:10,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:30:10,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860209278] [2019-10-13 21:30:10,854 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:30:10,854 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:30:10,855 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249814596] [2019-10-13 21:30:10,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:30:10,856 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:30:10,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:30:10,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:30:10,857 INFO L87 Difference]: Start difference. First operand 1977 states and 2685 transitions. Second operand 6 states. [2019-10-13 21:30:11,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:30:11,053 INFO L93 Difference]: Finished difference Result 4005 states and 5580 transitions. [2019-10-13 21:30:11,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:30:11,053 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-10-13 21:30:11,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:30:11,066 INFO L225 Difference]: With dead ends: 4005 [2019-10-13 21:30:11,066 INFO L226 Difference]: Without dead ends: 2053 [2019-10-13 21:30:11,078 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:30:11,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2019-10-13 21:30:11,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 1997. [2019-10-13 21:30:11,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1997 states. [2019-10-13 21:30:11,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 2701 transitions. [2019-10-13 21:30:11,319 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 2701 transitions. Word has length 150 [2019-10-13 21:30:11,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:30:11,321 INFO L462 AbstractCegarLoop]: Abstraction has 1997 states and 2701 transitions. [2019-10-13 21:30:11,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:30:11,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2701 transitions. [2019-10-13 21:30:11,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:30:11,323 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:30:11,323 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:30:11,323 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:30:11,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:30:11,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1725650175, now seen corresponding path program 1 times [2019-10-13 21:30:11,324 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:30:11,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22726840] [2019-10-13 21:30:11,324 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:11,324 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:11,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:30:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:11,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:30:11,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22726840] [2019-10-13 21:30:11,393 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:30:11,393 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:30:11,394 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930804982] [2019-10-13 21:30:11,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:30:11,395 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:30:11,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:30:11,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:30:11,396 INFO L87 Difference]: Start difference. First operand 1997 states and 2701 transitions. Second operand 6 states. [2019-10-13 21:30:11,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:30:11,619 INFO L93 Difference]: Finished difference Result 4097 states and 5693 transitions. [2019-10-13 21:30:11,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:30:11,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-10-13 21:30:11,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:30:11,632 INFO L225 Difference]: With dead ends: 4097 [2019-10-13 21:30:11,633 INFO L226 Difference]: Without dead ends: 2125 [2019-10-13 21:30:11,640 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:30:11,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2019-10-13 21:30:11,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 2037. [2019-10-13 21:30:11,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2037 states. [2019-10-13 21:30:11,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 2741 transitions. [2019-10-13 21:30:11,864 INFO L78 Accepts]: Start accepts. Automaton has 2037 states and 2741 transitions. Word has length 150 [2019-10-13 21:30:11,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:30:11,864 INFO L462 AbstractCegarLoop]: Abstraction has 2037 states and 2741 transitions. [2019-10-13 21:30:11,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:30:11,865 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 2741 transitions. [2019-10-13 21:30:11,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:30:11,867 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:30:11,868 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:30:11,868 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:30:11,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:30:11,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1802550973, now seen corresponding path program 1 times [2019-10-13 21:30:11,869 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:30:11,869 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903398746] [2019-10-13 21:30:11,869 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:11,870 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:11,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:30:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:11,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:30:11,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903398746] [2019-10-13 21:30:11,955 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:30:11,955 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:30:11,955 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769063769] [2019-10-13 21:30:11,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:30:11,956 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:30:11,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:30:11,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:30:11,956 INFO L87 Difference]: Start difference. First operand 2037 states and 2741 transitions. Second operand 4 states. [2019-10-13 21:30:12,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:30:12,489 INFO L93 Difference]: Finished difference Result 6012 states and 8379 transitions. [2019-10-13 21:30:12,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:30:12,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-10-13 21:30:12,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:30:12,512 INFO L225 Difference]: With dead ends: 6012 [2019-10-13 21:30:12,512 INFO L226 Difference]: Without dead ends: 4000 [2019-10-13 21:30:12,523 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:30:12,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4000 states. [2019-10-13 21:30:12,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4000 to 3981. [2019-10-13 21:30:12,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3981 states. [2019-10-13 21:30:12,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3981 states to 3981 states and 5359 transitions. [2019-10-13 21:30:12,953 INFO L78 Accepts]: Start accepts. Automaton has 3981 states and 5359 transitions. Word has length 150 [2019-10-13 21:30:12,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:30:12,953 INFO L462 AbstractCegarLoop]: Abstraction has 3981 states and 5359 transitions. [2019-10-13 21:30:12,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:30:12,953 INFO L276 IsEmpty]: Start isEmpty. Operand 3981 states and 5359 transitions. [2019-10-13 21:30:12,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:30:12,955 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:30:12,955 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:30:12,956 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:30:12,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:30:12,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1354787458, now seen corresponding path program 1 times [2019-10-13 21:30:12,956 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:30:12,956 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795039862] [2019-10-13 21:30:12,957 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:12,957 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:12,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:30:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:13,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:30:13,033 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795039862] [2019-10-13 21:30:13,034 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:30:13,034 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:30:13,034 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778562977] [2019-10-13 21:30:13,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:30:13,035 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:30:13,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:30:13,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:30:13,035 INFO L87 Difference]: Start difference. First operand 3981 states and 5359 transitions. Second operand 6 states. [2019-10-13 21:30:13,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:30:13,353 INFO L93 Difference]: Finished difference Result 8041 states and 11102 transitions. [2019-10-13 21:30:13,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:30:13,353 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-10-13 21:30:13,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:30:13,377 INFO L225 Difference]: With dead ends: 8041 [2019-10-13 21:30:13,377 INFO L226 Difference]: Without dead ends: 4085 [2019-10-13 21:30:13,399 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:30:13,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4085 states. [2019-10-13 21:30:13,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4085 to 4021. [2019-10-13 21:30:13,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4021 states. [2019-10-13 21:30:13,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4021 states to 4021 states and 5391 transitions. [2019-10-13 21:30:13,829 INFO L78 Accepts]: Start accepts. Automaton has 4021 states and 5391 transitions. Word has length 150 [2019-10-13 21:30:13,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:30:13,829 INFO L462 AbstractCegarLoop]: Abstraction has 4021 states and 5391 transitions. [2019-10-13 21:30:13,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:30:13,830 INFO L276 IsEmpty]: Start isEmpty. Operand 4021 states and 5391 transitions. [2019-10-13 21:30:13,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:30:13,831 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:30:13,831 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:30:13,831 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:30:13,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:30:13,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1772184064, now seen corresponding path program 1 times [2019-10-13 21:30:13,832 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:30:13,832 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643424997] [2019-10-13 21:30:13,832 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:13,832 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:13,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:30:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:13,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:30:13,901 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643424997] [2019-10-13 21:30:13,902 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:30:13,902 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:30:13,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084596065] [2019-10-13 21:30:13,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:30:13,904 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:30:13,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:30:13,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:30:13,905 INFO L87 Difference]: Start difference. First operand 4021 states and 5391 transitions. Second operand 6 states. [2019-10-13 21:30:14,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:30:14,262 INFO L93 Difference]: Finished difference Result 8177 states and 11247 transitions. [2019-10-13 21:30:14,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:30:14,262 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-10-13 21:30:14,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:30:14,302 INFO L225 Difference]: With dead ends: 8177 [2019-10-13 21:30:14,302 INFO L226 Difference]: Without dead ends: 4181 [2019-10-13 21:30:14,330 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:30:14,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4181 states. [2019-10-13 21:30:14,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4181 to 4101. [2019-10-13 21:30:14,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4101 states. [2019-10-13 21:30:14,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 5471 transitions. [2019-10-13 21:30:14,842 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 5471 transitions. Word has length 150 [2019-10-13 21:30:14,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:30:14,842 INFO L462 AbstractCegarLoop]: Abstraction has 4101 states and 5471 transitions. [2019-10-13 21:30:14,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:30:14,842 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 5471 transitions. [2019-10-13 21:30:14,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:30:14,843 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:30:14,844 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:30:14,844 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:30:14,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:30:14,844 INFO L82 PathProgramCache]: Analyzing trace with hash -896165058, now seen corresponding path program 1 times [2019-10-13 21:30:14,844 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:30:14,845 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693831505] [2019-10-13 21:30:14,845 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:14,845 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:14,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:30:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:14,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:30:14,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693831505] [2019-10-13 21:30:14,909 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:30:14,909 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:30:14,909 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982204202] [2019-10-13 21:30:14,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:30:14,910 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:30:14,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:30:14,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:30:14,911 INFO L87 Difference]: Start difference. First operand 4101 states and 5471 transitions. Second operand 6 states. [2019-10-13 21:30:15,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:30:15,277 INFO L93 Difference]: Finished difference Result 8289 states and 11327 transitions. [2019-10-13 21:30:15,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:30:15,278 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-10-13 21:30:15,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:30:15,299 INFO L225 Difference]: With dead ends: 8289 [2019-10-13 21:30:15,300 INFO L226 Difference]: Without dead ends: 4213 [2019-10-13 21:30:15,324 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:30:15,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4213 states. [2019-10-13 21:30:15,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4213 to 4181. [2019-10-13 21:30:15,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4181 states. [2019-10-13 21:30:15,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4181 states to 4181 states and 5551 transitions. [2019-10-13 21:30:15,697 INFO L78 Accepts]: Start accepts. Automaton has 4181 states and 5551 transitions. Word has length 150 [2019-10-13 21:30:15,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:30:15,699 INFO L462 AbstractCegarLoop]: Abstraction has 4181 states and 5551 transitions. [2019-10-13 21:30:15,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:30:15,700 INFO L276 IsEmpty]: Start isEmpty. Operand 4181 states and 5551 transitions. [2019-10-13 21:30:15,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:30:15,701 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:30:15,701 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:30:15,701 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:30:15,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:30:15,702 INFO L82 PathProgramCache]: Analyzing trace with hash -2678720, now seen corresponding path program 1 times [2019-10-13 21:30:15,702 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:30:15,702 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292502821] [2019-10-13 21:30:15,702 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:15,702 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:15,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:30:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:15,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:30:15,777 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292502821] [2019-10-13 21:30:15,777 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:30:15,777 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:30:15,778 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899003003] [2019-10-13 21:30:15,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:30:15,778 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:30:15,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:30:15,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:30:15,779 INFO L87 Difference]: Start difference. First operand 4181 states and 5551 transitions. Second operand 5 states. [2019-10-13 21:30:16,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:30:16,963 INFO L93 Difference]: Finished difference Result 10280 states and 13864 transitions. [2019-10-13 21:30:16,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:30:16,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-13 21:30:16,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:30:16,986 INFO L225 Difference]: With dead ends: 10280 [2019-10-13 21:30:16,986 INFO L226 Difference]: Without dead ends: 6125 [2019-10-13 21:30:16,999 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:30:17,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6125 states. [2019-10-13 21:30:17,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6125 to 5757. [2019-10-13 21:30:17,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5757 states. [2019-10-13 21:30:17,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5757 states to 5757 states and 7407 transitions. [2019-10-13 21:30:17,854 INFO L78 Accepts]: Start accepts. Automaton has 5757 states and 7407 transitions. Word has length 150 [2019-10-13 21:30:17,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:30:17,854 INFO L462 AbstractCegarLoop]: Abstraction has 5757 states and 7407 transitions. [2019-10-13 21:30:17,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:30:17,854 INFO L276 IsEmpty]: Start isEmpty. Operand 5757 states and 7407 transitions. [2019-10-13 21:30:17,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:30:17,856 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:30:17,856 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:30:17,856 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:30:17,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:30:17,856 INFO L82 PathProgramCache]: Analyzing trace with hash 420968002, now seen corresponding path program 1 times [2019-10-13 21:30:17,857 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:30:17,857 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559778903] [2019-10-13 21:30:17,857 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:17,857 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:17,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:30:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:17,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:30:17,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559778903] [2019-10-13 21:30:17,921 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:30:17,922 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:30:17,922 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463076519] [2019-10-13 21:30:17,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:30:17,922 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:30:17,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:30:17,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:30:17,923 INFO L87 Difference]: Start difference. First operand 5757 states and 7407 transitions. Second operand 5 states. [2019-10-13 21:30:18,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:30:18,649 INFO L93 Difference]: Finished difference Result 11488 states and 14827 transitions. [2019-10-13 21:30:18,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:30:18,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-13 21:30:18,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:30:18,670 INFO L225 Difference]: With dead ends: 11488 [2019-10-13 21:30:18,670 INFO L226 Difference]: Without dead ends: 5757 [2019-10-13 21:30:18,680 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:30:18,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5757 states. [2019-10-13 21:30:19,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5757 to 5757. [2019-10-13 21:30:19,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5757 states. [2019-10-13 21:30:19,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5757 states to 5757 states and 7367 transitions. [2019-10-13 21:30:19,147 INFO L78 Accepts]: Start accepts. Automaton has 5757 states and 7367 transitions. Word has length 150 [2019-10-13 21:30:19,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:30:19,147 INFO L462 AbstractCegarLoop]: Abstraction has 5757 states and 7367 transitions. [2019-10-13 21:30:19,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:30:19,148 INFO L276 IsEmpty]: Start isEmpty. Operand 5757 states and 7367 transitions. [2019-10-13 21:30:19,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:30:19,149 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:30:19,149 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:30:19,149 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:30:19,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:30:19,150 INFO L82 PathProgramCache]: Analyzing trace with hash -950839296, now seen corresponding path program 1 times [2019-10-13 21:30:19,150 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:30:19,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178474385] [2019-10-13 21:30:19,150 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:19,150 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:19,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:30:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:19,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:30:19,214 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178474385] [2019-10-13 21:30:19,214 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:30:19,214 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:30:19,214 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076720291] [2019-10-13 21:30:19,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:30:19,215 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:30:19,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:30:19,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:30:19,215 INFO L87 Difference]: Start difference. First operand 5757 states and 7367 transitions. Second operand 5 states. [2019-10-13 21:30:20,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:30:20,159 INFO L93 Difference]: Finished difference Result 11488 states and 14747 transitions. [2019-10-13 21:30:20,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:30:20,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-13 21:30:20,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:30:20,180 INFO L225 Difference]: With dead ends: 11488 [2019-10-13 21:30:20,181 INFO L226 Difference]: Without dead ends: 5757 [2019-10-13 21:30:20,190 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:30:20,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5757 states. [2019-10-13 21:30:20,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5757 to 5757. [2019-10-13 21:30:20,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5757 states. [2019-10-13 21:30:20,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5757 states to 5757 states and 7327 transitions. [2019-10-13 21:30:20,589 INFO L78 Accepts]: Start accepts. Automaton has 5757 states and 7327 transitions. Word has length 150 [2019-10-13 21:30:20,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:30:20,589 INFO L462 AbstractCegarLoop]: Abstraction has 5757 states and 7327 transitions. [2019-10-13 21:30:20,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:30:20,590 INFO L276 IsEmpty]: Start isEmpty. Operand 5757 states and 7327 transitions. [2019-10-13 21:30:20,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:30:20,591 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:30:20,591 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:30:20,591 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:30:20,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:30:20,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1980198594, now seen corresponding path program 1 times [2019-10-13 21:30:20,592 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:30:20,592 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632400071] [2019-10-13 21:30:20,592 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:20,592 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:20,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:30:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:20,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:30:20,660 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632400071] [2019-10-13 21:30:20,660 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:30:20,661 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:30:20,661 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558602678] [2019-10-13 21:30:20,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:30:20,662 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:30:20,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:30:20,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:30:20,662 INFO L87 Difference]: Start difference. First operand 5757 states and 7327 transitions. Second operand 5 states. [2019-10-13 21:30:21,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:30:21,566 INFO L93 Difference]: Finished difference Result 11488 states and 14667 transitions. [2019-10-13 21:30:21,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:30:21,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-13 21:30:21,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:30:21,584 INFO L225 Difference]: With dead ends: 11488 [2019-10-13 21:30:21,584 INFO L226 Difference]: Without dead ends: 5757 [2019-10-13 21:30:21,593 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:30:21,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5757 states. [2019-10-13 21:30:22,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5757 to 5757. [2019-10-13 21:30:22,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5757 states. [2019-10-13 21:30:22,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5757 states to 5757 states and 7287 transitions. [2019-10-13 21:30:22,103 INFO L78 Accepts]: Start accepts. Automaton has 5757 states and 7287 transitions. Word has length 150 [2019-10-13 21:30:22,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:30:22,103 INFO L462 AbstractCegarLoop]: Abstraction has 5757 states and 7287 transitions. [2019-10-13 21:30:22,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:30:22,104 INFO L276 IsEmpty]: Start isEmpty. Operand 5757 states and 7287 transitions. [2019-10-13 21:30:22,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:30:22,105 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:30:22,105 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:30:22,105 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:30:22,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:30:22,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1320667072, now seen corresponding path program 1 times [2019-10-13 21:30:22,106 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:30:22,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910633228] [2019-10-13 21:30:22,106 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:22,106 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:22,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:30:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:22,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:30:22,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910633228] [2019-10-13 21:30:22,199 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:30:22,199 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:30:22,199 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880737] [2019-10-13 21:30:22,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:30:22,200 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:30:22,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:30:22,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:30:22,200 INFO L87 Difference]: Start difference. First operand 5757 states and 7287 transitions. Second operand 5 states. [2019-10-13 21:30:23,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:30:23,327 INFO L93 Difference]: Finished difference Result 13698 states and 17482 transitions. [2019-10-13 21:30:23,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:30:23,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-13 21:30:23,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:30:23,347 INFO L225 Difference]: With dead ends: 13698 [2019-10-13 21:30:23,347 INFO L226 Difference]: Without dead ends: 7967 [2019-10-13 21:30:23,358 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:30:23,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7967 states. [2019-10-13 21:30:23,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7967 to 7671. [2019-10-13 21:30:23,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7671 states. [2019-10-13 21:30:23,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7671 states to 7671 states and 9517 transitions. [2019-10-13 21:30:23,811 INFO L78 Accepts]: Start accepts. Automaton has 7671 states and 9517 transitions. Word has length 150 [2019-10-13 21:30:23,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:30:23,812 INFO L462 AbstractCegarLoop]: Abstraction has 7671 states and 9517 transitions. [2019-10-13 21:30:23,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:30:23,812 INFO L276 IsEmpty]: Start isEmpty. Operand 7671 states and 9517 transitions. [2019-10-13 21:30:23,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:30:23,813 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:30:23,814 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:30:23,814 INFO L410 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:30:23,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:30:23,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1715033858, now seen corresponding path program 1 times [2019-10-13 21:30:23,814 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:30:23,814 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981489342] [2019-10-13 21:30:23,815 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:23,815 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:23,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:30:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:23,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:30:23,881 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981489342] [2019-10-13 21:30:23,881 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:30:23,881 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:30:23,881 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798970104] [2019-10-13 21:30:23,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:30:23,882 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:30:23,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:30:23,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:30:23,882 INFO L87 Difference]: Start difference. First operand 7671 states and 9517 transitions. Second operand 5 states. [2019-10-13 21:30:25,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:30:25,460 INFO L93 Difference]: Finished difference Result 15314 states and 19075 transitions. [2019-10-13 21:30:25,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:30:25,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-13 21:30:25,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:30:25,489 INFO L225 Difference]: With dead ends: 15314 [2019-10-13 21:30:25,489 INFO L226 Difference]: Without dead ends: 7671 [2019-10-13 21:30:25,505 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:30:25,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7671 states. [2019-10-13 21:30:26,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7671 to 7671. [2019-10-13 21:30:26,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7671 states. [2019-10-13 21:30:26,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7671 states to 7671 states and 9461 transitions. [2019-10-13 21:30:26,445 INFO L78 Accepts]: Start accepts. Automaton has 7671 states and 9461 transitions. Word has length 150 [2019-10-13 21:30:26,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:30:26,445 INFO L462 AbstractCegarLoop]: Abstraction has 7671 states and 9461 transitions. [2019-10-13 21:30:26,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:30:26,446 INFO L276 IsEmpty]: Start isEmpty. Operand 7671 states and 9461 transitions. [2019-10-13 21:30:26,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:30:26,448 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:30:26,449 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:30:26,449 INFO L410 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:30:26,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:30:26,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1735927936, now seen corresponding path program 1 times [2019-10-13 21:30:26,450 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:30:26,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231090710] [2019-10-13 21:30:26,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:26,451 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:26,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:30:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:26,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:30:26,547 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231090710] [2019-10-13 21:30:26,547 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:30:26,547 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:30:26,548 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379078859] [2019-10-13 21:30:26,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:30:26,549 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:30:26,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:30:26,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:30:26,549 INFO L87 Difference]: Start difference. First operand 7671 states and 9461 transitions. Second operand 5 states.