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/kundu1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:29:05,585 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:29:05,587 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:29:05,602 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:29:05,602 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:29:05,604 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:29:05,606 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:29:05,614 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:29:05,618 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:29:05,622 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:29:05,622 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:29:05,624 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:29:05,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:29:05,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:29:05,628 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:29:05,629 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:29:05,630 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:29:05,632 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:29:05,633 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:29:05,638 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:29:05,641 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:29:05,644 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:29:05,646 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:29:05,647 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:29:05,649 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:29:05,649 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:29:05,649 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:29:05,650 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:29:05,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:29:05,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:29:05,653 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:29:05,653 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:29:05,654 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:29:05,655 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:29:05,656 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:29:05,656 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:29:05,657 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:29:05,657 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:29:05,657 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:29:05,658 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:29:05,659 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:29:05,660 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:29:05,695 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:29:05,696 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:29:05,697 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:29:05,697 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:29:05,697 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:29:05,697 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:29:05,698 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:29:05,698 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:29:05,702 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:29:05,702 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:29:05,703 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:29:05,703 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:29:05,703 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:29:05,703 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:29:05,703 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:29:05,703 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:29:05,704 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:29:05,704 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:29:05,704 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:29:05,704 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:29:05,704 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:29:05,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:29:05,705 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:29:05,705 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:29:05,706 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:29:05,707 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:29:05,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:29:05,707 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:29:05,707 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:29:05,961 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:29:05,974 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:29:05,977 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:29:05,979 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:29:05,979 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:29:05,980 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/kundu1.cil.c [2019-10-13 21:29:06,039 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2edcdb4b3/e17af30c303a410783a31a51e8098cea/FLAGc0ee9e55b [2019-10-13 21:29:06,513 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:29:06,514 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/kundu1.cil.c [2019-10-13 21:29:06,523 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2edcdb4b3/e17af30c303a410783a31a51e8098cea/FLAGc0ee9e55b [2019-10-13 21:29:06,869 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2edcdb4b3/e17af30c303a410783a31a51e8098cea [2019-10-13 21:29:06,879 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:29:06,881 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:29:06,883 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:29:06,884 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:29:06,887 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:29:06,888 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:29:06" (1/1) ... [2019-10-13 21:29:06,891 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3534b1cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:06, skipping insertion in model container [2019-10-13 21:29:06,891 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:29:06" (1/1) ... [2019-10-13 21:29:06,897 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:29:06,929 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:29:07,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:29:07,160 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:29:07,295 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:29:07,324 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:29:07,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:07 WrapperNode [2019-10-13 21:29:07,325 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:29:07,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:29:07,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:29:07,325 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:29:07,338 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:07" (1/1) ... [2019-10-13 21:29:07,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:07" (1/1) ... [2019-10-13 21:29:07,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:07" (1/1) ... [2019-10-13 21:29:07,346 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:07" (1/1) ... [2019-10-13 21:29:07,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:07" (1/1) ... [2019-10-13 21:29:07,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:07" (1/1) ... [2019-10-13 21:29:07,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:07" (1/1) ... [2019-10-13 21:29:07,383 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:29:07,385 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:29:07,385 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:29:07,385 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:29:07,386 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:29:07,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:29:07,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:29:07,435 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-13 21:29:07,435 INFO L138 BoogieDeclarations]: Found implementation of procedure read_data [2019-10-13 21:29:07,436 INFO L138 BoogieDeclarations]: Found implementation of procedure write_data [2019-10-13 21:29:07,436 INFO L138 BoogieDeclarations]: Found implementation of procedure P_1 [2019-10-13 21:29:07,436 INFO L138 BoogieDeclarations]: Found implementation of procedure is_P_1_triggered [2019-10-13 21:29:07,437 INFO L138 BoogieDeclarations]: Found implementation of procedure C_1 [2019-10-13 21:29:07,437 INFO L138 BoogieDeclarations]: Found implementation of procedure is_C_1_triggered [2019-10-13 21:29:07,437 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-13 21:29:07,437 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-13 21:29:07,437 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-13 21:29:07,438 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-13 21:29:07,438 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-13 21:29:07,438 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-13 21:29:07,438 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-13 21:29:07,438 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-13 21:29:07,438 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-13 21:29:07,439 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-13 21:29:07,439 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-13 21:29:07,439 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-13 21:29:07,439 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-13 21:29:07,439 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:29:07,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:29:07,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:29:07,440 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-13 21:29:07,440 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-13 21:29:07,440 INFO L130 BoogieDeclarations]: Found specification of procedure read_data [2019-10-13 21:29:07,440 INFO L130 BoogieDeclarations]: Found specification of procedure write_data [2019-10-13 21:29:07,440 INFO L130 BoogieDeclarations]: Found specification of procedure P_1 [2019-10-13 21:29:07,441 INFO L130 BoogieDeclarations]: Found specification of procedure is_P_1_triggered [2019-10-13 21:29:07,441 INFO L130 BoogieDeclarations]: Found specification of procedure C_1 [2019-10-13 21:29:07,441 INFO L130 BoogieDeclarations]: Found specification of procedure is_C_1_triggered [2019-10-13 21:29:07,441 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-13 21:29:07,441 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-13 21:29:07,441 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-13 21:29:07,442 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-13 21:29:07,442 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-13 21:29:07,442 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-13 21:29:07,442 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-13 21:29:07,442 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-13 21:29:07,442 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-13 21:29:07,442 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-13 21:29:07,443 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-13 21:29:07,443 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-13 21:29:07,443 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:29:07,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:29:07,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:29:07,970 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:29:07,970 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-13 21:29:07,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:29:07 BoogieIcfgContainer [2019-10-13 21:29:07,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:29:07,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:29:07,974 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:29:07,977 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:29:07,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:29:06" (1/3) ... [2019-10-13 21:29:07,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@617aed9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:29:07, skipping insertion in model container [2019-10-13 21:29:07,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:07" (2/3) ... [2019-10-13 21:29:07,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@617aed9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:29:07, skipping insertion in model container [2019-10-13 21:29:07,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:29:07" (3/3) ... [2019-10-13 21:29:07,984 INFO L109 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2019-10-13 21:29:07,994 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:29:08,007 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:29:08,018 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:29:08,043 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:29:08,044 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:29:08,044 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:29:08,044 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:29:08,044 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:29:08,044 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:29:08,044 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:29:08,045 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:29:08,065 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-10-13 21:29:08,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-13 21:29:08,074 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:08,075 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:08,077 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:08,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:08,082 INFO L82 PathProgramCache]: Analyzing trace with hash -798642762, now seen corresponding path program 1 times [2019-10-13 21:29:08,089 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:08,090 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689284750] [2019-10-13 21:29:08,090 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:08,091 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:08,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:08,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:08,429 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689284750] [2019-10-13 21:29:08,430 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:08,431 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:29:08,431 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306646361] [2019-10-13 21:29:08,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:29:08,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:08,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:29:08,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:29:08,462 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 4 states. [2019-10-13 21:29:08,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:08,946 INFO L93 Difference]: Finished difference Result 402 states and 558 transitions. [2019-10-13 21:29:08,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:29:08,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-10-13 21:29:08,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:08,964 INFO L225 Difference]: With dead ends: 402 [2019-10-13 21:29:08,964 INFO L226 Difference]: Without dead ends: 258 [2019-10-13 21:29:08,970 INFO L600 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-10-13 21:29:08,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-10-13 21:29:09,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 246. [2019-10-13 21:29:09,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-10-13 21:29:09,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 315 transitions. [2019-10-13 21:29:09,041 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 315 transitions. Word has length 72 [2019-10-13 21:29:09,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:09,042 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 315 transitions. [2019-10-13 21:29:09,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:29:09,042 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 315 transitions. [2019-10-13 21:29:09,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-13 21:29:09,046 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:09,047 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:09,047 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:09,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:09,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1672120457, now seen corresponding path program 1 times [2019-10-13 21:29:09,048 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:09,048 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487890753] [2019-10-13 21:29:09,048 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:09,048 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:09,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:09,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:09,187 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487890753] [2019-10-13 21:29:09,188 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:09,188 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:29:09,188 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957093871] [2019-10-13 21:29:09,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:29:09,194 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:09,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:29:09,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:29:09,195 INFO L87 Difference]: Start difference. First operand 246 states and 315 transitions. Second operand 4 states. [2019-10-13 21:29:09,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:09,469 INFO L93 Difference]: Finished difference Result 685 states and 902 transitions. [2019-10-13 21:29:09,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:29:09,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-10-13 21:29:09,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:09,475 INFO L225 Difference]: With dead ends: 685 [2019-10-13 21:29:09,475 INFO L226 Difference]: Without dead ends: 459 [2019-10-13 21:29:09,478 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:29:09,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-10-13 21:29:09,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 434. [2019-10-13 21:29:09,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-10-13 21:29:09,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 547 transitions. [2019-10-13 21:29:09,567 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 547 transitions. Word has length 72 [2019-10-13 21:29:09,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:09,567 INFO L462 AbstractCegarLoop]: Abstraction has 434 states and 547 transitions. [2019-10-13 21:29:09,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:29:09,568 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 547 transitions. [2019-10-13 21:29:09,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-13 21:29:09,577 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:09,577 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:09,577 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:09,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:09,578 INFO L82 PathProgramCache]: Analyzing trace with hash -539585734, now seen corresponding path program 1 times [2019-10-13 21:29:09,579 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:09,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998838188] [2019-10-13 21:29:09,580 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:09,580 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:09,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:09,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:09,706 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998838188] [2019-10-13 21:29:09,706 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:09,706 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:29:09,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013585601] [2019-10-13 21:29:09,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:29:09,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:09,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:29:09,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:29:09,709 INFO L87 Difference]: Start difference. First operand 434 states and 547 transitions. Second operand 4 states. [2019-10-13 21:29:09,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:09,974 INFO L93 Difference]: Finished difference Result 1069 states and 1394 transitions. [2019-10-13 21:29:09,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:29:09,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-10-13 21:29:09,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:09,981 INFO L225 Difference]: With dead ends: 1069 [2019-10-13 21:29:09,981 INFO L226 Difference]: Without dead ends: 655 [2019-10-13 21:29:09,983 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:29:09,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-10-13 21:29:10,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 628. [2019-10-13 21:29:10,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-10-13 21:29:10,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 789 transitions. [2019-10-13 21:29:10,033 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 789 transitions. Word has length 73 [2019-10-13 21:29:10,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:10,034 INFO L462 AbstractCegarLoop]: Abstraction has 628 states and 789 transitions. [2019-10-13 21:29:10,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:29:10,034 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 789 transitions. [2019-10-13 21:29:10,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-13 21:29:10,035 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:10,035 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:10,036 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:10,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:10,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1990564953, now seen corresponding path program 1 times [2019-10-13 21:29:10,036 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:10,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861143253] [2019-10-13 21:29:10,037 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,037 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:10,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:10,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861143253] [2019-10-13 21:29:10,141 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:10,141 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:29:10,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283033785] [2019-10-13 21:29:10,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:29:10,142 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:10,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:29:10,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:10,143 INFO L87 Difference]: Start difference. First operand 628 states and 789 transitions. Second operand 6 states. [2019-10-13 21:29:10,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:10,228 INFO L93 Difference]: Finished difference Result 1266 states and 1608 transitions. [2019-10-13 21:29:10,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:29:10,228 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-10-13 21:29:10,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:10,236 INFO L225 Difference]: With dead ends: 1266 [2019-10-13 21:29:10,236 INFO L226 Difference]: Without dead ends: 658 [2019-10-13 21:29:10,239 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:29:10,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-10-13 21:29:10,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 643. [2019-10-13 21:29:10,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-10-13 21:29:10,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 801 transitions. [2019-10-13 21:29:10,305 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 801 transitions. Word has length 73 [2019-10-13 21:29:10,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:10,307 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 801 transitions. [2019-10-13 21:29:10,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:29:10,307 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 801 transitions. [2019-10-13 21:29:10,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-13 21:29:10,309 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:10,309 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:10,309 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:10,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:10,310 INFO L82 PathProgramCache]: Analyzing trace with hash 618757655, now seen corresponding path program 1 times [2019-10-13 21:29:10,310 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:10,311 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861973066] [2019-10-13 21:29:10,311 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,311 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:10,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:10,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861973066] [2019-10-13 21:29:10,431 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:10,431 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:29:10,432 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313379725] [2019-10-13 21:29:10,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:29:10,432 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:10,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:29:10,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:10,433 INFO L87 Difference]: Start difference. First operand 643 states and 801 transitions. Second operand 6 states. [2019-10-13 21:29:10,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:10,506 INFO L93 Difference]: Finished difference Result 1294 states and 1626 transitions. [2019-10-13 21:29:10,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:29:10,507 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-10-13 21:29:10,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:10,512 INFO L225 Difference]: With dead ends: 1294 [2019-10-13 21:29:10,512 INFO L226 Difference]: Without dead ends: 671 [2019-10-13 21:29:10,514 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:29:10,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-10-13 21:29:10,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 663. [2019-10-13 21:29:10,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-10-13 21:29:10,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 819 transitions. [2019-10-13 21:29:10,564 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 819 transitions. Word has length 73 [2019-10-13 21:29:10,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:10,567 INFO L462 AbstractCegarLoop]: Abstraction has 663 states and 819 transitions. [2019-10-13 21:29:10,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:29:10,568 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 819 transitions. [2019-10-13 21:29:10,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-13 21:29:10,569 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:10,570 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:10,571 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:10,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:10,593 INFO L82 PathProgramCache]: Analyzing trace with hash 641389909, now seen corresponding path program 1 times [2019-10-13 21:29:10,595 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:10,595 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772918142] [2019-10-13 21:29:10,595 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,595 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:10,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:10,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772918142] [2019-10-13 21:29:10,720 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:10,720 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:29:10,721 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029043852] [2019-10-13 21:29:10,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:29:10,722 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:10,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:29:10,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:10,723 INFO L87 Difference]: Start difference. First operand 663 states and 819 transitions. Second operand 6 states. [2019-10-13 21:29:10,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:10,839 INFO L93 Difference]: Finished difference Result 1333 states and 1667 transitions. [2019-10-13 21:29:10,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:29:10,840 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-10-13 21:29:10,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:10,848 INFO L225 Difference]: With dead ends: 1333 [2019-10-13 21:29:10,848 INFO L226 Difference]: Without dead ends: 784 [2019-10-13 21:29:10,851 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:29:10,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-10-13 21:29:10,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 770. [2019-10-13 21:29:10,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2019-10-13 21:29:10,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 953 transitions. [2019-10-13 21:29:10,895 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 953 transitions. Word has length 73 [2019-10-13 21:29:10,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:10,896 INFO L462 AbstractCegarLoop]: Abstraction has 770 states and 953 transitions. [2019-10-13 21:29:10,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:29:10,896 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 953 transitions. [2019-10-13 21:29:10,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-13 21:29:10,903 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:10,903 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:10,903 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:10,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:10,904 INFO L82 PathProgramCache]: Analyzing trace with hash 298865229, now seen corresponding path program 1 times [2019-10-13 21:29:10,904 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:10,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679983199] [2019-10-13 21:29:10,904 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,904 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:10,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:10,985 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679983199] [2019-10-13 21:29:10,985 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:10,985 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:29:10,985 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289580115] [2019-10-13 21:29:10,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:29:10,986 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:10,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:29:10,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:10,987 INFO L87 Difference]: Start difference. First operand 770 states and 953 transitions. Second operand 6 states. [2019-10-13 21:29:11,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:11,733 INFO L93 Difference]: Finished difference Result 1390 states and 1848 transitions. [2019-10-13 21:29:11,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:29:11,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-10-13 21:29:11,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:11,741 INFO L225 Difference]: With dead ends: 1390 [2019-10-13 21:29:11,741 INFO L226 Difference]: Without dead ends: 1052 [2019-10-13 21:29:11,743 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:29:11,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-10-13 21:29:11,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 996. [2019-10-13 21:29:11,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 996 states. [2019-10-13 21:29:11,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1303 transitions. [2019-10-13 21:29:11,809 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1303 transitions. Word has length 86 [2019-10-13 21:29:11,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:11,810 INFO L462 AbstractCegarLoop]: Abstraction has 996 states and 1303 transitions. [2019-10-13 21:29:11,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:29:11,810 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1303 transitions. [2019-10-13 21:29:11,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-13 21:29:11,811 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:11,812 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:11,812 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:11,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:11,812 INFO L82 PathProgramCache]: Analyzing trace with hash -681624608, now seen corresponding path program 1 times [2019-10-13 21:29:11,813 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:11,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133008113] [2019-10-13 21:29:11,813 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:11,813 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:11,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:11,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133008113] [2019-10-13 21:29:11,972 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:11,973 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:29:11,973 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463090702] [2019-10-13 21:29:11,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:29:11,974 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:11,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:29:11,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:29:11,975 INFO L87 Difference]: Start difference. First operand 996 states and 1303 transitions. Second operand 9 states. [2019-10-13 21:29:13,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:13,447 INFO L93 Difference]: Finished difference Result 2244 states and 3204 transitions. [2019-10-13 21:29:13,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 21:29:13,448 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2019-10-13 21:29:13,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:13,462 INFO L225 Difference]: With dead ends: 2244 [2019-10-13 21:29:13,463 INFO L226 Difference]: Without dead ends: 1719 [2019-10-13 21:29:13,466 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:29:13,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2019-10-13 21:29:13,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1584. [2019-10-13 21:29:13,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2019-10-13 21:29:13,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2177 transitions. [2019-10-13 21:29:13,578 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2177 transitions. Word has length 90 [2019-10-13 21:29:13,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:13,578 INFO L462 AbstractCegarLoop]: Abstraction has 1584 states and 2177 transitions. [2019-10-13 21:29:13,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:29:13,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2177 transitions. [2019-10-13 21:29:13,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 21:29:13,581 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:13,581 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 21:29:13,581 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:13,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:13,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1835313196, now seen corresponding path program 1 times [2019-10-13 21:29:13,582 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:13,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30113900] [2019-10-13 21:29:13,582 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:13,583 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:13,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:13,634 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 21:29:13,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30113900] [2019-10-13 21:29:13,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197078498] [2019-10-13 21:29:13,639 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-10-13 21:29:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:13,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:29:13,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:13,833 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 21:29:13,833 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:13,986 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 21:29:13,988 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:29:13,988 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 3 [2019-10-13 21:29:13,989 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785306649] [2019-10-13 21:29:13,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:13,990 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:13,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:13,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:13,991 INFO L87 Difference]: Start difference. First operand 1584 states and 2177 transitions. Second operand 3 states. [2019-10-13 21:29:14,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:14,225 INFO L93 Difference]: Finished difference Result 4511 states and 6933 transitions. [2019-10-13 21:29:14,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:14,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-10-13 21:29:14,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:14,258 INFO L225 Difference]: With dead ends: 4511 [2019-10-13 21:29:14,259 INFO L226 Difference]: Without dead ends: 2948 [2019-10-13 21:29:14,274 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 185 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-10-13 21:29:14,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2019-10-13 21:29:14,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 2944. [2019-10-13 21:29:14,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2944 states. [2019-10-13 21:29:14,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 4358 transitions. [2019-10-13 21:29:14,500 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 4358 transitions. Word has length 92 [2019-10-13 21:29:14,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:14,500 INFO L462 AbstractCegarLoop]: Abstraction has 2944 states and 4358 transitions. [2019-10-13 21:29:14,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:14,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 4358 transitions. [2019-10-13 21:29:14,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-13 21:29:14,504 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:14,504 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:14,717 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:14,718 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:14,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:14,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1113521566, now seen corresponding path program 1 times [2019-10-13 21:29:14,719 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:14,719 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234760185] [2019-10-13 21:29:14,720 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:14,720 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:14,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:14,753 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-13 21:29:14,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234760185] [2019-10-13 21:29:14,754 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:14,754 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:29:14,754 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618319894] [2019-10-13 21:29:14,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:29:14,756 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:14,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:29:14,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:29:14,758 INFO L87 Difference]: Start difference. First operand 2944 states and 4358 transitions. Second operand 4 states. [2019-10-13 21:29:15,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:15,022 INFO L93 Difference]: Finished difference Result 5861 states and 8679 transitions. [2019-10-13 21:29:15,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:29:15,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-10-13 21:29:15,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:15,045 INFO L225 Difference]: With dead ends: 5861 [2019-10-13 21:29:15,045 INFO L226 Difference]: Without dead ends: 2938 [2019-10-13 21:29:15,063 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:29:15,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2019-10-13 21:29:15,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 2938. [2019-10-13 21:29:15,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2938 states. [2019-10-13 21:29:15,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2938 states to 2938 states and 4347 transitions. [2019-10-13 21:29:15,299 INFO L78 Accepts]: Start accepts. Automaton has 2938 states and 4347 transitions. Word has length 94 [2019-10-13 21:29:15,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:15,299 INFO L462 AbstractCegarLoop]: Abstraction has 2938 states and 4347 transitions. [2019-10-13 21:29:15,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:29:15,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2938 states and 4347 transitions. [2019-10-13 21:29:15,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-13 21:29:15,306 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:15,307 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:15,307 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:15,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:15,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1952555228, now seen corresponding path program 1 times [2019-10-13 21:29:15,307 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:15,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324130147] [2019-10-13 21:29:15,308 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:15,308 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:15,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:15,414 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 21:29:15,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324130147] [2019-10-13 21:29:15,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196037002] [2019-10-13 21:29:15,415 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-10-13 21:29:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:15,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:29:15,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:15,599 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:15,599 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:15,712 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 21:29:15,713 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:29:15,713 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2019-10-13 21:29:15,713 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785540580] [2019-10-13 21:29:15,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:29:15,714 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:15,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:29:15,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:29:15,715 INFO L87 Difference]: Start difference. First operand 2938 states and 4347 transitions. Second operand 4 states. [2019-10-13 21:29:16,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:16,048 INFO L93 Difference]: Finished difference Result 8039 states and 12507 transitions. [2019-10-13 21:29:16,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:29:16,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-10-13 21:29:16,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:16,089 INFO L225 Difference]: With dead ends: 8039 [2019-10-13 21:29:16,089 INFO L226 Difference]: Without dead ends: 5122 [2019-10-13 21:29:16,124 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:29:16,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5122 states. [2019-10-13 21:29:16,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5122 to 5117. [2019-10-13 21:29:16,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5117 states. [2019-10-13 21:29:16,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5117 states to 5117 states and 6863 transitions. [2019-10-13 21:29:16,590 INFO L78 Accepts]: Start accepts. Automaton has 5117 states and 6863 transitions. Word has length 94 [2019-10-13 21:29:16,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:16,590 INFO L462 AbstractCegarLoop]: Abstraction has 5117 states and 6863 transitions. [2019-10-13 21:29:16,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:29:16,591 INFO L276 IsEmpty]: Start isEmpty. Operand 5117 states and 6863 transitions. [2019-10-13 21:29:16,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-13 21:29:16,596 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:16,596 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:16,809 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:16,809 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:16,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:16,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1028804159, now seen corresponding path program 1 times [2019-10-13 21:29:16,810 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:16,810 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677671191] [2019-10-13 21:29:16,810 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:16,810 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:16,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:16,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:16,922 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:29:16,923 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677671191] [2019-10-13 21:29:16,923 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828324296] [2019-10-13 21:29:16,923 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-10-13 21:29:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:17,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:29:17,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:17,040 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:17,041 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:17,123 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:29:17,124 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:29:17,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [8] total 11 [2019-10-13 21:29:17,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283784560] [2019-10-13 21:29:17,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:17,125 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:17,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:17,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:29:17,126 INFO L87 Difference]: Start difference. First operand 5117 states and 6863 transitions. Second operand 5 states. [2019-10-13 21:29:17,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:17,620 INFO L93 Difference]: Finished difference Result 9917 states and 13441 transitions. [2019-10-13 21:29:17,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:17,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-10-13 21:29:17,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:17,653 INFO L225 Difference]: With dead ends: 9917 [2019-10-13 21:29:17,653 INFO L226 Difference]: Without dead ends: 4745 [2019-10-13 21:29:17,681 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 191 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:29:17,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4745 states. [2019-10-13 21:29:18,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4745 to 4739. [2019-10-13 21:29:18,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4739 states. [2019-10-13 21:29:18,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4739 states to 4739 states and 5742 transitions. [2019-10-13 21:29:18,032 INFO L78 Accepts]: Start accepts. Automaton has 4739 states and 5742 transitions. Word has length 97 [2019-10-13 21:29:18,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:18,033 INFO L462 AbstractCegarLoop]: Abstraction has 4739 states and 5742 transitions. [2019-10-13 21:29:18,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:18,033 INFO L276 IsEmpty]: Start isEmpty. Operand 4739 states and 5742 transitions. [2019-10-13 21:29:18,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-13 21:29:18,040 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:18,041 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:18,245 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:18,246 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:18,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:18,246 INFO L82 PathProgramCache]: Analyzing trace with hash -630281820, now seen corresponding path program 1 times [2019-10-13 21:29:18,247 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:18,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999263565] [2019-10-13 21:29:18,247 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:18,247 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:18,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:18,341 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 19 proven. 20 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-13 21:29:18,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999263565] [2019-10-13 21:29:18,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737199708] [2019-10-13 21:29:18,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:18,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:29:18,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:18,532 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-13 21:29:18,532 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:18,754 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-10-13 21:29:18,754 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:29:18,754 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [8] total 10 [2019-10-13 21:29:18,755 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721201130] [2019-10-13 21:29:18,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:29:18,758 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:18,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:29:18,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:29:18,759 INFO L87 Difference]: Start difference. First operand 4739 states and 5742 transitions. Second operand 4 states. [2019-10-13 21:29:19,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:19,039 INFO L93 Difference]: Finished difference Result 7172 states and 8716 transitions. [2019-10-13 21:29:19,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:19,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-10-13 21:29:19,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:19,081 INFO L225 Difference]: With dead ends: 7172 [2019-10-13 21:29:19,082 INFO L226 Difference]: Without dead ends: 3333 [2019-10-13 21:29:19,092 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 328 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:29:19,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3333 states. [2019-10-13 21:29:19,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3333 to 3333. [2019-10-13 21:29:19,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3333 states. [2019-10-13 21:29:19,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3333 states to 3333 states and 4006 transitions. [2019-10-13 21:29:19,329 INFO L78 Accepts]: Start accepts. Automaton has 3333 states and 4006 transitions. Word has length 165 [2019-10-13 21:29:19,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:19,332 INFO L462 AbstractCegarLoop]: Abstraction has 3333 states and 4006 transitions. [2019-10-13 21:29:19,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:29:19,332 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 4006 transitions. [2019-10-13 21:29:19,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-13 21:29:19,337 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:19,337 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:19,542 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:19,542 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:19,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:19,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1714362604, now seen corresponding path program 1 times [2019-10-13 21:29:19,543 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:19,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518036554] [2019-10-13 21:29:19,544 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:19,544 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:19,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:19,603 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-13 21:29:19,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518036554] [2019-10-13 21:29:19,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114247464] [2019-10-13 21:29:19,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:19,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:29:19,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:19,977 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 21:29:19,977 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:20,137 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-13 21:29:20,145 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:29:20,145 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2019-10-13 21:29:20,147 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781478493] [2019-10-13 21:29:20,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:20,149 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:20,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:20,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:29:20,150 INFO L87 Difference]: Start difference. First operand 3333 states and 4006 transitions. Second operand 3 states. [2019-10-13 21:29:20,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:20,387 INFO L93 Difference]: Finished difference Result 7851 states and 9685 transitions. [2019-10-13 21:29:20,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:20,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-10-13 21:29:20,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:20,414 INFO L225 Difference]: With dead ends: 7851 [2019-10-13 21:29:20,414 INFO L226 Difference]: Without dead ends: 4544 [2019-10-13 21:29:20,423 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:29:20,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4544 states. [2019-10-13 21:29:20,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4544 to 4541. [2019-10-13 21:29:20,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4541 states. [2019-10-13 21:29:20,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4541 states to 4541 states and 5488 transitions. [2019-10-13 21:29:20,720 INFO L78 Accepts]: Start accepts. Automaton has 4541 states and 5488 transitions. Word has length 170 [2019-10-13 21:29:20,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:20,721 INFO L462 AbstractCegarLoop]: Abstraction has 4541 states and 5488 transitions. [2019-10-13 21:29:20,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:20,721 INFO L276 IsEmpty]: Start isEmpty. Operand 4541 states and 5488 transitions. [2019-10-13 21:29:20,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-13 21:29:20,727 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:20,728 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:20,940 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:20,940 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:20,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:20,941 INFO L82 PathProgramCache]: Analyzing trace with hash -703541462, now seen corresponding path program 1 times [2019-10-13 21:29:20,941 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:20,941 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848253053] [2019-10-13 21:29:20,941 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:20,941 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:20,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:21,028 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-13 21:29:21,028 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848253053] [2019-10-13 21:29:21,028 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:21,029 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:29:21,029 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829273754] [2019-10-13 21:29:21,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:29:21,030 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:21,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:29:21,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:29:21,030 INFO L87 Difference]: Start difference. First operand 4541 states and 5488 transitions. Second operand 4 states. [2019-10-13 21:29:21,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:21,414 INFO L93 Difference]: Finished difference Result 10009 states and 12185 transitions. [2019-10-13 21:29:21,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:29:21,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-10-13 21:29:21,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:21,451 INFO L225 Difference]: With dead ends: 10009 [2019-10-13 21:29:21,452 INFO L226 Difference]: Without dead ends: 5494 [2019-10-13 21:29:21,463 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:29:21,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5494 states. [2019-10-13 21:29:21,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5494 to 5494. [2019-10-13 21:29:21,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5494 states. [2019-10-13 21:29:21,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5494 states to 5494 states and 6326 transitions. [2019-10-13 21:29:21,764 INFO L78 Accepts]: Start accepts. Automaton has 5494 states and 6326 transitions. Word has length 170 [2019-10-13 21:29:21,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:21,766 INFO L462 AbstractCegarLoop]: Abstraction has 5494 states and 6326 transitions. [2019-10-13 21:29:21,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:29:21,766 INFO L276 IsEmpty]: Start isEmpty. Operand 5494 states and 6326 transitions. [2019-10-13 21:29:21,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-13 21:29:21,776 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:21,776 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:21,776 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:21,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:21,777 INFO L82 PathProgramCache]: Analyzing trace with hash 771902308, now seen corresponding path program 1 times [2019-10-13 21:29:21,777 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:21,777 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408439625] [2019-10-13 21:29:21,777 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:21,778 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:21,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:21,915 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 22 proven. 20 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-13 21:29:21,915 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408439625] [2019-10-13 21:29:21,915 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616575661] [2019-10-13 21:29:21,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:22,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-13 21:29:22,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:22,203 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-13 21:29:22,204 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:22,397 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-13 21:29:22,398 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:29:22,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 5] total 9 [2019-10-13 21:29:22,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229019973] [2019-10-13 21:29:22,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:29:22,400 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:22,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:29:22,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:29:22,400 INFO L87 Difference]: Start difference. First operand 5494 states and 6326 transitions. Second operand 6 states. [2019-10-13 21:29:23,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:23,110 INFO L93 Difference]: Finished difference Result 8461 states and 9768 transitions. [2019-10-13 21:29:23,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:29:23,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 204 [2019-10-13 21:29:23,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:23,130 INFO L225 Difference]: With dead ends: 8461 [2019-10-13 21:29:23,130 INFO L226 Difference]: Without dead ends: 4233 [2019-10-13 21:29:23,139 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 406 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:29:23,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4233 states. [2019-10-13 21:29:23,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4233 to 4230. [2019-10-13 21:29:23,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4230 states. [2019-10-13 21:29:23,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4230 states to 4230 states and 4827 transitions. [2019-10-13 21:29:23,444 INFO L78 Accepts]: Start accepts. Automaton has 4230 states and 4827 transitions. Word has length 204 [2019-10-13 21:29:23,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:23,445 INFO L462 AbstractCegarLoop]: Abstraction has 4230 states and 4827 transitions. [2019-10-13 21:29:23,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:29:23,445 INFO L276 IsEmpty]: Start isEmpty. Operand 4230 states and 4827 transitions. [2019-10-13 21:29:23,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-13 21:29:23,451 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:23,451 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:23,657 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:23,657 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:23,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:23,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1674822886, now seen corresponding path program 1 times [2019-10-13 21:29:23,658 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:23,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313560168] [2019-10-13 21:29:23,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:23,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:23,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:23,728 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-10-13 21:29:23,729 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313560168] [2019-10-13 21:29:23,730 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:23,730 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:29:23,730 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345944326] [2019-10-13 21:29:23,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:29:23,731 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:23,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:29:23,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:29:23,732 INFO L87 Difference]: Start difference. First operand 4230 states and 4827 transitions. Second operand 4 states. [2019-10-13 21:29:23,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:23,986 INFO L93 Difference]: Finished difference Result 4773 states and 5421 transitions. [2019-10-13 21:29:23,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:29:23,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2019-10-13 21:29:23,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:24,001 INFO L225 Difference]: With dead ends: 4773 [2019-10-13 21:29:24,002 INFO L226 Difference]: Without dead ends: 4225 [2019-10-13 21:29:24,005 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:29:24,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4225 states. [2019-10-13 21:29:24,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4225 to 4225. [2019-10-13 21:29:24,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4225 states. [2019-10-13 21:29:24,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4225 states to 4225 states and 4818 transitions. [2019-10-13 21:29:24,245 INFO L78 Accepts]: Start accepts. Automaton has 4225 states and 4818 transitions. Word has length 204 [2019-10-13 21:29:24,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:24,246 INFO L462 AbstractCegarLoop]: Abstraction has 4225 states and 4818 transitions. [2019-10-13 21:29:24,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:29:24,246 INFO L276 IsEmpty]: Start isEmpty. Operand 4225 states and 4818 transitions. [2019-10-13 21:29:24,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-13 21:29:24,260 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:24,261 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:24,261 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:24,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:24,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1301793383, now seen corresponding path program 1 times [2019-10-13 21:29:24,262 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:24,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100290687] [2019-10-13 21:29:24,262 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:24,263 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:24,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:24,449 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 23 proven. 34 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-13 21:29:24,450 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100290687] [2019-10-13 21:29:24,450 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384768441] [2019-10-13 21:29:24,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:24,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 21:29:24,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:24,670 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-13 21:29:24,671 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:24,936 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-13 21:29:24,937 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:29:24,937 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 6] total 14 [2019-10-13 21:29:24,937 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604153524] [2019-10-13 21:29:24,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:29:24,938 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:24,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:29:24,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:29:24,939 INFO L87 Difference]: Start difference. First operand 4225 states and 4818 transitions. Second operand 6 states. [2019-10-13 21:29:25,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:25,140 INFO L93 Difference]: Finished difference Result 6892 states and 7951 transitions. [2019-10-13 21:29:25,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:29:25,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 205 [2019-10-13 21:29:25,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:25,155 INFO L225 Difference]: With dead ends: 6892 [2019-10-13 21:29:25,155 INFO L226 Difference]: Without dead ends: 2688 [2019-10-13 21:29:25,163 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 405 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-10-13 21:29:25,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2688 states. [2019-10-13 21:29:25,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2688 to 2523. [2019-10-13 21:29:25,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2523 states. [2019-10-13 21:29:25,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 2879 transitions. [2019-10-13 21:29:25,300 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 2879 transitions. Word has length 205 [2019-10-13 21:29:25,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:25,301 INFO L462 AbstractCegarLoop]: Abstraction has 2523 states and 2879 transitions. [2019-10-13 21:29:25,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:29:25,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 2879 transitions. [2019-10-13 21:29:25,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-13 21:29:25,305 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:25,305 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:25,510 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:25,510 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:25,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:25,511 INFO L82 PathProgramCache]: Analyzing trace with hash 519037793, now seen corresponding path program 1 times [2019-10-13 21:29:25,511 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:25,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099151269] [2019-10-13 21:29:25,511 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:25,511 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:25,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:25,604 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-13 21:29:25,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099151269] [2019-10-13 21:29:25,605 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:25,605 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:25,605 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653105827] [2019-10-13 21:29:25,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:25,606 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:25,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:25,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:25,607 INFO L87 Difference]: Start difference. First operand 2523 states and 2879 transitions. Second operand 5 states. [2019-10-13 21:29:26,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:26,068 INFO L93 Difference]: Finished difference Result 4790 states and 5479 transitions. [2019-10-13 21:29:26,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:29:26,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 212 [2019-10-13 21:29:26,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:26,078 INFO L225 Difference]: With dead ends: 4790 [2019-10-13 21:29:26,078 INFO L226 Difference]: Without dead ends: 2389 [2019-10-13 21:29:26,083 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:26,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2389 states. [2019-10-13 21:29:26,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2389 to 2378. [2019-10-13 21:29:26,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2378 states. [2019-10-13 21:29:26,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 2378 states and 2696 transitions. [2019-10-13 21:29:26,246 INFO L78 Accepts]: Start accepts. Automaton has 2378 states and 2696 transitions. Word has length 212 [2019-10-13 21:29:26,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:26,247 INFO L462 AbstractCegarLoop]: Abstraction has 2378 states and 2696 transitions. [2019-10-13 21:29:26,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:26,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2378 states and 2696 transitions. [2019-10-13 21:29:26,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-10-13 21:29:26,252 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:26,253 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:26,253 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:26,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:26,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1837583679, now seen corresponding path program 1 times [2019-10-13 21:29:26,254 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:26,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155917914] [2019-10-13 21:29:26,254 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:26,255 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:26,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:26,470 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-13 21:29:26,471 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155917914] [2019-10-13 21:29:26,471 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014182755] [2019-10-13 21:29:26,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:26,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 21:29:26,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:26,726 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-13 21:29:26,726 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:26,885 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-13 21:29:26,886 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:29:26,886 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2019-10-13 21:29:26,886 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656348536] [2019-10-13 21:29:26,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:26,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:26,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:26,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:26,888 INFO L87 Difference]: Start difference. First operand 2378 states and 2696 transitions. Second operand 3 states. [2019-10-13 21:29:27,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:27,012 INFO L93 Difference]: Finished difference Result 4809 states and 5450 transitions. [2019-10-13 21:29:27,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:27,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2019-10-13 21:29:27,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:27,022 INFO L225 Difference]: With dead ends: 4809 [2019-10-13 21:29:27,022 INFO L226 Difference]: Without dead ends: 2553 [2019-10-13 21:29:27,026 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 435 SyntacticMatches, 8 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:27,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2553 states. [2019-10-13 21:29:27,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2553 to 2549. [2019-10-13 21:29:27,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2549 states. [2019-10-13 21:29:27,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2549 states to 2549 states and 2878 transitions. [2019-10-13 21:29:27,155 INFO L78 Accepts]: Start accepts. Automaton has 2549 states and 2878 transitions. Word has length 221 [2019-10-13 21:29:27,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:27,156 INFO L462 AbstractCegarLoop]: Abstraction has 2549 states and 2878 transitions. [2019-10-13 21:29:27,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:27,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2549 states and 2878 transitions. [2019-10-13 21:29:27,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-13 21:29:27,160 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:27,160 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:27,365 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:27,366 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:27,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:27,366 INFO L82 PathProgramCache]: Analyzing trace with hash 204920273, now seen corresponding path program 1 times [2019-10-13 21:29:27,366 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:27,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310519784] [2019-10-13 21:29:27,367 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:27,367 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:27,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:27,569 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-13 21:29:27,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310519784] [2019-10-13 21:29:27,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402933893] [2019-10-13 21:29:27,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:27,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 862 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-13 21:29:27,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:27,975 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-10-13 21:29:27,975 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:28,245 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-10-13 21:29:28,245 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:29:28,246 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12, 8] total 18 [2019-10-13 21:29:28,246 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316448876] [2019-10-13 21:29:28,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:29:28,247 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:28,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:29:28,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:29:28,247 INFO L87 Difference]: Start difference. First operand 2549 states and 2878 transitions. Second operand 9 states. [2019-10-13 21:29:29,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:29,417 INFO L93 Difference]: Finished difference Result 5279 states and 6001 transitions. [2019-10-13 21:29:29,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 21:29:29,418 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 222 [2019-10-13 21:29:29,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:29,428 INFO L225 Difference]: With dead ends: 5279 [2019-10-13 21:29:29,429 INFO L226 Difference]: Without dead ends: 3023 [2019-10-13 21:29:29,433 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 447 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2019-10-13 21:29:29,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3023 states. [2019-10-13 21:29:29,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3023 to 2986. [2019-10-13 21:29:29,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2986 states. [2019-10-13 21:29:29,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2986 states to 2986 states and 3377 transitions. [2019-10-13 21:29:29,618 INFO L78 Accepts]: Start accepts. Automaton has 2986 states and 3377 transitions. Word has length 222 [2019-10-13 21:29:29,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:29,618 INFO L462 AbstractCegarLoop]: Abstraction has 2986 states and 3377 transitions. [2019-10-13 21:29:29,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:29:29,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2986 states and 3377 transitions. [2019-10-13 21:29:29,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-13 21:29:29,622 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:29,623 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:29,835 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:29,835 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:29,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:29,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1036438586, now seen corresponding path program 1 times [2019-10-13 21:29:29,836 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:29,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315600166] [2019-10-13 21:29:29,836 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:29,836 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:29,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:30,149 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 6 proven. 68 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-13 21:29:30,149 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315600166] [2019-10-13 21:29:30,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429004153] [2019-10-13 21:29:30,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:30,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 869 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-13 21:29:30,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 97 proven. 34 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-13 21:29:30,444 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:30,634 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-10-13 21:29:30,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [245379164] [2019-10-13 21:29:30,640 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 227 [2019-10-13 21:29:30,677 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 21:29:30,677 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 21:29:35,921 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-13 21:29:35,925 INFO L272 AbstractInterpreter]: Visited 139 different actions 13920 times. Merged at 62 different actions 4985 times. Widened at 3 different actions 74 times. Performed 80238 root evaluator evaluations with a maximum evaluation depth of 4. Performed 80238 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 958 fixpoints after 24 different actions. Largest state had 39 variables. [2019-10-13 21:29:35,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:35,931 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:29:35,932 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:29:35,932 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 17 [2019-10-13 21:29:35,932 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794802850] [2019-10-13 21:29:35,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-13 21:29:35,933 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:35,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-13 21:29:35,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:29:35,935 INFO L87 Difference]: Start difference. First operand 2986 states and 3377 transitions. Second operand 17 states.