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/kundu2.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:28:10,222 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:28:10,225 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:28:10,245 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:28:10,245 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:28:10,247 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:28:10,249 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:28:10,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:28:10,263 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:28:10,267 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:28:10,269 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:28:10,270 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:28:10,271 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:28:10,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:28:10,275 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:28:10,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:28:10,278 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:28:10,279 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:28:10,280 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:28:10,285 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:28:10,289 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:28:10,292 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:28:10,295 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:28:10,295 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:28:10,297 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:28:10,298 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:28:10,298 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:28:10,300 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:28:10,301 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:28:10,302 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:28:10,302 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:28:10,304 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:28:10,305 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:28:10,305 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:28:10,307 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:28:10,307 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:28:10,308 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:28:10,308 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:28:10,308 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:28:10,309 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:28:10,311 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:28:10,311 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:28:10,346 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:28:10,346 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:28:10,350 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:28:10,352 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:28:10,353 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:28:10,353 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:28:10,353 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:28:10,353 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:28:10,353 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:28:10,353 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:28:10,354 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:28:10,354 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:28:10,354 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:28:10,354 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:28:10,354 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:28:10,355 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:28:10,355 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:28:10,355 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:28:10,355 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:28:10,355 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:28:10,356 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:28:10,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:28:10,356 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:28:10,356 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:28:10,357 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:28:10,357 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:28:10,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:28:10,357 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:28:10,357 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:28:10,632 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:28:10,652 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:28:10,656 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:28:10,658 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:28:10,658 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:28:10,659 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/kundu2.cil.c [2019-10-15 01:28:10,741 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e49832613/db6e332911664045a22ac663c112a6a1/FLAGf5d321054 [2019-10-15 01:28:11,271 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:28:11,272 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/kundu2.cil.c [2019-10-15 01:28:11,281 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e49832613/db6e332911664045a22ac663c112a6a1/FLAGf5d321054 [2019-10-15 01:28:11,657 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e49832613/db6e332911664045a22ac663c112a6a1 [2019-10-15 01:28:11,668 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:28:11,670 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:28:11,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:11,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:28:11,674 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:28:11,676 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:11" (1/1) ... [2019-10-15 01:28:11,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26a7327f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:11, skipping insertion in model container [2019-10-15 01:28:11,679 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:11" (1/1) ... [2019-10-15 01:28:11,687 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:28:11,723 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:28:11,951 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:11,957 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:28:12,102 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:12,124 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:28:12,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:12 WrapperNode [2019-10-15 01:28:12,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:12,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:28:12,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:28:12,126 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:28:12,135 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:12" (1/1) ... [2019-10-15 01:28:12,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:12" (1/1) ... [2019-10-15 01:28:12,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:12" (1/1) ... [2019-10-15 01:28:12,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:12" (1/1) ... [2019-10-15 01:28:12,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:12" (1/1) ... [2019-10-15 01:28:12,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:12" (1/1) ... [2019-10-15 01:28:12,171 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:12" (1/1) ... [2019-10-15 01:28:12,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:28:12,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:28:12,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:28:12,175 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:28:12,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:28:12,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:28:12,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:28:12,237 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-15 01:28:12,238 INFO L138 BoogieDeclarations]: Found implementation of procedure read_data [2019-10-15 01:28:12,238 INFO L138 BoogieDeclarations]: Found implementation of procedure write_data [2019-10-15 01:28:12,238 INFO L138 BoogieDeclarations]: Found implementation of procedure P_1 [2019-10-15 01:28:12,238 INFO L138 BoogieDeclarations]: Found implementation of procedure is_P_1_triggered [2019-10-15 01:28:12,238 INFO L138 BoogieDeclarations]: Found implementation of procedure P_2 [2019-10-15 01:28:12,238 INFO L138 BoogieDeclarations]: Found implementation of procedure is_P_2_triggered [2019-10-15 01:28:12,239 INFO L138 BoogieDeclarations]: Found implementation of procedure C_1 [2019-10-15 01:28:12,239 INFO L138 BoogieDeclarations]: Found implementation of procedure is_C_1_triggered [2019-10-15 01:28:12,239 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-15 01:28:12,239 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-15 01:28:12,239 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-15 01:28:12,239 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-15 01:28:12,239 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-15 01:28:12,240 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-15 01:28:12,240 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-15 01:28:12,240 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-15 01:28:12,240 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-15 01:28:12,240 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-15 01:28:12,240 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-15 01:28:12,241 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-15 01:28:12,241 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-15 01:28:12,241 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:28:12,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:28:12,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:28:12,242 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-15 01:28:12,242 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-15 01:28:12,242 INFO L130 BoogieDeclarations]: Found specification of procedure read_data [2019-10-15 01:28:12,242 INFO L130 BoogieDeclarations]: Found specification of procedure write_data [2019-10-15 01:28:12,242 INFO L130 BoogieDeclarations]: Found specification of procedure P_1 [2019-10-15 01:28:12,242 INFO L130 BoogieDeclarations]: Found specification of procedure is_P_1_triggered [2019-10-15 01:28:12,243 INFO L130 BoogieDeclarations]: Found specification of procedure P_2 [2019-10-15 01:28:12,243 INFO L130 BoogieDeclarations]: Found specification of procedure is_P_2_triggered [2019-10-15 01:28:12,243 INFO L130 BoogieDeclarations]: Found specification of procedure C_1 [2019-10-15 01:28:12,243 INFO L130 BoogieDeclarations]: Found specification of procedure is_C_1_triggered [2019-10-15 01:28:12,243 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-15 01:28:12,243 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-15 01:28:12,243 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-15 01:28:12,244 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-15 01:28:12,244 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-15 01:28:12,244 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-15 01:28:12,244 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-15 01:28:12,244 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-15 01:28:12,244 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-15 01:28:12,245 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-15 01:28:12,245 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-15 01:28:12,245 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-15 01:28:12,245 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:28:12,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:28:12,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:28:12,796 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:28:12,797 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-15 01:28:12,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:12 BoogieIcfgContainer [2019-10-15 01:28:12,799 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:28:12,800 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:28:12,800 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:28:12,804 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:28:12,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:28:11" (1/3) ... [2019-10-15 01:28:12,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112a68ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:12, skipping insertion in model container [2019-10-15 01:28:12,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:12" (2/3) ... [2019-10-15 01:28:12,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112a68ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:12, skipping insertion in model container [2019-10-15 01:28:12,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:12" (3/3) ... [2019-10-15 01:28:12,808 INFO L109 eAbstractionObserver]: Analyzing ICFG kundu2.cil.c [2019-10-15 01:28:12,819 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:28:12,828 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:28:12,840 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:28:12,868 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:28:12,869 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:28:12,869 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:28:12,869 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:28:12,870 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:28:12,870 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:28:12,870 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:28:12,870 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:28:12,896 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states. [2019-10-15 01:28:12,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-15 01:28:12,909 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:12,911 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:12,913 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:12,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:12,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1619619400, now seen corresponding path program 1 times [2019-10-15 01:28:12,926 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:12,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021339143] [2019-10-15 01:28:12,927 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:12,927 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:12,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:13,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:13,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:13,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021339143] [2019-10-15 01:28:13,318 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:13,318 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:13,319 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245356080] [2019-10-15 01:28:13,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:13,329 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:13,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:13,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:13,347 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 4 states. [2019-10-15 01:28:13,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:13,822 INFO L93 Difference]: Finished difference Result 493 states and 700 transitions. [2019-10-15 01:28:13,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:13,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-10-15 01:28:13,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:13,842 INFO L225 Difference]: With dead ends: 493 [2019-10-15 01:28:13,842 INFO L226 Difference]: Without dead ends: 319 [2019-10-15 01:28:13,849 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:13,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-10-15 01:28:13,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 312. [2019-10-15 01:28:13,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-10-15 01:28:13,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 410 transitions. [2019-10-15 01:28:13,934 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 410 transitions. Word has length 82 [2019-10-15 01:28:13,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:13,935 INFO L462 AbstractCegarLoop]: Abstraction has 312 states and 410 transitions. [2019-10-15 01:28:13,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:13,935 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 410 transitions. [2019-10-15 01:28:13,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-15 01:28:13,939 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:13,940 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:13,940 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:13,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:13,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1801870201, now seen corresponding path program 1 times [2019-10-15 01:28:13,941 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:13,941 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635297844] [2019-10-15 01:28:13,941 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:13,942 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:13,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:14,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:14,106 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635297844] [2019-10-15 01:28:14,107 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:14,107 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:14,107 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992496495] [2019-10-15 01:28:14,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:14,112 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:14,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:14,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:14,117 INFO L87 Difference]: Start difference. First operand 312 states and 410 transitions. Second operand 4 states. [2019-10-15 01:28:14,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:14,457 INFO L93 Difference]: Finished difference Result 881 states and 1195 transitions. [2019-10-15 01:28:14,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:14,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-10-15 01:28:14,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:14,473 INFO L225 Difference]: With dead ends: 881 [2019-10-15 01:28:14,473 INFO L226 Difference]: Without dead ends: 590 [2019-10-15 01:28:14,485 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:14,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-15 01:28:14,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 565. [2019-10-15 01:28:14,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-10-15 01:28:14,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 735 transitions. [2019-10-15 01:28:14,597 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 735 transitions. Word has length 82 [2019-10-15 01:28:14,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:14,599 INFO L462 AbstractCegarLoop]: Abstraction has 565 states and 735 transitions. [2019-10-15 01:28:14,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:14,599 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 735 transitions. [2019-10-15 01:28:14,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-15 01:28:14,611 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:14,611 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:14,612 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:14,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:14,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1148563485, now seen corresponding path program 1 times [2019-10-15 01:28:14,613 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:14,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479709311] [2019-10-15 01:28:14,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:14,614 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:14,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:14,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:14,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479709311] [2019-10-15 01:28:14,852 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:14,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:28:14,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852450935] [2019-10-15 01:28:14,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:14,853 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:14,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:14,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:14,854 INFO L87 Difference]: Start difference. First operand 565 states and 735 transitions. Second operand 6 states. [2019-10-15 01:28:14,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:14,934 INFO L93 Difference]: Finished difference Result 1129 states and 1502 transitions. [2019-10-15 01:28:14,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:14,934 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-10-15 01:28:14,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:14,940 INFO L225 Difference]: With dead ends: 1129 [2019-10-15 01:28:14,940 INFO L226 Difference]: Without dead ends: 585 [2019-10-15 01:28:14,943 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:14,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-10-15 01:28:14,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 575. [2019-10-15 01:28:14,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-10-15 01:28:15,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 743 transitions. [2019-10-15 01:28:15,002 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 743 transitions. Word has length 83 [2019-10-15 01:28:15,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:15,003 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 743 transitions. [2019-10-15 01:28:15,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:15,004 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 743 transitions. [2019-10-15 01:28:15,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-15 01:28:15,008 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:15,009 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:15,009 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:15,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:15,010 INFO L82 PathProgramCache]: Analyzing trace with hash -223243813, now seen corresponding path program 1 times [2019-10-15 01:28:15,010 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:15,011 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857483937] [2019-10-15 01:28:15,011 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:15,011 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:15,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:15,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:15,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857483937] [2019-10-15 01:28:15,161 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:15,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:28:15,162 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283008159] [2019-10-15 01:28:15,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:15,163 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:15,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:15,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:15,164 INFO L87 Difference]: Start difference. First operand 575 states and 743 transitions. Second operand 6 states. [2019-10-15 01:28:15,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:15,322 INFO L93 Difference]: Finished difference Result 1504 states and 1996 transitions. [2019-10-15 01:28:15,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:28:15,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-10-15 01:28:15,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:15,330 INFO L225 Difference]: With dead ends: 1504 [2019-10-15 01:28:15,330 INFO L226 Difference]: Without dead ends: 951 [2019-10-15 01:28:15,334 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:28:15,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-10-15 01:28:15,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 927. [2019-10-15 01:28:15,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2019-10-15 01:28:15,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1213 transitions. [2019-10-15 01:28:15,394 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1213 transitions. Word has length 83 [2019-10-15 01:28:15,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:15,394 INFO L462 AbstractCegarLoop]: Abstraction has 927 states and 1213 transitions. [2019-10-15 01:28:15,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:15,395 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1213 transitions. [2019-10-15 01:28:15,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-15 01:28:15,396 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:15,397 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:28:15,397 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:15,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:15,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1894736262, now seen corresponding path program 1 times [2019-10-15 01:28:15,398 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:15,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596774559] [2019-10-15 01:28:15,398 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:15,398 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:15,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:15,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:15,571 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596774559] [2019-10-15 01:28:15,571 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:15,571 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:28:15,572 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313325554] [2019-10-15 01:28:15,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:28:15,573 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:15,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:28:15,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:28:15,573 INFO L87 Difference]: Start difference. First operand 927 states and 1213 transitions. Second operand 8 states. [2019-10-15 01:28:17,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:17,247 INFO L93 Difference]: Finished difference Result 2914 states and 4213 transitions. [2019-10-15 01:28:17,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 01:28:17,248 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-10-15 01:28:17,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:17,269 INFO L225 Difference]: With dead ends: 2914 [2019-10-15 01:28:17,270 INFO L226 Difference]: Without dead ends: 2131 [2019-10-15 01:28:17,277 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-10-15 01:28:17,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2131 states. [2019-10-15 01:28:17,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2131 to 2014. [2019-10-15 01:28:17,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2014 states. [2019-10-15 01:28:17,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 2850 transitions. [2019-10-15 01:28:17,452 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 2850 transitions. Word has length 96 [2019-10-15 01:28:17,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:17,453 INFO L462 AbstractCegarLoop]: Abstraction has 2014 states and 2850 transitions. [2019-10-15 01:28:17,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:28:17,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 2850 transitions. [2019-10-15 01:28:17,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-15 01:28:17,460 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:17,460 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:17,461 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:17,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:17,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1165049387, now seen corresponding path program 1 times [2019-10-15 01:28:17,461 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:17,462 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427571620] [2019-10-15 01:28:17,462 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:17,462 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:17,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:17,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:17,679 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427571620] [2019-10-15 01:28:17,680 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:17,680 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:28:17,680 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969610148] [2019-10-15 01:28:17,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:28:17,682 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:17,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:28:17,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:28:17,683 INFO L87 Difference]: Start difference. First operand 2014 states and 2850 transitions. Second operand 9 states. [2019-10-15 01:28:19,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:19,756 INFO L93 Difference]: Finished difference Result 2322 states and 3502 transitions. [2019-10-15 01:28:19,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 01:28:19,757 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-10-15 01:28:19,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:19,774 INFO L225 Difference]: With dead ends: 2322 [2019-10-15 01:28:19,774 INFO L226 Difference]: Without dead ends: 2319 [2019-10-15 01:28:19,777 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:28:19,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2019-10-15 01:28:19,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 2118. [2019-10-15 01:28:19,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2118 states. [2019-10-15 01:28:19,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2118 states to 2118 states and 3079 transitions. [2019-10-15 01:28:19,931 INFO L78 Accepts]: Start accepts. Automaton has 2118 states and 3079 transitions. Word has length 101 [2019-10-15 01:28:19,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:19,932 INFO L462 AbstractCegarLoop]: Abstraction has 2118 states and 3079 transitions. [2019-10-15 01:28:19,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:28:19,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2118 states and 3079 transitions. [2019-10-15 01:28:19,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-15 01:28:19,935 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:19,935 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:19,935 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:19,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:19,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1774230569, now seen corresponding path program 1 times [2019-10-15 01:28:19,936 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:19,936 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274693128] [2019-10-15 01:28:19,937 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:19,937 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:19,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:20,013 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:28:20,013 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274693128] [2019-10-15 01:28:20,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444085376] [2019-10-15 01:28:20,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:20,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:20,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:20,182 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:28:20,183 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:20,256 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:28:20,256 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:28:20,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 3 [2019-10-15 01:28:20,257 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157821308] [2019-10-15 01:28:20,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:20,258 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:20,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:20,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:20,258 INFO L87 Difference]: Start difference. First operand 2118 states and 3079 transitions. Second operand 3 states. [2019-10-15 01:28:20,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:20,452 INFO L93 Difference]: Finished difference Result 6100 states and 9810 transitions. [2019-10-15 01:28:20,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:20,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-10-15 01:28:20,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:20,485 INFO L225 Difference]: With dead ends: 6100 [2019-10-15 01:28:20,486 INFO L226 Difference]: Without dead ends: 4004 [2019-10-15 01:28:20,507 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:20,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4004 states. [2019-10-15 01:28:20,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4004 to 3999. [2019-10-15 01:28:20,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3999 states. [2019-10-15 01:28:20,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3999 states to 3999 states and 6242 transitions. [2019-10-15 01:28:20,930 INFO L78 Accepts]: Start accepts. Automaton has 3999 states and 6242 transitions. Word has length 104 [2019-10-15 01:28:20,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:20,931 INFO L462 AbstractCegarLoop]: Abstraction has 3999 states and 6242 transitions. [2019-10-15 01:28:20,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:20,931 INFO L276 IsEmpty]: Start isEmpty. Operand 3999 states and 6242 transitions. [2019-10-15 01:28:20,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:28:20,936 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:20,936 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:21,141 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:21,141 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:21,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:21,142 INFO L82 PathProgramCache]: Analyzing trace with hash 535357227, now seen corresponding path program 1 times [2019-10-15 01:28:21,142 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:21,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925690629] [2019-10-15 01:28:21,144 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:21,144 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:21,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:21,265 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-15 01:28:21,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925690629] [2019-10-15 01:28:21,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925828319] [2019-10-15 01:28:21,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:21,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:28:21,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:21,468 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:21,468 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:21,563 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-15 01:28:21,563 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:21,564 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2019-10-15 01:28:21,565 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401960232] [2019-10-15 01:28:21,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:21,566 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:21,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:21,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:28:21,566 INFO L87 Difference]: Start difference. First operand 3999 states and 6242 transitions. Second operand 4 states. [2019-10-15 01:28:22,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:22,453 INFO L93 Difference]: Finished difference Result 11251 states and 19542 transitions. [2019-10-15 01:28:22,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:22,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-15 01:28:22,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:22,518 INFO L225 Difference]: With dead ends: 11251 [2019-10-15 01:28:22,519 INFO L226 Difference]: Without dead ends: 7281 [2019-10-15 01:28:22,585 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:28:22,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7281 states. [2019-10-15 01:28:23,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7281 to 7276. [2019-10-15 01:28:23,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7276 states. [2019-10-15 01:28:23,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7276 states to 7276 states and 11676 transitions. [2019-10-15 01:28:23,240 INFO L78 Accepts]: Start accepts. Automaton has 7276 states and 11676 transitions. Word has length 106 [2019-10-15 01:28:23,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:23,241 INFO L462 AbstractCegarLoop]: Abstraction has 7276 states and 11676 transitions. [2019-10-15 01:28:23,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:23,241 INFO L276 IsEmpty]: Start isEmpty. Operand 7276 states and 11676 transitions. [2019-10-15 01:28:23,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-15 01:28:23,247 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:23,247 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:23,460 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:23,460 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:23,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:23,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1679546114, now seen corresponding path program 1 times [2019-10-15 01:28:23,462 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:23,462 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127320913] [2019-10-15 01:28:23,462 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:23,462 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:23,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:23,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 01:28:23,679 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127320913] [2019-10-15 01:28:23,679 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:23,679 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:23,679 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615451403] [2019-10-15 01:28:23,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:23,680 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:23,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:23,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:23,681 INFO L87 Difference]: Start difference. First operand 7276 states and 11676 transitions. Second operand 4 states. [2019-10-15 01:28:24,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:24,373 INFO L93 Difference]: Finished difference Result 14515 states and 23294 transitions. [2019-10-15 01:28:24,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:24,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-15 01:28:24,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:24,447 INFO L225 Difference]: With dead ends: 14515 [2019-10-15 01:28:24,447 INFO L226 Difference]: Without dead ends: 7264 [2019-10-15 01:28:24,500 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:24,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7264 states. [2019-10-15 01:28:25,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7264 to 7264. [2019-10-15 01:28:25,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7264 states. [2019-10-15 01:28:25,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7264 states to 7264 states and 11651 transitions. [2019-10-15 01:28:25,178 INFO L78 Accepts]: Start accepts. Automaton has 7264 states and 11651 transitions. Word has length 112 [2019-10-15 01:28:25,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:25,178 INFO L462 AbstractCegarLoop]: Abstraction has 7264 states and 11651 transitions. [2019-10-15 01:28:25,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:25,179 INFO L276 IsEmpty]: Start isEmpty. Operand 7264 states and 11651 transitions. [2019-10-15 01:28:25,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-15 01:28:25,184 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:25,184 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:25,184 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:25,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:25,185 INFO L82 PathProgramCache]: Analyzing trace with hash -719656318, now seen corresponding path program 1 times [2019-10-15 01:28:25,185 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:25,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919477025] [2019-10-15 01:28:25,186 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:25,186 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:25,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:25,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:25,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:28:25,267 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919477025] [2019-10-15 01:28:25,267 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:25,267 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:28:25,267 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151930264] [2019-10-15 01:28:25,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:28:25,268 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:25,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:28:25,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:25,269 INFO L87 Difference]: Start difference. First operand 7264 states and 11651 transitions. Second operand 7 states. [2019-10-15 01:28:27,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:27,072 INFO L93 Difference]: Finished difference Result 18690 states and 31816 transitions. [2019-10-15 01:28:27,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:28:27,073 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2019-10-15 01:28:27,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:27,152 INFO L225 Difference]: With dead ends: 18690 [2019-10-15 01:28:27,152 INFO L226 Difference]: Without dead ends: 11807 [2019-10-15 01:28:27,220 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:28:27,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11807 states. [2019-10-15 01:28:27,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11807 to 11665. [2019-10-15 01:28:27,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11665 states. [2019-10-15 01:28:28,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11665 states to 11665 states and 18163 transitions. [2019-10-15 01:28:28,040 INFO L78 Accepts]: Start accepts. Automaton has 11665 states and 18163 transitions. Word has length 112 [2019-10-15 01:28:28,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:28,041 INFO L462 AbstractCegarLoop]: Abstraction has 11665 states and 18163 transitions. [2019-10-15 01:28:28,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:28:28,041 INFO L276 IsEmpty]: Start isEmpty. Operand 11665 states and 18163 transitions. [2019-10-15 01:28:28,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-15 01:28:28,047 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:28,048 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:28,048 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:28,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:28,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1217934684, now seen corresponding path program 1 times [2019-10-15 01:28:28,049 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:28,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163702171] [2019-10-15 01:28:28,049 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:28,049 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:28,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:28,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:28:28,252 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163702171] [2019-10-15 01:28:28,252 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:28,252 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:28:28,252 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324651162] [2019-10-15 01:28:28,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:28:28,253 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:28,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:28:28,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:28:28,254 INFO L87 Difference]: Start difference. First operand 11665 states and 18163 transitions. Second operand 8 states. [2019-10-15 01:28:29,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:29,522 INFO L93 Difference]: Finished difference Result 26321 states and 42898 transitions. [2019-10-15 01:28:29,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 01:28:29,523 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 116 [2019-10-15 01:28:29,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:29,608 INFO L225 Difference]: With dead ends: 26321 [2019-10-15 01:28:29,608 INFO L226 Difference]: Without dead ends: 12925 [2019-10-15 01:28:29,678 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:28:29,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12925 states. [2019-10-15 01:28:30,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12925 to 12705. [2019-10-15 01:28:30,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12705 states. [2019-10-15 01:28:30,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12705 states to 12705 states and 20517 transitions. [2019-10-15 01:28:30,591 INFO L78 Accepts]: Start accepts. Automaton has 12705 states and 20517 transitions. Word has length 116 [2019-10-15 01:28:30,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:30,592 INFO L462 AbstractCegarLoop]: Abstraction has 12705 states and 20517 transitions. [2019-10-15 01:28:30,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:28:30,592 INFO L276 IsEmpty]: Start isEmpty. Operand 12705 states and 20517 transitions. [2019-10-15 01:28:30,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-15 01:28:30,598 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:30,598 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:28:30,598 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:30,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:30,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1456232897, now seen corresponding path program 1 times [2019-10-15 01:28:30,600 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:30,600 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481460511] [2019-10-15 01:28:30,600 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:30,600 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:30,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:30,698 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:28:30,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481460511] [2019-10-15 01:28:30,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816562060] [2019-10-15 01:28:30,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:30,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:30,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:28:30,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:30,853 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:28:30,854 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:30,949 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:28:30,950 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:28:30,950 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8, 4] total 11 [2019-10-15 01:28:30,950 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477813875] [2019-10-15 01:28:30,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:30,951 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:30,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:30,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:28:30,952 INFO L87 Difference]: Start difference. First operand 12705 states and 20517 transitions. Second operand 3 states. [2019-10-15 01:28:31,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:31,865 INFO L93 Difference]: Finished difference Result 25098 states and 42951 transitions. [2019-10-15 01:28:31,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:31,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-10-15 01:28:31,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:31,927 INFO L225 Difference]: With dead ends: 25098 [2019-10-15 01:28:31,927 INFO L226 Difference]: Without dead ends: 12420 [2019-10-15 01:28:31,994 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 239 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:28:32,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12420 states. [2019-10-15 01:28:32,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12420 to 12414. [2019-10-15 01:28:32,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12414 states. [2019-10-15 01:28:32,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12414 states to 12414 states and 18928 transitions. [2019-10-15 01:28:32,634 INFO L78 Accepts]: Start accepts. Automaton has 12414 states and 18928 transitions. Word has length 121 [2019-10-15 01:28:32,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:32,635 INFO L462 AbstractCegarLoop]: Abstraction has 12414 states and 18928 transitions. [2019-10-15 01:28:32,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:32,635 INFO L276 IsEmpty]: Start isEmpty. Operand 12414 states and 18928 transitions. [2019-10-15 01:28:32,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-15 01:28:32,642 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:32,642 INFO L380 BasicCegarLoop]: trace histogram [3, 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] [2019-10-15 01:28:32,846 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:32,846 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:32,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:32,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1440725386, now seen corresponding path program 1 times [2019-10-15 01:28:32,847 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:32,847 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940249782] [2019-10-15 01:28:32,847 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:32,848 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:32,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:32,924 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:28:32,925 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940249782] [2019-10-15 01:28:32,925 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:32,925 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:28:32,925 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869880294] [2019-10-15 01:28:32,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:28:32,926 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:32,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:28:32,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:28:32,927 INFO L87 Difference]: Start difference. First operand 12414 states and 18928 transitions. Second operand 8 states. [2019-10-15 01:28:37,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:37,891 INFO L93 Difference]: Finished difference Result 48202 states and 84998 transitions. [2019-10-15 01:28:37,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-15 01:28:37,891 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 125 [2019-10-15 01:28:37,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:38,135 INFO L225 Difference]: With dead ends: 48202 [2019-10-15 01:28:38,136 INFO L226 Difference]: Without dead ends: 34108 [2019-10-15 01:28:38,270 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2019-10-15 01:28:38,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34108 states. [2019-10-15 01:28:39,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34108 to 32598. [2019-10-15 01:28:39,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32598 states. [2019-10-15 01:28:39,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32598 states to 32598 states and 54458 transitions. [2019-10-15 01:28:39,994 INFO L78 Accepts]: Start accepts. Automaton has 32598 states and 54458 transitions. Word has length 125 [2019-10-15 01:28:39,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:39,994 INFO L462 AbstractCegarLoop]: Abstraction has 32598 states and 54458 transitions. [2019-10-15 01:28:39,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:28:39,994 INFO L276 IsEmpty]: Start isEmpty. Operand 32598 states and 54458 transitions. [2019-10-15 01:28:40,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-15 01:28:40,003 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:40,003 INFO L380 BasicCegarLoop]: trace histogram [3, 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] [2019-10-15 01:28:40,003 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:40,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:40,004 INFO L82 PathProgramCache]: Analyzing trace with hash 109681911, now seen corresponding path program 1 times [2019-10-15 01:28:40,004 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:40,004 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113182540] [2019-10-15 01:28:40,004 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:40,005 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:40,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:40,091 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:28:40,092 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113182540] [2019-10-15 01:28:40,092 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012738885] [2019-10-15 01:28:40,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:40,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:28:40,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:40,276 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:40,277 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:40,368 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:28:40,368 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:40,369 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2019-10-15 01:28:40,369 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357077065] [2019-10-15 01:28:40,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:40,370 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:40,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:40,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:28:40,370 INFO L87 Difference]: Start difference. First operand 32598 states and 54458 transitions. Second operand 4 states.