/usr/bin/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.04.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:15:22,702 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:15:22,704 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:15:22,724 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:15:22,725 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:15:22,726 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:15:22,728 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:15:22,730 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:15:22,731 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:15:22,732 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:15:22,733 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:15:22,734 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:15:22,735 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:15:22,736 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:15:22,736 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:15:22,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:15:22,738 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:15:22,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:15:22,741 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:15:22,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:15:22,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:15:22,746 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:15:22,747 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:15:22,748 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:15:22,750 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:15:22,750 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:15:22,751 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:15:22,752 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:15:22,752 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:15:22,753 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:15:22,753 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:15:22,754 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:15:22,755 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:15:22,756 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:15:22,757 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:15:22,757 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:15:22,758 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:15:22,758 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:15:22,758 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:15:22,759 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:15:22,760 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:15:22,760 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-11-07 01:15:22,786 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:15:22,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:15:22,788 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:15:22,788 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:15:22,788 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:15:22,789 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:15:22,789 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:15:22,789 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:15:22,789 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:15:22,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:15:22,789 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:15:22,791 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:15:22,791 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:15:22,791 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:15:22,791 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:15:22,792 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:15:22,792 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:15:22,792 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:15:22,792 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:15:22,792 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:15:22,792 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:15:22,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:15:22,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:15:22,793 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:15:22,793 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:15:22,793 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:15:22,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:15:22,794 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:15:22,794 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-11-07 01:15:23,075 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:15:23,088 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:15:23,092 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:15:23,093 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:15:23,094 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:15:23,094 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.04.cil.c [2019-11-07 01:15:23,173 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebc09ec8a/50401cd43e7d48a0a79735bf5d3fadff/FLAG05dc53739 [2019-11-07 01:15:23,681 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:15:23,683 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.04.cil.c [2019-11-07 01:15:23,701 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebc09ec8a/50401cd43e7d48a0a79735bf5d3fadff/FLAG05dc53739 [2019-11-07 01:15:24,020 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebc09ec8a/50401cd43e7d48a0a79735bf5d3fadff [2019-11-07 01:15:24,036 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:15:24,038 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:15:24,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:15:24,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:15:24,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:15:24,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:15:24" (1/1) ... [2019-11-07 01:15:24,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75c90ee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:24, skipping insertion in model container [2019-11-07 01:15:24,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:15:24" (1/1) ... [2019-11-07 01:15:24,080 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:15:24,189 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:15:24,491 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:15:24,499 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:15:24,640 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:15:24,665 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:15:24,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:24 WrapperNode [2019-11-07 01:15:24,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:15:24,667 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:15:24,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:15:24,668 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:15:24,680 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:24" (1/1) ... [2019-11-07 01:15:24,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:24" (1/1) ... [2019-11-07 01:15:24,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:24" (1/1) ... [2019-11-07 01:15:24,689 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:24" (1/1) ... [2019-11-07 01:15:24,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:24" (1/1) ... [2019-11-07 01:15:24,719 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:24" (1/1) ... [2019-11-07 01:15:24,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:24" (1/1) ... [2019-11-07 01:15:24,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:15:24,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:15:24,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:15:24,729 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:15:24,731 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:24" (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-11-07 01:15:24,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:15:24,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:15:24,800 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-11-07 01:15:24,800 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-11-07 01:15:24,800 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-11-07 01:15:24,800 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-11-07 01:15:24,800 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-11-07 01:15:24,801 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-11-07 01:15:24,801 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-11-07 01:15:24,801 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-11-07 01:15:24,801 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-11-07 01:15:24,801 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-11-07 01:15:24,802 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-11-07 01:15:24,802 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-11-07 01:15:24,802 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-11-07 01:15:24,802 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-11-07 01:15:24,802 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-11-07 01:15:24,802 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-11-07 01:15:24,803 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-11-07 01:15:24,803 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-11-07 01:15:24,803 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-11-07 01:15:24,803 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-11-07 01:15:24,803 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-11-07 01:15:24,803 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-11-07 01:15:24,804 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-11-07 01:15:24,804 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-11-07 01:15:24,804 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:15:24,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:15:24,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 01:15:24,804 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-11-07 01:15:24,805 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-11-07 01:15:24,805 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-11-07 01:15:24,805 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-11-07 01:15:24,805 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-11-07 01:15:24,805 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-11-07 01:15:24,805 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-11-07 01:15:24,806 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-11-07 01:15:24,806 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-11-07 01:15:24,806 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-11-07 01:15:24,806 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-11-07 01:15:24,806 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-11-07 01:15:24,806 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-11-07 01:15:24,807 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-11-07 01:15:24,807 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-11-07 01:15:24,807 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-11-07 01:15:24,807 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-11-07 01:15:24,807 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-11-07 01:15:24,807 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-11-07 01:15:24,807 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-11-07 01:15:24,808 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-11-07 01:15:24,808 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-11-07 01:15:24,808 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-11-07 01:15:24,808 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-11-07 01:15:24,808 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:15:24,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:15:24,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:15:25,695 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:15:25,696 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-07 01:15:25,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:15:25 BoogieIcfgContainer [2019-11-07 01:15:25,697 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:15:25,699 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:15:25,699 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:15:25,702 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:15:25,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:15:24" (1/3) ... [2019-11-07 01:15:25,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97929eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:15:25, skipping insertion in model container [2019-11-07 01:15:25,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:24" (2/3) ... [2019-11-07 01:15:25,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97929eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:15:25, skipping insertion in model container [2019-11-07 01:15:25,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:15:25" (3/3) ... [2019-11-07 01:15:25,709 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.04.cil.c [2019-11-07 01:15:25,720 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:15:25,748 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 01:15:25,762 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 01:15:25,791 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:15:25,792 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:15:25,792 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:15:25,792 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:15:25,793 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:15:25,793 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:15:25,793 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:15:25,793 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:15:25,820 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states. [2019-11-07 01:15:25,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-07 01:15:25,836 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:25,838 INFO L410 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] [2019-11-07 01:15:25,840 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:25,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:25,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1449217388, now seen corresponding path program 1 times [2019-11-07 01:15:25,855 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:25,855 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145494666] [2019-11-07 01:15:25,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:26,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:26,335 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145494666] [2019-11-07 01:15:26,336 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:26,337 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:15:26,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453933528] [2019-11-07 01:15:26,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:15:26,350 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:26,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:15:26,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:15:26,372 INFO L87 Difference]: Start difference. First operand 229 states. Second operand 5 states. [2019-11-07 01:15:27,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:27,161 INFO L93 Difference]: Finished difference Result 475 states and 713 transitions. [2019-11-07 01:15:27,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:15:27,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-11-07 01:15:27,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:27,195 INFO L225 Difference]: With dead ends: 475 [2019-11-07 01:15:27,196 INFO L226 Difference]: Without dead ends: 256 [2019-11-07 01:15:27,208 INFO L630 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-11-07 01:15:27,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-07 01:15:27,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 220. [2019-11-07 01:15:27,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-11-07 01:15:27,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 304 transitions. [2019-11-07 01:15:27,348 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 304 transitions. Word has length 120 [2019-11-07 01:15:27,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:27,349 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 304 transitions. [2019-11-07 01:15:27,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:15:27,349 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 304 transitions. [2019-11-07 01:15:27,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-07 01:15:27,364 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:27,364 INFO L410 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] [2019-11-07 01:15:27,365 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:27,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:27,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1789018706, now seen corresponding path program 1 times [2019-11-07 01:15:27,367 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:27,367 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941786013] [2019-11-07 01:15:27,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:27,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:27,591 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941786013] [2019-11-07 01:15:27,591 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:27,591 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:15:27,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670913874] [2019-11-07 01:15:27,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:15:27,597 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:27,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:15:27,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:15:27,602 INFO L87 Difference]: Start difference. First operand 220 states and 304 transitions. Second operand 5 states. [2019-11-07 01:15:28,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:28,171 INFO L93 Difference]: Finished difference Result 454 states and 646 transitions. [2019-11-07 01:15:28,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:15:28,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-11-07 01:15:28,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:28,175 INFO L225 Difference]: With dead ends: 454 [2019-11-07 01:15:28,175 INFO L226 Difference]: Without dead ends: 256 [2019-11-07 01:15:28,177 INFO L630 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-11-07 01:15:28,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-07 01:15:28,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 220. [2019-11-07 01:15:28,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-11-07 01:15:28,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 303 transitions. [2019-11-07 01:15:28,203 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 303 transitions. Word has length 120 [2019-11-07 01:15:28,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:28,203 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 303 transitions. [2019-11-07 01:15:28,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:15:28,204 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 303 transitions. [2019-11-07 01:15:28,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-07 01:15:28,206 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:28,206 INFO L410 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] [2019-11-07 01:15:28,206 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:28,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:28,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1154563372, now seen corresponding path program 1 times [2019-11-07 01:15:28,207 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:28,207 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528416360] [2019-11-07 01:15:28,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:28,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:28,347 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528416360] [2019-11-07 01:15:28,347 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:28,348 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:15:28,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737550720] [2019-11-07 01:15:28,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:15:28,349 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:28,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:15:28,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:15:28,350 INFO L87 Difference]: Start difference. First operand 220 states and 303 transitions. Second operand 5 states. [2019-11-07 01:15:28,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:28,884 INFO L93 Difference]: Finished difference Result 452 states and 640 transitions. [2019-11-07 01:15:28,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:15:28,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-11-07 01:15:28,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:28,887 INFO L225 Difference]: With dead ends: 452 [2019-11-07 01:15:28,888 INFO L226 Difference]: Without dead ends: 254 [2019-11-07 01:15:28,889 INFO L630 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-11-07 01:15:28,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-11-07 01:15:28,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 220. [2019-11-07 01:15:28,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-11-07 01:15:28,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 302 transitions. [2019-11-07 01:15:28,912 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 302 transitions. Word has length 120 [2019-11-07 01:15:28,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:28,912 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 302 transitions. [2019-11-07 01:15:28,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:15:28,913 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 302 transitions. [2019-11-07 01:15:28,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-07 01:15:28,914 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:28,915 INFO L410 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] [2019-11-07 01:15:28,915 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:28,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:28,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1521429010, now seen corresponding path program 1 times [2019-11-07 01:15:28,916 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:28,916 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809608764] [2019-11-07 01:15:28,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:28,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:28,993 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809608764] [2019-11-07 01:15:28,993 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:28,993 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:15:28,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407255558] [2019-11-07 01:15:28,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:15:28,994 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:28,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:15:28,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:15:28,995 INFO L87 Difference]: Start difference. First operand 220 states and 302 transitions. Second operand 5 states. [2019-11-07 01:15:29,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:29,528 INFO L93 Difference]: Finished difference Result 450 states and 634 transitions. [2019-11-07 01:15:29,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:15:29,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-11-07 01:15:29,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:29,531 INFO L225 Difference]: With dead ends: 450 [2019-11-07 01:15:29,531 INFO L226 Difference]: Without dead ends: 252 [2019-11-07 01:15:29,532 INFO L630 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-11-07 01:15:29,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-11-07 01:15:29,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 220. [2019-11-07 01:15:29,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-11-07 01:15:29,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 301 transitions. [2019-11-07 01:15:29,553 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 301 transitions. Word has length 120 [2019-11-07 01:15:29,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:29,553 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 301 transitions. [2019-11-07 01:15:29,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:15:29,553 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 301 transitions. [2019-11-07 01:15:29,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-07 01:15:29,555 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:29,555 INFO L410 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] [2019-11-07 01:15:29,555 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:29,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:29,556 INFO L82 PathProgramCache]: Analyzing trace with hash 637920020, now seen corresponding path program 1 times [2019-11-07 01:15:29,556 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:29,556 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820353533] [2019-11-07 01:15:29,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:29,663 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820353533] [2019-11-07 01:15:29,663 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:29,663 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:15:29,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215162470] [2019-11-07 01:15:29,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:15:29,667 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:29,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:15:29,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:15:29,668 INFO L87 Difference]: Start difference. First operand 220 states and 301 transitions. Second operand 5 states. [2019-11-07 01:15:30,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:30,248 INFO L93 Difference]: Finished difference Result 471 states and 668 transitions. [2019-11-07 01:15:30,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:15:30,249 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-11-07 01:15:30,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:30,252 INFO L225 Difference]: With dead ends: 471 [2019-11-07 01:15:30,252 INFO L226 Difference]: Without dead ends: 273 [2019-11-07 01:15:30,253 INFO L630 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-11-07 01:15:30,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-07 01:15:30,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 220. [2019-11-07 01:15:30,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-11-07 01:15:30,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 300 transitions. [2019-11-07 01:15:30,274 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 300 transitions. Word has length 120 [2019-11-07 01:15:30,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:30,274 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 300 transitions. [2019-11-07 01:15:30,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:15:30,275 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 300 transitions. [2019-11-07 01:15:30,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-07 01:15:30,276 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:30,277 INFO L410 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] [2019-11-07 01:15:30,277 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:30,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:30,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1302661994, now seen corresponding path program 1 times [2019-11-07 01:15:30,278 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:30,278 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906611073] [2019-11-07 01:15:30,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:30,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:30,364 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906611073] [2019-11-07 01:15:30,365 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:30,365 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:15:30,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814762386] [2019-11-07 01:15:30,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:15:30,367 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:30,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:15:30,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:15:30,368 INFO L87 Difference]: Start difference. First operand 220 states and 300 transitions. Second operand 5 states. [2019-11-07 01:15:30,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:30,800 INFO L93 Difference]: Finished difference Result 469 states and 662 transitions. [2019-11-07 01:15:30,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:15:30,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-11-07 01:15:30,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:30,803 INFO L225 Difference]: With dead ends: 469 [2019-11-07 01:15:30,803 INFO L226 Difference]: Without dead ends: 271 [2019-11-07 01:15:30,804 INFO L630 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-11-07 01:15:30,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-07 01:15:30,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 220. [2019-11-07 01:15:30,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-11-07 01:15:30,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 299 transitions. [2019-11-07 01:15:30,826 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 299 transitions. Word has length 120 [2019-11-07 01:15:30,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:30,827 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 299 transitions. [2019-11-07 01:15:30,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:15:30,827 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 299 transitions. [2019-11-07 01:15:30,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-07 01:15:30,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:30,829 INFO L410 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] [2019-11-07 01:15:30,829 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:30,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:30,829 INFO L82 PathProgramCache]: Analyzing trace with hash 574401236, now seen corresponding path program 1 times [2019-11-07 01:15:30,830 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:30,830 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606631073] [2019-11-07 01:15:30,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:30,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:30,918 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606631073] [2019-11-07 01:15:30,918 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:30,918 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:15:30,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440049719] [2019-11-07 01:15:30,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:15:30,919 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:30,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:15:30,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:15:30,920 INFO L87 Difference]: Start difference. First operand 220 states and 299 transitions. Second operand 5 states. [2019-11-07 01:15:31,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:31,359 INFO L93 Difference]: Finished difference Result 467 states and 656 transitions. [2019-11-07 01:15:31,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:15:31,360 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-11-07 01:15:31,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:31,363 INFO L225 Difference]: With dead ends: 467 [2019-11-07 01:15:31,363 INFO L226 Difference]: Without dead ends: 269 [2019-11-07 01:15:31,365 INFO L630 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-11-07 01:15:31,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-11-07 01:15:31,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 220. [2019-11-07 01:15:31,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-11-07 01:15:31,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 298 transitions. [2019-11-07 01:15:31,388 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 298 transitions. Word has length 120 [2019-11-07 01:15:31,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:31,388 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 298 transitions. [2019-11-07 01:15:31,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:15:31,388 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 298 transitions. [2019-11-07 01:15:31,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-07 01:15:31,390 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:31,390 INFO L410 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] [2019-11-07 01:15:31,391 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:31,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:31,391 INFO L82 PathProgramCache]: Analyzing trace with hash -196332330, now seen corresponding path program 1 times [2019-11-07 01:15:31,391 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:31,391 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632511123] [2019-11-07 01:15:31,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:31,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:31,490 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632511123] [2019-11-07 01:15:31,491 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:31,491 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:15:31,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523524830] [2019-11-07 01:15:31,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:15:31,492 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:31,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:15:31,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:15:31,492 INFO L87 Difference]: Start difference. First operand 220 states and 298 transitions. Second operand 5 states. [2019-11-07 01:15:31,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:31,974 INFO L93 Difference]: Finished difference Result 465 states and 650 transitions. [2019-11-07 01:15:31,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:15:31,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-11-07 01:15:31,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:31,976 INFO L225 Difference]: With dead ends: 465 [2019-11-07 01:15:31,976 INFO L226 Difference]: Without dead ends: 267 [2019-11-07 01:15:31,977 INFO L630 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-11-07 01:15:31,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-11-07 01:15:31,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 220. [2019-11-07 01:15:32,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-11-07 01:15:32,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 297 transitions. [2019-11-07 01:15:32,002 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 297 transitions. Word has length 120 [2019-11-07 01:15:32,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:32,002 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 297 transitions. [2019-11-07 01:15:32,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:15:32,003 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 297 transitions. [2019-11-07 01:15:32,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-07 01:15:32,004 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:32,005 INFO L410 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] [2019-11-07 01:15:32,005 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:32,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:32,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1191026028, now seen corresponding path program 1 times [2019-11-07 01:15:32,006 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:32,006 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176223838] [2019-11-07 01:15:32,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:32,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:32,067 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176223838] [2019-11-07 01:15:32,067 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:32,067 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 01:15:32,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313510021] [2019-11-07 01:15:32,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:15:32,068 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:32,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:15:32,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:15:32,069 INFO L87 Difference]: Start difference. First operand 220 states and 297 transitions. Second operand 6 states. [2019-11-07 01:15:32,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:32,119 INFO L93 Difference]: Finished difference Result 436 states and 607 transitions. [2019-11-07 01:15:32,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:15:32,119 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-11-07 01:15:32,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:32,121 INFO L225 Difference]: With dead ends: 436 [2019-11-07 01:15:32,122 INFO L226 Difference]: Without dead ends: 239 [2019-11-07 01:15:32,123 INFO L630 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-11-07 01:15:32,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-11-07 01:15:32,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 225. [2019-11-07 01:15:32,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-11-07 01:15:32,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 302 transitions. [2019-11-07 01:15:32,147 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 302 transitions. Word has length 120 [2019-11-07 01:15:32,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:32,147 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 302 transitions. [2019-11-07 01:15:32,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:15:32,148 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 302 transitions. [2019-11-07 01:15:32,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-07 01:15:32,149 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:32,150 INFO L410 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] [2019-11-07 01:15:32,150 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:32,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:32,150 INFO L82 PathProgramCache]: Analyzing trace with hash 543078422, now seen corresponding path program 1 times [2019-11-07 01:15:32,151 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:32,151 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600423007] [2019-11-07 01:15:32,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:32,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:32,206 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600423007] [2019-11-07 01:15:32,206 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:32,206 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 01:15:32,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324302432] [2019-11-07 01:15:32,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:15:32,207 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:32,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:15:32,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:15:32,208 INFO L87 Difference]: Start difference. First operand 225 states and 302 transitions. Second operand 6 states. [2019-11-07 01:15:32,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:32,253 INFO L93 Difference]: Finished difference Result 443 states and 612 transitions. [2019-11-07 01:15:32,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:15:32,254 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-11-07 01:15:32,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:32,256 INFO L225 Difference]: With dead ends: 443 [2019-11-07 01:15:32,256 INFO L226 Difference]: Without dead ends: 241 [2019-11-07 01:15:32,257 INFO L630 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-11-07 01:15:32,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-07 01:15:32,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 230. [2019-11-07 01:15:32,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-07 01:15:32,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 307 transitions. [2019-11-07 01:15:32,280 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 307 transitions. Word has length 120 [2019-11-07 01:15:32,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:32,280 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 307 transitions. [2019-11-07 01:15:32,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:15:32,280 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 307 transitions. [2019-11-07 01:15:32,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-07 01:15:32,282 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:32,282 INFO L410 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] [2019-11-07 01:15:32,282 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:32,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:32,283 INFO L82 PathProgramCache]: Analyzing trace with hash -188889004, now seen corresponding path program 1 times [2019-11-07 01:15:32,283 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:32,283 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967987455] [2019-11-07 01:15:32,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:32,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:32,356 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967987455] [2019-11-07 01:15:32,356 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:32,356 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:15:32,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413240220] [2019-11-07 01:15:32,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:15:32,357 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:32,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:15:32,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:15:32,357 INFO L87 Difference]: Start difference. First operand 230 states and 307 transitions. Second operand 4 states. [2019-11-07 01:15:32,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:32,615 INFO L93 Difference]: Finished difference Result 637 states and 877 transitions. [2019-11-07 01:15:32,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:15:32,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-11-07 01:15:32,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:32,619 INFO L225 Difference]: With dead ends: 637 [2019-11-07 01:15:32,619 INFO L226 Difference]: Without dead ends: 430 [2019-11-07 01:15:32,621 INFO L630 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-11-07 01:15:32,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-11-07 01:15:32,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 425. [2019-11-07 01:15:32,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-11-07 01:15:32,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 566 transitions. [2019-11-07 01:15:32,660 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 566 transitions. Word has length 120 [2019-11-07 01:15:32,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:32,660 INFO L462 AbstractCegarLoop]: Abstraction has 425 states and 566 transitions. [2019-11-07 01:15:32,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:15:32,661 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 566 transitions. [2019-11-07 01:15:32,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-07 01:15:32,662 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:32,662 INFO L410 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] [2019-11-07 01:15:32,663 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:32,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:32,663 INFO L82 PathProgramCache]: Analyzing trace with hash 388039637, now seen corresponding path program 1 times [2019-11-07 01:15:32,663 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:32,663 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575340436] [2019-11-07 01:15:32,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:32,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:32,723 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575340436] [2019-11-07 01:15:32,723 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:32,723 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 01:15:32,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648550627] [2019-11-07 01:15:32,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:15:32,725 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:32,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:15:32,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:15:32,725 INFO L87 Difference]: Start difference. First operand 425 states and 566 transitions. Second operand 6 states. [2019-11-07 01:15:32,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:32,782 INFO L93 Difference]: Finished difference Result 840 states and 1145 transitions. [2019-11-07 01:15:32,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:15:32,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-11-07 01:15:32,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:32,786 INFO L225 Difference]: With dead ends: 840 [2019-11-07 01:15:32,786 INFO L226 Difference]: Without dead ends: 438 [2019-11-07 01:15:32,788 INFO L630 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-11-07 01:15:32,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-11-07 01:15:32,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 430. [2019-11-07 01:15:32,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-11-07 01:15:32,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 570 transitions. [2019-11-07 01:15:32,827 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 570 transitions. Word has length 120 [2019-11-07 01:15:32,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:32,828 INFO L462 AbstractCegarLoop]: Abstraction has 430 states and 570 transitions. [2019-11-07 01:15:32,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:15:32,828 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 570 transitions. [2019-11-07 01:15:32,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-07 01:15:32,830 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:32,830 INFO L410 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] [2019-11-07 01:15:32,830 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:32,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:32,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1648956887, now seen corresponding path program 1 times [2019-11-07 01:15:32,831 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:32,831 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130291707] [2019-11-07 01:15:32,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:32,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:32,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:32,907 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130291707] [2019-11-07 01:15:32,907 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:32,908 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:15:32,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766607482] [2019-11-07 01:15:32,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:15:32,909 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:32,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:15:32,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:15:32,910 INFO L87 Difference]: Start difference. First operand 430 states and 570 transitions. Second operand 4 states. [2019-11-07 01:15:33,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:33,215 INFO L93 Difference]: Finished difference Result 1231 states and 1684 transitions. [2019-11-07 01:15:33,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:15:33,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-11-07 01:15:33,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:33,221 INFO L225 Difference]: With dead ends: 1231 [2019-11-07 01:15:33,222 INFO L226 Difference]: Without dead ends: 824 [2019-11-07 01:15:33,224 INFO L630 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-11-07 01:15:33,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2019-11-07 01:15:33,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 817. [2019-11-07 01:15:33,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-11-07 01:15:33,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1080 transitions. [2019-11-07 01:15:33,308 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1080 transitions. Word has length 120 [2019-11-07 01:15:33,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:33,309 INFO L462 AbstractCegarLoop]: Abstraction has 817 states and 1080 transitions. [2019-11-07 01:15:33,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:15:33,309 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1080 transitions. [2019-11-07 01:15:33,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-07 01:15:33,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:33,311 INFO L410 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] [2019-11-07 01:15:33,311 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:33,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:33,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1751758134, now seen corresponding path program 1 times [2019-11-07 01:15:33,312 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:33,312 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724208477] [2019-11-07 01:15:33,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:33,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:33,412 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724208477] [2019-11-07 01:15:33,412 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:33,412 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 01:15:33,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787694980] [2019-11-07 01:15:33,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:15:33,413 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:33,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:15:33,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:15:33,414 INFO L87 Difference]: Start difference. First operand 817 states and 1080 transitions. Second operand 6 states. [2019-11-07 01:15:33,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:33,506 INFO L93 Difference]: Finished difference Result 1631 states and 2205 transitions. [2019-11-07 01:15:33,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:15:33,507 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-11-07 01:15:33,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:33,513 INFO L225 Difference]: With dead ends: 1631 [2019-11-07 01:15:33,513 INFO L226 Difference]: Without dead ends: 837 [2019-11-07 01:15:33,517 INFO L630 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-11-07 01:15:33,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2019-11-07 01:15:33,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 827. [2019-11-07 01:15:33,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2019-11-07 01:15:33,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1088 transitions. [2019-11-07 01:15:33,589 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1088 transitions. Word has length 120 [2019-11-07 01:15:33,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:33,590 INFO L462 AbstractCegarLoop]: Abstraction has 827 states and 1088 transitions. [2019-11-07 01:15:33,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:15:33,590 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1088 transitions. [2019-11-07 01:15:33,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-07 01:15:33,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:33,592 INFO L410 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] [2019-11-07 01:15:33,593 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:33,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:33,593 INFO L82 PathProgramCache]: Analyzing trace with hash -604047116, now seen corresponding path program 1 times [2019-11-07 01:15:33,593 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:33,593 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562242932] [2019-11-07 01:15:33,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:33,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:33,657 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562242932] [2019-11-07 01:15:33,657 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:33,657 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:15:33,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881572817] [2019-11-07 01:15:33,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:15:33,658 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:33,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:15:33,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:15:33,659 INFO L87 Difference]: Start difference. First operand 827 states and 1088 transitions. Second operand 4 states. [2019-11-07 01:15:33,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:33,996 INFO L93 Difference]: Finished difference Result 2411 states and 3286 transitions. [2019-11-07 01:15:33,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:15:33,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-11-07 01:15:33,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:34,008 INFO L225 Difference]: With dead ends: 2411 [2019-11-07 01:15:34,008 INFO L226 Difference]: Without dead ends: 1607 [2019-11-07 01:15:34,015 INFO L630 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-11-07 01:15:34,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2019-11-07 01:15:34,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1598. [2019-11-07 01:15:34,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1598 states. [2019-11-07 01:15:34,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2097 transitions. [2019-11-07 01:15:34,165 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2097 transitions. Word has length 120 [2019-11-07 01:15:34,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:34,166 INFO L462 AbstractCegarLoop]: Abstraction has 1598 states and 2097 transitions. [2019-11-07 01:15:34,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:15:34,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2097 transitions. [2019-11-07 01:15:34,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-07 01:15:34,170 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:34,170 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:15:34,171 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:34,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:34,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1761845548, now seen corresponding path program 1 times [2019-11-07 01:15:34,171 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:34,171 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816802294] [2019-11-07 01:15:34,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:34,255 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-07 01:15:34,264 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816802294] [2019-11-07 01:15:34,265 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:34,269 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 01:15:34,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454949846] [2019-11-07 01:15:34,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:15:34,270 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:34,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:15:34,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:15:34,271 INFO L87 Difference]: Start difference. First operand 1598 states and 2097 transitions. Second operand 6 states. [2019-11-07 01:15:34,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:34,415 INFO L93 Difference]: Finished difference Result 3201 states and 4303 transitions. [2019-11-07 01:15:34,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:15:34,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-11-07 01:15:34,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:34,428 INFO L225 Difference]: With dead ends: 3201 [2019-11-07 01:15:34,428 INFO L226 Difference]: Without dead ends: 1626 [2019-11-07 01:15:34,435 INFO L630 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-11-07 01:15:34,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-11-07 01:15:34,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1618. [2019-11-07 01:15:34,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1618 states. [2019-11-07 01:15:34,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2113 transitions. [2019-11-07 01:15:34,565 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2113 transitions. Word has length 141 [2019-11-07 01:15:34,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:34,566 INFO L462 AbstractCegarLoop]: Abstraction has 1618 states and 2113 transitions. [2019-11-07 01:15:34,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:15:34,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2113 transitions. [2019-11-07 01:15:34,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-07 01:15:34,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:34,569 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:15:34,569 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:34,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:34,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1560021614, now seen corresponding path program 1 times [2019-11-07 01:15:34,570 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:34,570 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749634074] [2019-11-07 01:15:34,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:34,676 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-07 01:15:34,677 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749634074] [2019-11-07 01:15:34,677 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:34,677 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:15:34,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015808511] [2019-11-07 01:15:34,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:15:34,679 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:34,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:15:34,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:15:34,680 INFO L87 Difference]: Start difference. First operand 1618 states and 2113 transitions. Second operand 5 states. [2019-11-07 01:15:35,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:35,311 INFO L93 Difference]: Finished difference Result 3212 states and 4210 transitions. [2019-11-07 01:15:35,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:15:35,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-11-07 01:15:35,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:35,326 INFO L225 Difference]: With dead ends: 3212 [2019-11-07 01:15:35,326 INFO L226 Difference]: Without dead ends: 1618 [2019-11-07 01:15:35,332 INFO L630 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-11-07 01:15:35,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2019-11-07 01:15:35,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1618. [2019-11-07 01:15:35,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1618 states. [2019-11-07 01:15:35,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2097 transitions. [2019-11-07 01:15:35,470 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2097 transitions. Word has length 141 [2019-11-07 01:15:35,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:35,470 INFO L462 AbstractCegarLoop]: Abstraction has 1618 states and 2097 transitions. [2019-11-07 01:15:35,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:15:35,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2097 transitions. [2019-11-07 01:15:35,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-07 01:15:35,473 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:35,473 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:15:35,473 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:35,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:35,474 INFO L82 PathProgramCache]: Analyzing trace with hash -173236204, now seen corresponding path program 1 times [2019-11-07 01:15:35,474 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:35,474 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763108] [2019-11-07 01:15:35,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:35,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:35,563 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-07 01:15:35,563 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763108] [2019-11-07 01:15:35,564 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:35,564 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:15:35,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868671064] [2019-11-07 01:15:35,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:15:35,565 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:35,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:15:35,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:15:35,565 INFO L87 Difference]: Start difference. First operand 1618 states and 2097 transitions. Second operand 5 states. [2019-11-07 01:15:36,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:36,119 INFO L93 Difference]: Finished difference Result 3212 states and 4178 transitions. [2019-11-07 01:15:36,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:15:36,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-11-07 01:15:36,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:36,134 INFO L225 Difference]: With dead ends: 3212 [2019-11-07 01:15:36,134 INFO L226 Difference]: Without dead ends: 1618 [2019-11-07 01:15:36,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:15:36,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2019-11-07 01:15:36,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1618. [2019-11-07 01:15:36,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1618 states. [2019-11-07 01:15:36,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2081 transitions. [2019-11-07 01:15:36,332 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2081 transitions. Word has length 141 [2019-11-07 01:15:36,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:36,333 INFO L462 AbstractCegarLoop]: Abstraction has 1618 states and 2081 transitions. [2019-11-07 01:15:36,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:15:36,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2081 transitions. [2019-11-07 01:15:36,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-07 01:15:36,336 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:36,336 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:15:36,337 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:36,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:36,337 INFO L82 PathProgramCache]: Analyzing trace with hash 702782802, now seen corresponding path program 1 times [2019-11-07 01:15:36,337 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:36,338 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010684038] [2019-11-07 01:15:36,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:36,431 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-07 01:15:36,432 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010684038] [2019-11-07 01:15:36,432 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:36,432 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:15:36,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066354338] [2019-11-07 01:15:36,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:15:36,434 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:36,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:15:36,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:15:36,434 INFO L87 Difference]: Start difference. First operand 1618 states and 2081 transitions. Second operand 5 states. [2019-11-07 01:15:36,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:36,969 INFO L93 Difference]: Finished difference Result 3212 states and 4146 transitions. [2019-11-07 01:15:36,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:15:36,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-11-07 01:15:36,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:36,981 INFO L225 Difference]: With dead ends: 3212 [2019-11-07 01:15:36,981 INFO L226 Difference]: Without dead ends: 1618 [2019-11-07 01:15:36,989 INFO L630 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-11-07 01:15:36,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2019-11-07 01:15:37,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1618. [2019-11-07 01:15:37,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1618 states. [2019-11-07 01:15:37,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2065 transitions. [2019-11-07 01:15:37,176 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2065 transitions. Word has length 141 [2019-11-07 01:15:37,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:37,177 INFO L462 AbstractCegarLoop]: Abstraction has 1618 states and 2065 transitions. [2019-11-07 01:15:37,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:15:37,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2065 transitions. [2019-11-07 01:15:37,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-07 01:15:37,180 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:37,180 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:15:37,180 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:37,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:37,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1146683476, now seen corresponding path program 1 times [2019-11-07 01:15:37,181 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:37,181 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43870957] [2019-11-07 01:15:37,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:37,244 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-07 01:15:37,244 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43870957] [2019-11-07 01:15:37,244 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:37,244 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:15:37,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322029310] [2019-11-07 01:15:37,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:15:37,245 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:37,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:15:37,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:15:37,246 INFO L87 Difference]: Start difference. First operand 1618 states and 2065 transitions. Second operand 5 states. [2019-11-07 01:15:37,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:37,943 INFO L93 Difference]: Finished difference Result 4062 states and 5227 transitions. [2019-11-07 01:15:37,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:15:37,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-11-07 01:15:37,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:37,961 INFO L225 Difference]: With dead ends: 4062 [2019-11-07 01:15:37,962 INFO L226 Difference]: Without dead ends: 2468 [2019-11-07 01:15:37,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:15:37,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2468 states. [2019-11-07 01:15:38,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2468 to 2324. [2019-11-07 01:15:38,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2324 states. [2019-11-07 01:15:38,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 2324 states and 2887 transitions. [2019-11-07 01:15:38,268 INFO L78 Accepts]: Start accepts. Automaton has 2324 states and 2887 transitions. Word has length 141 [2019-11-07 01:15:38,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:38,268 INFO L462 AbstractCegarLoop]: Abstraction has 2324 states and 2887 transitions. [2019-11-07 01:15:38,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:15:38,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 2887 transitions. [2019-11-07 01:15:38,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-07 01:15:38,272 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:38,272 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:15:38,273 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:38,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:38,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1609943790, now seen corresponding path program 1 times [2019-11-07 01:15:38,274 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:38,274 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317347052] [2019-11-07 01:15:38,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:38,356 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-07 01:15:38,356 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317347052] [2019-11-07 01:15:38,357 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:38,357 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:15:38,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108121216] [2019-11-07 01:15:38,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:15:38,362 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:38,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:15:38,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:15:38,363 INFO L87 Difference]: Start difference. First operand 2324 states and 2887 transitions. Second operand 5 states. [2019-11-07 01:15:39,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:39,294 INFO L93 Difference]: Finished difference Result 5805 states and 7585 transitions. [2019-11-07 01:15:39,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:15:39,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-11-07 01:15:39,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:39,322 INFO L225 Difference]: With dead ends: 5805 [2019-11-07 01:15:39,323 INFO L226 Difference]: Without dead ends: 3505 [2019-11-07 01:15:39,340 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:15:39,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3505 states. [2019-11-07 01:15:39,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3505 to 2820. [2019-11-07 01:15:39,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2820 states. [2019-11-07 01:15:39,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2820 states to 2820 states and 3415 transitions. [2019-11-07 01:15:39,746 INFO L78 Accepts]: Start accepts. Automaton has 2820 states and 3415 transitions. Word has length 141 [2019-11-07 01:15:39,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:39,746 INFO L462 AbstractCegarLoop]: Abstraction has 2820 states and 3415 transitions. [2019-11-07 01:15:39,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:15:39,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2820 states and 3415 transitions. [2019-11-07 01:15:39,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-07 01:15:39,749 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:39,749 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:15:39,750 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:39,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:39,750 INFO L82 PathProgramCache]: Analyzing trace with hash 656437396, now seen corresponding path program 1 times [2019-11-07 01:15:39,750 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:39,750 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905940609] [2019-11-07 01:15:39,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:39,817 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-07 01:15:39,818 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905940609] [2019-11-07 01:15:39,818 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:39,818 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:15:39,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130664972] [2019-11-07 01:15:39,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:15:39,819 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:39,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:15:39,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:15:39,820 INFO L87 Difference]: Start difference. First operand 2820 states and 3415 transitions. Second operand 5 states. [2019-11-07 01:15:40,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:40,717 INFO L93 Difference]: Finished difference Result 6425 states and 8158 transitions. [2019-11-07 01:15:40,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:15:40,719 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-11-07 01:15:40,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:40,740 INFO L225 Difference]: With dead ends: 6425 [2019-11-07 01:15:40,740 INFO L226 Difference]: Without dead ends: 3631 [2019-11-07 01:15:40,753 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 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-11-07 01:15:40,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3631 states. [2019-11-07 01:15:41,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3631 to 3266. [2019-11-07 01:15:41,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3266 states. [2019-11-07 01:15:41,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 3871 transitions. [2019-11-07 01:15:41,115 INFO L78 Accepts]: Start accepts. Automaton has 3266 states and 3871 transitions. Word has length 141 [2019-11-07 01:15:41,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:41,115 INFO L462 AbstractCegarLoop]: Abstraction has 3266 states and 3871 transitions. [2019-11-07 01:15:41,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:15:41,116 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 3871 transitions. [2019-11-07 01:15:41,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-07 01:15:41,118 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:41,118 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:15:41,119 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:41,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:41,119 INFO L82 PathProgramCache]: Analyzing trace with hash 175357138, now seen corresponding path program 1 times [2019-11-07 01:15:41,119 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:41,119 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869432607] [2019-11-07 01:15:41,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:41,197 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-07 01:15:41,197 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869432607] [2019-11-07 01:15:41,198 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:41,198 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:15:41,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954898726] [2019-11-07 01:15:41,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:15:41,200 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:41,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:15:41,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:15:41,201 INFO L87 Difference]: Start difference. First operand 3266 states and 3871 transitions. Second operand 5 states. [2019-11-07 01:15:42,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:42,014 INFO L93 Difference]: Finished difference Result 6853 states and 8371 transitions. [2019-11-07 01:15:42,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:15:42,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-11-07 01:15:42,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:42,035 INFO L225 Difference]: With dead ends: 6853 [2019-11-07 01:15:42,035 INFO L226 Difference]: Without dead ends: 3613 [2019-11-07 01:15:42,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 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-11-07 01:15:42,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3613 states. [2019-11-07 01:15:42,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3613 to 3448. [2019-11-07 01:15:42,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3448 states. [2019-11-07 01:15:42,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3448 states to 3448 states and 4017 transitions. [2019-11-07 01:15:42,394 INFO L78 Accepts]: Start accepts. Automaton has 3448 states and 4017 transitions. Word has length 141 [2019-11-07 01:15:42,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:42,394 INFO L462 AbstractCegarLoop]: Abstraction has 3448 states and 4017 transitions. [2019-11-07 01:15:42,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:15:42,395 INFO L276 IsEmpty]: Start isEmpty. Operand 3448 states and 4017 transitions. [2019-11-07 01:15:42,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-07 01:15:42,399 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:42,400 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:15:42,400 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:42,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:42,400 INFO L82 PathProgramCache]: Analyzing trace with hash 159838420, now seen corresponding path program 1 times [2019-11-07 01:15:42,401 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:42,401 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627841517] [2019-11-07 01:15:42,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:42,450 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-07 01:15:42,450 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627841517] [2019-11-07 01:15:42,451 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605125985] [2019-11-07 01:15:42,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:15:42,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:42,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 01:15:42,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:15:42,712 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-07 01:15:42,713 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:15:42,872 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-07 01:15:42,873 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 01:15:42,873 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 3 [2019-11-07 01:15:42,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668712261] [2019-11-07 01:15:42,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:15:42,876 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:42,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:15:42,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:15:42,877 INFO L87 Difference]: Start difference. First operand 3448 states and 4017 transitions. Second operand 3 states. [2019-11-07 01:15:43,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:43,401 INFO L93 Difference]: Finished difference Result 10063 states and 11933 transitions. [2019-11-07 01:15:43,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:15:43,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-11-07 01:15:43,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:43,436 INFO L225 Difference]: With dead ends: 10063 [2019-11-07 01:15:43,437 INFO L226 Difference]: Without dead ends: 6641 [2019-11-07 01:15:43,448 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:15:43,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6641 states. [2019-11-07 01:15:43,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6641 to 6299. [2019-11-07 01:15:43,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6299 states. [2019-11-07 01:15:43,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6299 states to 6299 states and 7496 transitions. [2019-11-07 01:15:43,931 INFO L78 Accepts]: Start accepts. Automaton has 6299 states and 7496 transitions. Word has length 141 [2019-11-07 01:15:43,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:43,932 INFO L462 AbstractCegarLoop]: Abstraction has 6299 states and 7496 transitions. [2019-11-07 01:15:43,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:15:43,933 INFO L276 IsEmpty]: Start isEmpty. Operand 6299 states and 7496 transitions. [2019-11-07 01:15:43,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-07 01:15:43,938 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:43,938 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:15:44,142 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:15:44,143 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:44,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:44,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1140993030, now seen corresponding path program 1 times [2019-11-07 01:15:44,144 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:44,144 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249432311] [2019-11-07 01:15:44,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:44,197 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-07 01:15:44,198 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249432311] [2019-11-07 01:15:44,198 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:44,198 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:15:44,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000244276] [2019-11-07 01:15:44,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:15:44,199 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:44,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:15:44,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:15:44,200 INFO L87 Difference]: Start difference. First operand 6299 states and 7496 transitions. Second operand 3 states. [2019-11-07 01:15:45,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:45,047 INFO L93 Difference]: Finished difference Result 18759 states and 22655 transitions. [2019-11-07 01:15:45,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:15:45,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-11-07 01:15:45,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:45,087 INFO L225 Difference]: With dead ends: 18759 [2019-11-07 01:15:45,087 INFO L226 Difference]: Without dead ends: 9487 [2019-11-07 01:15:45,114 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:15:45,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9487 states. [2019-11-07 01:15:45,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9487 to 9487. [2019-11-07 01:15:45,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9487 states. [2019-11-07 01:15:45,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9487 states to 9487 states and 11482 transitions. [2019-11-07 01:15:45,888 INFO L78 Accepts]: Start accepts. Automaton has 9487 states and 11482 transitions. Word has length 143 [2019-11-07 01:15:45,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:45,888 INFO L462 AbstractCegarLoop]: Abstraction has 9487 states and 11482 transitions. [2019-11-07 01:15:45,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:15:45,888 INFO L276 IsEmpty]: Start isEmpty. Operand 9487 states and 11482 transitions. [2019-11-07 01:15:45,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-07 01:15:45,909 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:45,909 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:15:45,909 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:45,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:45,910 INFO L82 PathProgramCache]: Analyzing trace with hash -868057022, now seen corresponding path program 1 times [2019-11-07 01:15:45,910 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:45,910 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909500289] [2019-11-07 01:15:45,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:45,984 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-07 01:15:45,984 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909500289] [2019-11-07 01:15:45,984 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:45,985 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:15:45,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782808813] [2019-11-07 01:15:45,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:15:45,986 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:45,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:15:45,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:15:45,986 INFO L87 Difference]: Start difference. First operand 9487 states and 11482 transitions. Second operand 4 states. [2019-11-07 01:15:46,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:46,610 INFO L93 Difference]: Finished difference Result 17826 states and 22004 transitions. [2019-11-07 01:15:46,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:15:46,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2019-11-07 01:15:46,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:47,243 INFO L225 Difference]: With dead ends: 17826 [2019-11-07 01:15:47,244 INFO L226 Difference]: Without dead ends: 8376 [2019-11-07 01:15:47,260 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-11-07 01:15:47,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8376 states. [2019-11-07 01:15:47,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8376 to 8364. [2019-11-07 01:15:47,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8364 states. [2019-11-07 01:15:47,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8364 states to 8364 states and 9782 transitions. [2019-11-07 01:15:47,821 INFO L78 Accepts]: Start accepts. Automaton has 8364 states and 9782 transitions. Word has length 204 [2019-11-07 01:15:47,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:47,822 INFO L462 AbstractCegarLoop]: Abstraction has 8364 states and 9782 transitions. [2019-11-07 01:15:47,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:15:47,822 INFO L276 IsEmpty]: Start isEmpty. Operand 8364 states and 9782 transitions. [2019-11-07 01:15:47,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-11-07 01:15:47,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:47,845 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:15:47,845 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:47,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:47,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1126843135, now seen corresponding path program 1 times [2019-11-07 01:15:47,846 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:47,846 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84996900] [2019-11-07 01:15:47,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:47,903 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-07 01:15:47,903 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84996900] [2019-11-07 01:15:47,903 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:15:47,904 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:15:47,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707031063] [2019-11-07 01:15:47,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:15:47,904 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:47,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:15:47,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:15:47,905 INFO L87 Difference]: Start difference. First operand 8364 states and 9782 transitions. Second operand 4 states. [2019-11-07 01:15:48,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:48,476 INFO L93 Difference]: Finished difference Result 16693 states and 19508 transitions. [2019-11-07 01:15:48,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:15:48,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2019-11-07 01:15:48,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:48,503 INFO L225 Difference]: With dead ends: 16693 [2019-11-07 01:15:48,503 INFO L226 Difference]: Without dead ends: 8353 [2019-11-07 01:15:48,517 INFO L630 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-11-07 01:15:48,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8353 states. [2019-11-07 01:15:49,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8353 to 8353. [2019-11-07 01:15:49,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8353 states. [2019-11-07 01:15:49,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8353 states to 8353 states and 9758 transitions. [2019-11-07 01:15:49,043 INFO L78 Accepts]: Start accepts. Automaton has 8353 states and 9758 transitions. Word has length 213 [2019-11-07 01:15:49,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:49,043 INFO L462 AbstractCegarLoop]: Abstraction has 8353 states and 9758 transitions. [2019-11-07 01:15:49,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:15:49,043 INFO L276 IsEmpty]: Start isEmpty. Operand 8353 states and 9758 transitions. [2019-11-07 01:15:49,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-11-07 01:15:49,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:49,071 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:15:49,072 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:49,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:49,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1088029884, now seen corresponding path program 1 times [2019-11-07 01:15:49,072 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:49,072 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074737840] [2019-11-07 01:15:49,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:49,143 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-11-07 01:15:49,143 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074737840] [2019-11-07 01:15:49,144 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288987659] [2019-11-07 01:15:49,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:15:49,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:49,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-07 01:15:49,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:15:49,372 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:15:49,372 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:15:49,595 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-11-07 01:15:49,595 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 01:15:49,596 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 4 [2019-11-07 01:15:49,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483029756] [2019-11-07 01:15:49,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:15:49,598 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:49,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:15:49,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:15:49,599 INFO L87 Difference]: Start difference. First operand 8353 states and 9758 transitions. Second operand 3 states. [2019-11-07 01:15:51,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:51,027 INFO L93 Difference]: Finished difference Result 21016 states and 24930 transitions. [2019-11-07 01:15:51,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:15:51,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-11-07 01:15:51,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:51,070 INFO L225 Difference]: With dead ends: 21016 [2019-11-07 01:15:51,070 INFO L226 Difference]: Without dead ends: 9719 [2019-11-07 01:15:51,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:15:51,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9719 states. [2019-11-07 01:15:52,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9719 to 9713. [2019-11-07 01:15:52,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9713 states. [2019-11-07 01:15:52,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9713 states to 9713 states and 11471 transitions. [2019-11-07 01:15:52,125 INFO L78 Accepts]: Start accepts. Automaton has 9713 states and 11471 transitions. Word has length 213 [2019-11-07 01:15:52,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:15:52,126 INFO L462 AbstractCegarLoop]: Abstraction has 9713 states and 11471 transitions. [2019-11-07 01:15:52,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:15:52,126 INFO L276 IsEmpty]: Start isEmpty. Operand 9713 states and 11471 transitions. [2019-11-07 01:15:52,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-11-07 01:15:52,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:15:52,156 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:15:52,361 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:15:52,362 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:15:52,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:15:52,363 INFO L82 PathProgramCache]: Analyzing trace with hash 638848330, now seen corresponding path program 1 times [2019-11-07 01:15:52,363 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:15:52,363 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43470042] [2019-11-07 01:15:52,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:15:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:52,594 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 37 proven. 69 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-11-07 01:15:52,595 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43470042] [2019-11-07 01:15:52,595 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665731000] [2019-11-07 01:15:52,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:15:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:15:52,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 1744 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 01:15:52,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:15:53,034 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-11-07 01:15:53,034 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:15:53,471 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 61 proven. 41 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2019-11-07 01:15:53,471 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 01:15:53,471 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 4] total 6 [2019-11-07 01:15:53,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559878171] [2019-11-07 01:15:53,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:15:53,473 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:15:53,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:15:53,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:15:53,473 INFO L87 Difference]: Start difference. First operand 9713 states and 11471 transitions. Second operand 3 states. [2019-11-07 01:15:54,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:15:54,178 INFO L93 Difference]: Finished difference Result 24605 states and 29872 transitions. [2019-11-07 01:15:54,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:15:54,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 433 [2019-11-07 01:15:54,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:15:54,233 INFO L225 Difference]: With dead ends: 24605 [2019-11-07 01:15:54,233 INFO L226 Difference]: Without dead ends: 14918 [2019-11-07 01:15:54,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 872 GetRequests, 868 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:15:54,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14918 states.