/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/systemc/kundu1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:14:08,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:14:08,868 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:14:08,880 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:14:08,881 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:14:08,882 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:14:08,883 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:14:08,885 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:14:08,887 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:14:08,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:14:08,889 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:14:08,890 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:14:08,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:14:08,892 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:14:08,893 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:14:08,894 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:14:08,895 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:14:08,897 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:14:08,899 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:14:08,904 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:14:08,908 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:14:08,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:14:08,912 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:14:08,913 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:14:08,916 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:14:08,917 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:14:08,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:14:08,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:14:08,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:14:08,922 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:14:08,925 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:14:08,926 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:14:08,927 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:14:08,929 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:14:08,930 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:14:08,934 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:14:08,935 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:14:08,935 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:14:08,935 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:14:08,936 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:14:08,937 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:14:08,938 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-07 01:14:08,960 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:14:08,961 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:14:08,962 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:14:08,962 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:14:08,963 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:14:08,963 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:14:08,963 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:14:08,963 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:14:08,963 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:14:08,964 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:14:08,964 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:14:08,964 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:14:08,964 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:14:08,965 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:14:08,965 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:14:08,965 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:14:08,965 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:14:08,965 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:14:08,966 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:14:08,966 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:14:08,966 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:14:08,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:14:08,967 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:14:08,967 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:14:08,967 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:14:08,967 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:14:08,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:14:08,968 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:14:08,968 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 01:14:09,296 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:14:09,314 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:14:09,318 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:14:09,321 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:14:09,321 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:14:09,322 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/kundu1.cil.c [2019-11-07 01:14:09,412 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38e78af87/6cfa4161ed0441a9a35d6f1b12f08ec6/FLAG4fe728932 [2019-11-07 01:14:09,908 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:14:09,908 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/kundu1.cil.c [2019-11-07 01:14:09,918 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38e78af87/6cfa4161ed0441a9a35d6f1b12f08ec6/FLAG4fe728932 [2019-11-07 01:14:10,303 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38e78af87/6cfa4161ed0441a9a35d6f1b12f08ec6 [2019-11-07 01:14:10,313 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:14:10,314 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:14:10,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:14:10,316 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:14:10,321 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:14:10,322 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:14:10" (1/1) ... [2019-11-07 01:14:10,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@389c572b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:10, skipping insertion in model container [2019-11-07 01:14:10,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:14:10" (1/1) ... [2019-11-07 01:14:10,333 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:14:10,392 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:14:10,766 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:14:10,774 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:14:10,929 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:14:10,951 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:14:10,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:10 WrapperNode [2019-11-07 01:14:10,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:14:10,952 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:14:10,952 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:14:10,953 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:14:10,966 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:10" (1/1) ... [2019-11-07 01:14:10,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:10" (1/1) ... [2019-11-07 01:14:10,973 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:10" (1/1) ... [2019-11-07 01:14:10,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:10" (1/1) ... [2019-11-07 01:14:10,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:10" (1/1) ... [2019-11-07 01:14:10,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:10" (1/1) ... [2019-11-07 01:14:11,001 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:10" (1/1) ... [2019-11-07 01:14:11,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:14:11,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:14:11,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:14:11,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:14:11,010 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:14:11,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:14:11,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:14:11,068 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-11-07 01:14:11,068 INFO L138 BoogieDeclarations]: Found implementation of procedure read_data [2019-11-07 01:14:11,068 INFO L138 BoogieDeclarations]: Found implementation of procedure write_data [2019-11-07 01:14:11,069 INFO L138 BoogieDeclarations]: Found implementation of procedure P_1 [2019-11-07 01:14:11,069 INFO L138 BoogieDeclarations]: Found implementation of procedure is_P_1_triggered [2019-11-07 01:14:11,069 INFO L138 BoogieDeclarations]: Found implementation of procedure C_1 [2019-11-07 01:14:11,070 INFO L138 BoogieDeclarations]: Found implementation of procedure is_C_1_triggered [2019-11-07 01:14:11,070 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-11-07 01:14:11,070 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-11-07 01:14:11,070 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-11-07 01:14:11,071 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-11-07 01:14:11,071 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-11-07 01:14:11,071 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-11-07 01:14:11,071 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-11-07 01:14:11,071 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-11-07 01:14:11,072 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-11-07 01:14:11,072 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-11-07 01:14:11,072 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-11-07 01:14:11,072 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-11-07 01:14:11,072 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-11-07 01:14:11,073 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:14:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:14:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 01:14:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-11-07 01:14:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-11-07 01:14:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure read_data [2019-11-07 01:14:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure write_data [2019-11-07 01:14:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure P_1 [2019-11-07 01:14:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure is_P_1_triggered [2019-11-07 01:14:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure C_1 [2019-11-07 01:14:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure is_C_1_triggered [2019-11-07 01:14:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-11-07 01:14:11,075 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-11-07 01:14:11,075 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-11-07 01:14:11,075 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-11-07 01:14:11,075 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-11-07 01:14:11,075 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-11-07 01:14:11,075 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-11-07 01:14:11,076 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-11-07 01:14:11,076 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-11-07 01:14:11,076 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-11-07 01:14:11,076 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-11-07 01:14:11,076 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-11-07 01:14:11,076 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:14:11,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:14:11,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:14:11,664 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:14:11,665 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-07 01:14:11,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:14:11 BoogieIcfgContainer [2019-11-07 01:14:11,668 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:14:11,669 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:14:11,671 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:14:11,674 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:14:11,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:14:10" (1/3) ... [2019-11-07 01:14:11,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@161fd97b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:14:11, skipping insertion in model container [2019-11-07 01:14:11,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:14:10" (2/3) ... [2019-11-07 01:14:11,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@161fd97b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:14:11, skipping insertion in model container [2019-11-07 01:14:11,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:14:11" (3/3) ... [2019-11-07 01:14:11,683 INFO L109 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2019-11-07 01:14:11,694 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:14:11,703 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 01:14:11,712 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 01:14:11,739 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:14:11,739 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:14:11,739 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:14:11,739 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:14:11,740 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:14:11,740 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:14:11,740 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:14:11,740 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:14:11,765 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-11-07 01:14:11,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-07 01:14:11,776 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:11,777 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:11,780 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:11,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:11,786 INFO L82 PathProgramCache]: Analyzing trace with hash -798642762, now seen corresponding path program 1 times [2019-11-07 01:14:11,795 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:11,796 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869706587] [2019-11-07 01:14:11,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:12,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:14:12,108 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869706587] [2019-11-07 01:14:12,109 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:12,110 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:14:12,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841866111] [2019-11-07 01:14:12,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:14:12,119 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:12,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:14:12,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:14:12,137 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 4 states. [2019-11-07 01:14:12,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:12,573 INFO L93 Difference]: Finished difference Result 402 states and 558 transitions. [2019-11-07 01:14:12,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:14:12,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-11-07 01:14:12,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:12,604 INFO L225 Difference]: With dead ends: 402 [2019-11-07 01:14:12,604 INFO L226 Difference]: Without dead ends: 258 [2019-11-07 01:14:12,616 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:14:12,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-07 01:14:12,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 246. [2019-11-07 01:14:12,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-11-07 01:14:12,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 315 transitions. [2019-11-07 01:14:12,779 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 315 transitions. Word has length 72 [2019-11-07 01:14:12,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:12,780 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 315 transitions. [2019-11-07 01:14:12,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:14:12,780 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 315 transitions. [2019-11-07 01:14:12,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-07 01:14:12,794 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:12,795 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:12,795 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:12,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:12,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1672120457, now seen corresponding path program 1 times [2019-11-07 01:14:12,796 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:12,797 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029557751] [2019-11-07 01:14:12,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:12,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:14:12,976 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029557751] [2019-11-07 01:14:12,977 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:12,977 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:14:12,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854570688] [2019-11-07 01:14:12,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:14:12,982 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:12,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:14:12,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:14:12,983 INFO L87 Difference]: Start difference. First operand 246 states and 315 transitions. Second operand 4 states. [2019-11-07 01:14:13,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:13,301 INFO L93 Difference]: Finished difference Result 685 states and 902 transitions. [2019-11-07 01:14:13,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:14:13,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-11-07 01:14:13,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:13,319 INFO L225 Difference]: With dead ends: 685 [2019-11-07 01:14:13,319 INFO L226 Difference]: Without dead ends: 459 [2019-11-07 01:14:13,325 INFO L630 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-11-07 01:14:13,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-11-07 01:14:13,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 434. [2019-11-07 01:14:13,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-11-07 01:14:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 547 transitions. [2019-11-07 01:14:13,419 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 547 transitions. Word has length 72 [2019-11-07 01:14:13,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:13,429 INFO L462 AbstractCegarLoop]: Abstraction has 434 states and 547 transitions. [2019-11-07 01:14:13,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:14:13,429 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 547 transitions. [2019-11-07 01:14:13,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-07 01:14:13,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:13,435 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:13,435 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:13,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:13,435 INFO L82 PathProgramCache]: Analyzing trace with hash -539585734, now seen corresponding path program 1 times [2019-11-07 01:14:13,436 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:13,436 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70643391] [2019-11-07 01:14:13,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:13,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:14:13,549 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70643391] [2019-11-07 01:14:13,549 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:13,550 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:14:13,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645879056] [2019-11-07 01:14:13,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:14:13,552 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:13,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:14:13,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:14:13,552 INFO L87 Difference]: Start difference. First operand 434 states and 547 transitions. Second operand 4 states. [2019-11-07 01:14:13,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:13,844 INFO L93 Difference]: Finished difference Result 1069 states and 1394 transitions. [2019-11-07 01:14:13,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:14:13,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-07 01:14:13,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:13,851 INFO L225 Difference]: With dead ends: 1069 [2019-11-07 01:14:13,851 INFO L226 Difference]: Without dead ends: 655 [2019-11-07 01:14:13,871 INFO L630 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-11-07 01:14:13,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-11-07 01:14:13,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 628. [2019-11-07 01:14:13,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-11-07 01:14:13,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 789 transitions. [2019-11-07 01:14:13,947 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 789 transitions. Word has length 73 [2019-11-07 01:14:13,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:13,949 INFO L462 AbstractCegarLoop]: Abstraction has 628 states and 789 transitions. [2019-11-07 01:14:13,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:14:13,950 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 789 transitions. [2019-11-07 01:14:13,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-07 01:14:13,959 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:13,960 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:13,960 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:13,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:13,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1990564953, now seen corresponding path program 1 times [2019-11-07 01:14:13,961 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:13,961 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137628133] [2019-11-07 01:14:13,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:14,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:14:14,117 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137628133] [2019-11-07 01:14:14,117 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:14,117 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 01:14:14,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835197418] [2019-11-07 01:14:14,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:14:14,118 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:14,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:14:14,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:14,119 INFO L87 Difference]: Start difference. First operand 628 states and 789 transitions. Second operand 6 states. [2019-11-07 01:14:14,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:14,192 INFO L93 Difference]: Finished difference Result 1266 states and 1608 transitions. [2019-11-07 01:14:14,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:14:14,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-11-07 01:14:14,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:14,198 INFO L225 Difference]: With dead ends: 1266 [2019-11-07 01:14:14,198 INFO L226 Difference]: Without dead ends: 658 [2019-11-07 01:14:14,201 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:14:14,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-11-07 01:14:14,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 643. [2019-11-07 01:14:14,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-11-07 01:14:14,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 801 transitions. [2019-11-07 01:14:14,249 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 801 transitions. Word has length 73 [2019-11-07 01:14:14,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:14,249 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 801 transitions. [2019-11-07 01:14:14,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:14:14,249 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 801 transitions. [2019-11-07 01:14:14,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-07 01:14:14,251 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:14,251 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:14,251 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:14,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:14,252 INFO L82 PathProgramCache]: Analyzing trace with hash 618757655, now seen corresponding path program 1 times [2019-11-07 01:14:14,252 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:14,252 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283951350] [2019-11-07 01:14:14,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:14,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:14:14,342 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283951350] [2019-11-07 01:14:14,342 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:14,342 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 01:14:14,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59033784] [2019-11-07 01:14:14,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:14:14,344 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:14,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:14:14,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:14,345 INFO L87 Difference]: Start difference. First operand 643 states and 801 transitions. Second operand 6 states. [2019-11-07 01:14:14,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:14,438 INFO L93 Difference]: Finished difference Result 1294 states and 1626 transitions. [2019-11-07 01:14:14,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:14:14,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-11-07 01:14:14,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:14,444 INFO L225 Difference]: With dead ends: 1294 [2019-11-07 01:14:14,444 INFO L226 Difference]: Without dead ends: 671 [2019-11-07 01:14:14,447 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:14:14,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-11-07 01:14:14,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 663. [2019-11-07 01:14:14,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-11-07 01:14:14,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 819 transitions. [2019-11-07 01:14:14,503 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 819 transitions. Word has length 73 [2019-11-07 01:14:14,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:14,503 INFO L462 AbstractCegarLoop]: Abstraction has 663 states and 819 transitions. [2019-11-07 01:14:14,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:14:14,503 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 819 transitions. [2019-11-07 01:14:14,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-07 01:14:14,505 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:14,505 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:14,505 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:14,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:14,506 INFO L82 PathProgramCache]: Analyzing trace with hash 641389909, now seen corresponding path program 1 times [2019-11-07 01:14:14,507 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:14,512 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643571009] [2019-11-07 01:14:14,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:14,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:14:14,633 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643571009] [2019-11-07 01:14:14,634 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:14,635 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 01:14:14,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026049390] [2019-11-07 01:14:14,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:14:14,636 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:14,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:14:14,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:14,637 INFO L87 Difference]: Start difference. First operand 663 states and 819 transitions. Second operand 6 states. [2019-11-07 01:14:14,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:14,798 INFO L93 Difference]: Finished difference Result 1333 states and 1667 transitions. [2019-11-07 01:14:14,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 01:14:14,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-11-07 01:14:14,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:14,807 INFO L225 Difference]: With dead ends: 1333 [2019-11-07 01:14:14,807 INFO L226 Difference]: Without dead ends: 784 [2019-11-07 01:14:14,810 INFO L630 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-11-07 01:14:14,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-11-07 01:14:14,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 770. [2019-11-07 01:14:14,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2019-11-07 01:14:14,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 953 transitions. [2019-11-07 01:14:14,864 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 953 transitions. Word has length 73 [2019-11-07 01:14:14,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:14,864 INFO L462 AbstractCegarLoop]: Abstraction has 770 states and 953 transitions. [2019-11-07 01:14:14,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:14:14,865 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 953 transitions. [2019-11-07 01:14:14,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-07 01:14:14,866 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:14,867 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:14,867 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:14,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:14,868 INFO L82 PathProgramCache]: Analyzing trace with hash 298865229, now seen corresponding path program 1 times [2019-11-07 01:14:14,868 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:14,868 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809706506] [2019-11-07 01:14:14,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:14,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:14:14,975 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809706506] [2019-11-07 01:14:14,975 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:14,975 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 01:14:14,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777423352] [2019-11-07 01:14:14,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:14:14,977 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:14,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:14:14,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:14,978 INFO L87 Difference]: Start difference. First operand 770 states and 953 transitions. Second operand 6 states. [2019-11-07 01:14:15,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:15,826 INFO L93 Difference]: Finished difference Result 1390 states and 1848 transitions. [2019-11-07 01:14:15,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 01:14:15,827 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-11-07 01:14:15,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:15,836 INFO L225 Difference]: With dead ends: 1390 [2019-11-07 01:14:15,836 INFO L226 Difference]: Without dead ends: 1052 [2019-11-07 01:14:15,839 INFO L630 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-11-07 01:14:15,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-11-07 01:14:15,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 996. [2019-11-07 01:14:15,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 996 states. [2019-11-07 01:14:15,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1303 transitions. [2019-11-07 01:14:15,919 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1303 transitions. Word has length 86 [2019-11-07 01:14:15,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:15,920 INFO L462 AbstractCegarLoop]: Abstraction has 996 states and 1303 transitions. [2019-11-07 01:14:15,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:14:15,920 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1303 transitions. [2019-11-07 01:14:15,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-07 01:14:15,922 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:15,922 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:14:15,922 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:15,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:15,923 INFO L82 PathProgramCache]: Analyzing trace with hash -681624608, now seen corresponding path program 1 times [2019-11-07 01:14:15,924 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:15,924 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116043591] [2019-11-07 01:14:15,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:16,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-11-07 01:14:16,187 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116043591] [2019-11-07 01:14:16,188 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:16,188 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 01:14:16,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260403395] [2019-11-07 01:14:16,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 01:14:16,189 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:16,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 01:14:16,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:14:16,190 INFO L87 Difference]: Start difference. First operand 996 states and 1303 transitions. Second operand 9 states. [2019-11-07 01:14:17,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:17,903 INFO L93 Difference]: Finished difference Result 2244 states and 3204 transitions. [2019-11-07 01:14:17,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-07 01:14:17,904 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2019-11-07 01:14:17,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:17,923 INFO L225 Difference]: With dead ends: 2244 [2019-11-07 01:14:17,924 INFO L226 Difference]: Without dead ends: 1719 [2019-11-07 01:14:17,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-11-07 01:14:17,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2019-11-07 01:14:18,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1584. [2019-11-07 01:14:18,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2019-11-07 01:14:18,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2177 transitions. [2019-11-07 01:14:18,070 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2177 transitions. Word has length 90 [2019-11-07 01:14:18,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:18,071 INFO L462 AbstractCegarLoop]: Abstraction has 1584 states and 2177 transitions. [2019-11-07 01:14:18,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 01:14:18,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2177 transitions. [2019-11-07 01:14:18,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-07 01:14:18,073 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:18,074 INFO L410 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-11-07 01:14:18,074 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:18,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:18,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1835313196, now seen corresponding path program 1 times [2019-11-07 01:14:18,075 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:18,075 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137887335] [2019-11-07 01:14:18,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:18,117 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-07 01:14:18,117 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137887335] [2019-11-07 01:14:18,119 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980411126] [2019-11-07 01:14:18,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:14:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:18,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 01:14:18,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:14:18,279 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-07 01:14:18,280 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:14:18,363 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-07 01:14:18,364 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 01:14:18,364 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 3 [2019-11-07 01:14:18,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203660214] [2019-11-07 01:14:18,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:14:18,365 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:18,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:14:18,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:14:18,366 INFO L87 Difference]: Start difference. First operand 1584 states and 2177 transitions. Second operand 3 states. [2019-11-07 01:14:18,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:18,551 INFO L93 Difference]: Finished difference Result 4511 states and 6933 transitions. [2019-11-07 01:14:18,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:14:18,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-11-07 01:14:18,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:18,574 INFO L225 Difference]: With dead ends: 4511 [2019-11-07 01:14:18,574 INFO L226 Difference]: Without dead ends: 2948 [2019-11-07 01:14:18,589 INFO L630 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-11-07 01:14:18,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2019-11-07 01:14:18,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 2944. [2019-11-07 01:14:18,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2944 states. [2019-11-07 01:14:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 4358 transitions. [2019-11-07 01:14:18,814 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 4358 transitions. Word has length 92 [2019-11-07 01:14:18,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:18,815 INFO L462 AbstractCegarLoop]: Abstraction has 2944 states and 4358 transitions. [2019-11-07 01:14:18,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:14:18,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 4358 transitions. [2019-11-07 01:14:18,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-07 01:14:18,817 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:18,818 INFO L410 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-11-07 01:14:19,023 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:14:19,023 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:19,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:19,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1952555228, now seen corresponding path program 1 times [2019-11-07 01:14:19,024 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:19,024 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612623350] [2019-11-07 01:14:19,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:19,258 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-07 01:14:19,258 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612623350] [2019-11-07 01:14:19,259 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330321824] [2019-11-07 01:14:19,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:14:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:19,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-07 01:14:19,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:14:19,585 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:14:19,589 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:14:19,671 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-07 01:14:19,671 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 01:14:19,671 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2019-11-07 01:14:19,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053537229] [2019-11-07 01:14:19,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:14:19,672 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:19,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:14:19,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:14:19,673 INFO L87 Difference]: Start difference. First operand 2944 states and 4358 transitions. Second operand 4 states. [2019-11-07 01:14:19,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:19,999 INFO L93 Difference]: Finished difference Result 8050 states and 12526 transitions. [2019-11-07 01:14:20,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:14:20,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-07 01:14:20,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:20,048 INFO L225 Difference]: With dead ends: 8050 [2019-11-07 01:14:20,048 INFO L226 Difference]: Without dead ends: 5133 [2019-11-07 01:14:20,107 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:14:20,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5133 states. [2019-11-07 01:14:20,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5133 to 5128. [2019-11-07 01:14:20,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5128 states. [2019-11-07 01:14:20,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5128 states to 5128 states and 6882 transitions. [2019-11-07 01:14:20,704 INFO L78 Accepts]: Start accepts. Automaton has 5128 states and 6882 transitions. Word has length 94 [2019-11-07 01:14:20,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:20,704 INFO L462 AbstractCegarLoop]: Abstraction has 5128 states and 6882 transitions. [2019-11-07 01:14:20,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:14:20,704 INFO L276 IsEmpty]: Start isEmpty. Operand 5128 states and 6882 transitions. [2019-11-07 01:14:20,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-07 01:14:20,709 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:20,710 INFO L410 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-11-07 01:14:20,922 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:14:20,922 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:20,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:20,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1028804159, now seen corresponding path program 1 times [2019-11-07 01:14:20,923 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:20,923 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472857544] [2019-11-07 01:14:20,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:21,030 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-07 01:14:21,031 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472857544] [2019-11-07 01:14:21,031 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199895688] [2019-11-07 01:14:21,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:14:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:21,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-07 01:14:21,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:14:21,215 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:14:21,215 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:14:21,319 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-07 01:14:21,320 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 01:14:21,320 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [8] total 11 [2019-11-07 01:14:21,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225610548] [2019-11-07 01:14:21,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:21,322 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:21,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:21,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-07 01:14:21,323 INFO L87 Difference]: Start difference. First operand 5128 states and 6882 transitions. Second operand 5 states. [2019-11-07 01:14:21,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:21,919 INFO L93 Difference]: Finished difference Result 9928 states and 13460 transitions. [2019-11-07 01:14:21,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:14:21,919 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-11-07 01:14:21,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:21,955 INFO L225 Difference]: With dead ends: 9928 [2019-11-07 01:14:21,955 INFO L226 Difference]: Without dead ends: 4751 [2019-11-07 01:14:21,991 INFO L630 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-11-07 01:14:21,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4751 states. [2019-11-07 01:14:22,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4751 to 4745. [2019-11-07 01:14:22,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4745 states. [2019-11-07 01:14:22,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4745 states to 4745 states and 5752 transitions. [2019-11-07 01:14:22,413 INFO L78 Accepts]: Start accepts. Automaton has 4745 states and 5752 transitions. Word has length 97 [2019-11-07 01:14:22,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:22,414 INFO L462 AbstractCegarLoop]: Abstraction has 4745 states and 5752 transitions. [2019-11-07 01:14:22,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:22,414 INFO L276 IsEmpty]: Start isEmpty. Operand 4745 states and 5752 transitions. [2019-11-07 01:14:22,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-07 01:14:22,420 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:22,421 INFO L410 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-11-07 01:14:22,626 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:14:22,627 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:22,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:22,628 INFO L82 PathProgramCache]: Analyzing trace with hash -630281820, now seen corresponding path program 1 times [2019-11-07 01:14:22,628 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:22,628 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533856292] [2019-11-07 01:14:22,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:22,730 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 19 proven. 20 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-07 01:14:22,730 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533856292] [2019-11-07 01:14:22,731 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543953577] [2019-11-07 01:14:22,731 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-11-07 01:14:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:22,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-07 01:14:22,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:14:22,895 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-07 01:14:22,896 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:14:23,036 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-07 01:14:23,036 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 01:14:23,036 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [8] total 10 [2019-11-07 01:14:23,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477224840] [2019-11-07 01:14:23,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:14:23,038 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:23,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:14:23,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-07 01:14:23,038 INFO L87 Difference]: Start difference. First operand 4745 states and 5752 transitions. Second operand 4 states. [2019-11-07 01:14:23,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:23,417 INFO L93 Difference]: Finished difference Result 7178 states and 8726 transitions. [2019-11-07 01:14:23,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:14:23,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-11-07 01:14:23,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:23,445 INFO L225 Difference]: With dead ends: 7178 [2019-11-07 01:14:23,446 INFO L226 Difference]: Without dead ends: 3333 [2019-11-07 01:14:23,461 INFO L630 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-11-07 01:14:23,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3333 states. [2019-11-07 01:14:23,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3333 to 3333. [2019-11-07 01:14:23,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3333 states. [2019-11-07 01:14:23,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3333 states to 3333 states and 4006 transitions. [2019-11-07 01:14:23,689 INFO L78 Accepts]: Start accepts. Automaton has 3333 states and 4006 transitions. Word has length 165 [2019-11-07 01:14:23,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:23,690 INFO L462 AbstractCegarLoop]: Abstraction has 3333 states and 4006 transitions. [2019-11-07 01:14:23,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:14:23,690 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 4006 transitions. [2019-11-07 01:14:23,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-07 01:14:23,696 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:23,697 INFO L410 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-11-07 01:14:23,903 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:14:23,903 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:23,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:23,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1714362604, now seen corresponding path program 1 times [2019-11-07 01:14:23,904 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:23,904 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606883956] [2019-11-07 01:14:23,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:23,971 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-07 01:14:23,971 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606883956] [2019-11-07 01:14:23,971 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145389988] [2019-11-07 01:14:23,972 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-11-07 01:14:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:24,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 01:14:24,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:14:24,130 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-07 01:14:24,130 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:14:24,243 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-07 01:14:24,243 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 01:14:24,244 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2019-11-07 01:14:24,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004195728] [2019-11-07 01:14:24,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:14:24,245 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:24,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:14:24,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:14:24,245 INFO L87 Difference]: Start difference. First operand 3333 states and 4006 transitions. Second operand 3 states. [2019-11-07 01:14:24,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:24,618 INFO L93 Difference]: Finished difference Result 7851 states and 9685 transitions. [2019-11-07 01:14:24,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:14:24,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-11-07 01:14:24,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:24,653 INFO L225 Difference]: With dead ends: 7851 [2019-11-07 01:14:24,654 INFO L226 Difference]: Without dead ends: 4544 [2019-11-07 01:14:24,662 INFO L630 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-11-07 01:14:24,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4544 states. [2019-11-07 01:14:24,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4544 to 4541. [2019-11-07 01:14:24,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4541 states. [2019-11-07 01:14:24,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4541 states to 4541 states and 5488 transitions. [2019-11-07 01:14:24,919 INFO L78 Accepts]: Start accepts. Automaton has 4541 states and 5488 transitions. Word has length 170 [2019-11-07 01:14:24,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:24,919 INFO L462 AbstractCegarLoop]: Abstraction has 4541 states and 5488 transitions. [2019-11-07 01:14:24,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:14:24,920 INFO L276 IsEmpty]: Start isEmpty. Operand 4541 states and 5488 transitions. [2019-11-07 01:14:24,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-07 01:14:24,926 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:24,926 INFO L410 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-11-07 01:14:25,131 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:14:25,131 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:25,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:25,132 INFO L82 PathProgramCache]: Analyzing trace with hash -703541462, now seen corresponding path program 1 times [2019-11-07 01:14:25,132 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:25,132 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973164660] [2019-11-07 01:14:25,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:25,419 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-07 01:14:25,420 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973164660] [2019-11-07 01:14:25,426 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:25,426 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:14:25,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053650390] [2019-11-07 01:14:25,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:14:25,428 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:25,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:14:25,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:14:25,429 INFO L87 Difference]: Start difference. First operand 4541 states and 5488 transitions. Second operand 4 states. [2019-11-07 01:14:25,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:25,756 INFO L93 Difference]: Finished difference Result 10009 states and 12185 transitions. [2019-11-07 01:14:25,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:14:25,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-11-07 01:14:25,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:25,798 INFO L225 Difference]: With dead ends: 10009 [2019-11-07 01:14:25,798 INFO L226 Difference]: Without dead ends: 5494 [2019-11-07 01:14:25,808 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:14:25,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5494 states. [2019-11-07 01:14:26,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5494 to 5494. [2019-11-07 01:14:26,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5494 states. [2019-11-07 01:14:26,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5494 states to 5494 states and 6326 transitions. [2019-11-07 01:14:26,266 INFO L78 Accepts]: Start accepts. Automaton has 5494 states and 6326 transitions. Word has length 170 [2019-11-07 01:14:26,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:26,267 INFO L462 AbstractCegarLoop]: Abstraction has 5494 states and 6326 transitions. [2019-11-07 01:14:26,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:14:26,267 INFO L276 IsEmpty]: Start isEmpty. Operand 5494 states and 6326 transitions. [2019-11-07 01:14:26,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-07 01:14:26,275 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:26,275 INFO L410 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-11-07 01:14:26,276 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:26,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:26,276 INFO L82 PathProgramCache]: Analyzing trace with hash 771902308, now seen corresponding path program 1 times [2019-11-07 01:14:26,276 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:26,277 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293796286] [2019-11-07 01:14:26,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:26,421 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 22 proven. 20 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-07 01:14:26,422 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293796286] [2019-11-07 01:14:26,422 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741003057] [2019-11-07 01:14:26,422 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-11-07 01:14:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:26,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-07 01:14:26,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:14:26,628 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-07 01:14:26,629 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:14:26,801 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-07 01:14:26,802 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 01:14:26,802 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 5] total 9 [2019-11-07 01:14:26,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860642809] [2019-11-07 01:14:26,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:14:26,804 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:26,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:14:26,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:14:26,804 INFO L87 Difference]: Start difference. First operand 5494 states and 6326 transitions. Second operand 6 states. [2019-11-07 01:14:27,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:27,876 INFO L93 Difference]: Finished difference Result 8461 states and 9768 transitions. [2019-11-07 01:14:27,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 01:14:27,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 204 [2019-11-07 01:14:27,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:27,903 INFO L225 Difference]: With dead ends: 8461 [2019-11-07 01:14:27,903 INFO L226 Difference]: Without dead ends: 4233 [2019-11-07 01:14:27,909 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 406 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-07 01:14:27,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4233 states. [2019-11-07 01:14:28,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4233 to 4230. [2019-11-07 01:14:28,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4230 states. [2019-11-07 01:14:28,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4230 states to 4230 states and 4827 transitions. [2019-11-07 01:14:28,120 INFO L78 Accepts]: Start accepts. Automaton has 4230 states and 4827 transitions. Word has length 204 [2019-11-07 01:14:28,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:28,120 INFO L462 AbstractCegarLoop]: Abstraction has 4230 states and 4827 transitions. [2019-11-07 01:14:28,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:14:28,121 INFO L276 IsEmpty]: Start isEmpty. Operand 4230 states and 4827 transitions. [2019-11-07 01:14:28,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-07 01:14:28,126 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:28,127 INFO L410 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-11-07 01:14:28,332 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:14:28,332 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:28,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:28,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1674822886, now seen corresponding path program 1 times [2019-11-07 01:14:28,333 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:28,333 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116771235] [2019-11-07 01:14:28,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:28,392 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-11-07 01:14:28,393 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116771235] [2019-11-07 01:14:28,393 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:28,393 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:14:28,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225268843] [2019-11-07 01:14:28,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:14:28,396 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:28,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:14:28,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:14:28,396 INFO L87 Difference]: Start difference. First operand 4230 states and 4827 transitions. Second operand 4 states. [2019-11-07 01:14:28,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:28,631 INFO L93 Difference]: Finished difference Result 4773 states and 5421 transitions. [2019-11-07 01:14:28,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:14:28,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2019-11-07 01:14:28,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:28,651 INFO L225 Difference]: With dead ends: 4773 [2019-11-07 01:14:28,651 INFO L226 Difference]: Without dead ends: 4225 [2019-11-07 01:14:28,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:14:28,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4225 states. [2019-11-07 01:14:28,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4225 to 4225. [2019-11-07 01:14:28,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4225 states. [2019-11-07 01:14:28,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4225 states to 4225 states and 4818 transitions. [2019-11-07 01:14:28,873 INFO L78 Accepts]: Start accepts. Automaton has 4225 states and 4818 transitions. Word has length 204 [2019-11-07 01:14:28,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:28,874 INFO L462 AbstractCegarLoop]: Abstraction has 4225 states and 4818 transitions. [2019-11-07 01:14:28,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:14:28,874 INFO L276 IsEmpty]: Start isEmpty. Operand 4225 states and 4818 transitions. [2019-11-07 01:14:28,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-07 01:14:28,879 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:28,880 INFO L410 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-11-07 01:14:28,880 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:28,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:28,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1301793383, now seen corresponding path program 1 times [2019-11-07 01:14:28,881 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:28,881 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525326812] [2019-11-07 01:14:28,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:28,993 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 23 proven. 34 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-11-07 01:14:28,994 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525326812] [2019-11-07 01:14:28,994 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910948339] [2019-11-07 01:14:28,994 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-11-07 01:14:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:29,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-07 01:14:29,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:14:29,267 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-07 01:14:29,267 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:14:29,452 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-07 01:14:29,453 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 01:14:29,453 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 6] total 14 [2019-11-07 01:14:29,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137664383] [2019-11-07 01:14:29,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:14:29,454 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:29,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:14:29,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-07 01:14:29,455 INFO L87 Difference]: Start difference. First operand 4225 states and 4818 transitions. Second operand 6 states. [2019-11-07 01:14:29,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:29,619 INFO L93 Difference]: Finished difference Result 6892 states and 7951 transitions. [2019-11-07 01:14:29,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 01:14:29,619 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 205 [2019-11-07 01:14:29,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:29,632 INFO L225 Difference]: With dead ends: 6892 [2019-11-07 01:14:29,632 INFO L226 Difference]: Without dead ends: 2688 [2019-11-07 01:14:29,640 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 405 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-07 01:14:29,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2688 states. [2019-11-07 01:14:29,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2688 to 2523. [2019-11-07 01:14:29,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2523 states. [2019-11-07 01:14:29,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 2879 transitions. [2019-11-07 01:14:29,769 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 2879 transitions. Word has length 205 [2019-11-07 01:14:29,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:29,769 INFO L462 AbstractCegarLoop]: Abstraction has 2523 states and 2879 transitions. [2019-11-07 01:14:29,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:14:29,770 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 2879 transitions. [2019-11-07 01:14:29,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-07 01:14:29,774 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:29,774 INFO L410 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-11-07 01:14:29,982 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:14:29,983 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:29,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:29,984 INFO L82 PathProgramCache]: Analyzing trace with hash 519037793, now seen corresponding path program 1 times [2019-11-07 01:14:29,984 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:29,984 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213574383] [2019-11-07 01:14:29,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:30,078 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-11-07 01:14:30,078 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213574383] [2019-11-07 01:14:30,079 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:14:30,079 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:14:30,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032726732] [2019-11-07 01:14:30,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:14:30,080 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:30,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:14:30,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:14:30,081 INFO L87 Difference]: Start difference. First operand 2523 states and 2879 transitions. Second operand 5 states. [2019-11-07 01:14:30,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:30,528 INFO L93 Difference]: Finished difference Result 4790 states and 5479 transitions. [2019-11-07 01:14:30,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:14:30,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 212 [2019-11-07 01:14:30,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:30,538 INFO L225 Difference]: With dead ends: 4790 [2019-11-07 01:14:30,539 INFO L226 Difference]: Without dead ends: 2389 [2019-11-07 01:14:30,542 INFO L630 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-11-07 01:14:30,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2389 states. [2019-11-07 01:14:30,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2389 to 2378. [2019-11-07 01:14:30,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2378 states. [2019-11-07 01:14:30,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 2378 states and 2696 transitions. [2019-11-07 01:14:30,656 INFO L78 Accepts]: Start accepts. Automaton has 2378 states and 2696 transitions. Word has length 212 [2019-11-07 01:14:30,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:30,657 INFO L462 AbstractCegarLoop]: Abstraction has 2378 states and 2696 transitions. [2019-11-07 01:14:30,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:14:30,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2378 states and 2696 transitions. [2019-11-07 01:14:30,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-11-07 01:14:30,661 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:30,661 INFO L410 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-11-07 01:14:30,661 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:30,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:30,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1837583679, now seen corresponding path program 1 times [2019-11-07 01:14:30,662 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:30,662 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796586771] [2019-11-07 01:14:30,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:30,806 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-11-07 01:14:30,807 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796586771] [2019-11-07 01:14:30,807 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392215239] [2019-11-07 01:14:30,807 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-11-07 01:14:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:31,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-07 01:14:31,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:14:31,085 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-07 01:14:31,086 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:14:31,245 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-11-07 01:14:31,245 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 01:14:31,246 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2019-11-07 01:14:31,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820976086] [2019-11-07 01:14:31,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:14:31,249 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:31,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:14:31,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:31,250 INFO L87 Difference]: Start difference. First operand 2378 states and 2696 transitions. Second operand 3 states. [2019-11-07 01:14:31,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:31,368 INFO L93 Difference]: Finished difference Result 4809 states and 5450 transitions. [2019-11-07 01:14:31,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:14:31,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2019-11-07 01:14:31,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:31,379 INFO L225 Difference]: With dead ends: 4809 [2019-11-07 01:14:31,380 INFO L226 Difference]: Without dead ends: 2553 [2019-11-07 01:14:31,383 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 435 SyntacticMatches, 8 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:14:31,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2553 states. [2019-11-07 01:14:31,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2553 to 2549. [2019-11-07 01:14:31,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2549 states. [2019-11-07 01:14:31,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2549 states to 2549 states and 2878 transitions. [2019-11-07 01:14:31,505 INFO L78 Accepts]: Start accepts. Automaton has 2549 states and 2878 transitions. Word has length 221 [2019-11-07 01:14:31,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:31,506 INFO L462 AbstractCegarLoop]: Abstraction has 2549 states and 2878 transitions. [2019-11-07 01:14:31,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:14:31,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2549 states and 2878 transitions. [2019-11-07 01:14:31,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-11-07 01:14:31,510 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:31,511 INFO L410 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-11-07 01:14:31,714 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:14:31,714 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:31,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:31,715 INFO L82 PathProgramCache]: Analyzing trace with hash 204920273, now seen corresponding path program 1 times [2019-11-07 01:14:31,715 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:31,715 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408979702] [2019-11-07 01:14:31,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:32,056 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-11-07 01:14:32,056 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408979702] [2019-11-07 01:14:32,056 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404429292] [2019-11-07 01:14:32,056 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-11-07 01:14:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:32,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 862 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-07 01:14:32,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:14:32,319 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-07 01:14:32,319 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:14:32,611 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-07 01:14:32,612 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 01:14:32,612 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12, 8] total 18 [2019-11-07 01:14:32,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734364305] [2019-11-07 01:14:32,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 01:14:32,613 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:14:32,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 01:14:32,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-11-07 01:14:32,613 INFO L87 Difference]: Start difference. First operand 2549 states and 2878 transitions. Second operand 9 states. [2019-11-07 01:14:34,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:14:34,098 INFO L93 Difference]: Finished difference Result 5279 states and 6001 transitions. [2019-11-07 01:14:34,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-07 01:14:34,099 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 222 [2019-11-07 01:14:34,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:14:34,114 INFO L225 Difference]: With dead ends: 5279 [2019-11-07 01:14:34,114 INFO L226 Difference]: Without dead ends: 3023 [2019-11-07 01:14:34,119 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 447 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2019-11-07 01:14:34,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3023 states. [2019-11-07 01:14:34,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3023 to 2986. [2019-11-07 01:14:34,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2986 states. [2019-11-07 01:14:34,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2986 states to 2986 states and 3377 transitions. [2019-11-07 01:14:34,278 INFO L78 Accepts]: Start accepts. Automaton has 2986 states and 3377 transitions. Word has length 222 [2019-11-07 01:14:34,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:14:34,279 INFO L462 AbstractCegarLoop]: Abstraction has 2986 states and 3377 transitions. [2019-11-07 01:14:34,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 01:14:34,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2986 states and 3377 transitions. [2019-11-07 01:14:34,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-07 01:14:34,281 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:14:34,282 INFO L410 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-11-07 01:14:34,494 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:14:34,495 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:14:34,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:14:34,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1036438586, now seen corresponding path program 1 times [2019-11-07 01:14:34,495 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:14:34,496 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491880658] [2019-11-07 01:14:34,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:14:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:34,820 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 6 proven. 68 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-11-07 01:14:34,820 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491880658] [2019-11-07 01:14:34,820 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311990369] [2019-11-07 01:14:34,821 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-11-07 01:14:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:14:35,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 869 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-07 01:14:35,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:14:35,257 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 97 proven. 34 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-11-07 01:14:35,257 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:14:35,607 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-07 01:14:35,608 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [597149025] [2019-11-07 01:14:35,619 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 227 [2019-11-07 01:14:35,702 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 01:14:35,703 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2)