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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/systemc/pc_sfifo_3.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 04:10:10,433 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 04:10:10,435 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 04:10:10,454 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 04:10:10,454 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 04:10:10,455 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 04:10:10,458 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 04:10:10,467 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 04:10:10,470 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 04:10:10,473 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 04:10:10,475 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 04:10:10,477 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 04:10:10,477 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 04:10:10,479 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 04:10:10,481 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 04:10:10,483 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 04:10:10,484 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 04:10:10,485 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 04:10:10,487 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 04:10:10,492 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 04:10:10,496 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 04:10:10,497 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 04:10:10,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 04:10:10,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 04:10:10,503 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 04:10:10,503 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 04:10:10,503 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 04:10:10,505 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 04:10:10,506 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 04:10:10,507 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 04:10:10,508 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 04:10:10,508 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 04:10:10,509 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 04:10:10,510 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 04:10:10,511 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 04:10:10,512 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 04:10:10,512 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 04:10:10,512 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 04:10:10,513 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 04:10:10,513 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 04:10:10,514 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 04:10:10,515 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 04:10:10,544 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 04:10:10,545 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 04:10:10,548 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 04:10:10,548 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 04:10:10,548 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 04:10:10,549 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 04:10:10,549 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 04:10:10,549 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 04:10:10,549 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 04:10:10,549 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 04:10:10,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 04:10:10,552 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 04:10:10,552 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 04:10:10,553 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 04:10:10,553 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 04:10:10,553 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 04:10:10,553 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 04:10:10,553 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 04:10:10,554 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 04:10:10,554 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 04:10:10,554 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 04:10:10,554 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 04:10:10,556 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 04:10:10,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 04:10:10,557 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 04:10:10,557 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 04:10:10,557 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 04:10:10,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 04:10:10,558 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 04:10:10,558 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 04:10:10,586 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 04:10:10,599 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 04:10:10,602 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 04:10:10,603 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 04:10:10,603 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 04:10:10,604 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_3.cil.c [2019-10-03 04:10:10,675 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f6e17e44/b14e3e508ff44be4878b6f120f057daf/FLAG3622593f3 [2019-10-03 04:10:11,136 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 04:10:11,137 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_3.cil.c [2019-10-03 04:10:11,147 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f6e17e44/b14e3e508ff44be4878b6f120f057daf/FLAG3622593f3 [2019-10-03 04:10:11,485 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f6e17e44/b14e3e508ff44be4878b6f120f057daf [2019-10-03 04:10:11,496 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 04:10:11,499 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 04:10:11,501 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 04:10:11,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 04:10:11,505 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 04:10:11,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 04:10:11" (1/1) ... [2019-10-03 04:10:11,510 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7391c683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:11, skipping insertion in model container [2019-10-03 04:10:11,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 04:10:11" (1/1) ... [2019-10-03 04:10:11,517 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 04:10:11,554 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 04:10:11,775 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 04:10:11,784 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 04:10:11,930 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 04:10:11,951 INFO L192 MainTranslator]: Completed translation [2019-10-03 04:10:11,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:11 WrapperNode [2019-10-03 04:10:11,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 04:10:11,952 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 04:10:11,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 04:10:11,953 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 04:10:11,962 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:11" (1/1) ... [2019-10-03 04:10:11,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:11" (1/1) ... [2019-10-03 04:10:11,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:11" (1/1) ... [2019-10-03 04:10:11,971 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:11" (1/1) ... [2019-10-03 04:10:11,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:11" (1/1) ... [2019-10-03 04:10:11,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:11" (1/1) ... [2019-10-03 04:10:11,996 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:11" (1/1) ... [2019-10-03 04:10:12,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 04:10:12,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 04:10:12,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 04:10:12,001 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 04:10:12,001 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:11" (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-03 04:10:12,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 04:10:12,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 04:10:12,065 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-03 04:10:12,065 INFO L138 BoogieDeclarations]: Found implementation of procedure update_fifo_q [2019-10-03 04:10:12,065 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2019-10-03 04:10:12,065 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2019-10-03 04:10:12,065 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2019-10-03 04:10:12,065 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2019-10-03 04:10:12,066 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2019-10-03 04:10:12,066 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-03 04:10:12,066 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-03 04:10:12,066 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-03 04:10:12,066 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-03 04:10:12,066 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-03 04:10:12,066 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-03 04:10:12,067 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-03 04:10:12,067 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-03 04:10:12,067 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-03 04:10:12,067 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-03 04:10:12,067 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-03 04:10:12,067 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-03 04:10:12,067 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 04:10:12,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 04:10:12,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 04:10:12,068 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-03 04:10:12,068 INFO L130 BoogieDeclarations]: Found specification of procedure update_fifo_q [2019-10-03 04:10:12,068 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2019-10-03 04:10:12,068 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2019-10-03 04:10:12,068 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2019-10-03 04:10:12,069 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2019-10-03 04:10:12,069 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2019-10-03 04:10:12,069 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-03 04:10:12,069 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-03 04:10:12,069 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-03 04:10:12,069 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-03 04:10:12,069 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-03 04:10:12,070 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-03 04:10:12,070 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-03 04:10:12,070 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-03 04:10:12,070 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-03 04:10:12,070 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-03 04:10:12,070 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-03 04:10:12,070 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-03 04:10:12,071 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 04:10:12,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 04:10:12,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 04:10:12,578 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := ~a~0; [2019-10-03 04:10:12,578 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !(1 == ~q_free~0); [2019-10-03 04:10:12,589 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 04:10:12,589 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-03 04:10:12,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 04:10:12 BoogieIcfgContainer [2019-10-03 04:10:12,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 04:10:12,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 04:10:12,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 04:10:12,595 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 04:10:12,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 04:10:11" (1/3) ... [2019-10-03 04:10:12,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f49ee9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 04:10:12, skipping insertion in model container [2019-10-03 04:10:12,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:11" (2/3) ... [2019-10-03 04:10:12,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f49ee9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 04:10:12, skipping insertion in model container [2019-10-03 04:10:12,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 04:10:12" (3/3) ... [2019-10-03 04:10:12,599 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil.c [2019-10-03 04:10:12,608 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 04:10:12,616 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 04:10:12,632 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 04:10:12,664 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 04:10:12,665 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 04:10:12,665 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 04:10:12,665 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 04:10:12,665 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 04:10:12,666 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 04:10:12,666 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 04:10:12,666 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 04:10:12,698 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states. [2019-10-03 04:10:12,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-03 04:10:12,713 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:12,714 INFO L411 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] [2019-10-03 04:10:12,717 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:12,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:12,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1427944937, now seen corresponding path program 1 times [2019-10-03 04:10:12,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:12,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:12,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:12,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:12,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:13,099 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-03 04:10:13,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:13,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:10:13,102 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:13,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:10:13,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:10:13,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:13,125 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 5 states. [2019-10-03 04:10:13,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:13,992 INFO L93 Difference]: Finished difference Result 312 states and 418 transitions. [2019-10-03 04:10:13,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:10:13,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-10-03 04:10:13,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:14,024 INFO L225 Difference]: With dead ends: 312 [2019-10-03 04:10:14,024 INFO L226 Difference]: Without dead ends: 296 [2019-10-03 04:10:14,026 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:14,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-10-03 04:10:14,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 271. [2019-10-03 04:10:14,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-10-03 04:10:14,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 363 transitions. [2019-10-03 04:10:14,124 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 363 transitions. Word has length 78 [2019-10-03 04:10:14,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:14,125 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 363 transitions. [2019-10-03 04:10:14,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:10:14,125 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 363 transitions. [2019-10-03 04:10:14,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-03 04:10:14,130 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:14,131 INFO L411 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] [2019-10-03 04:10:14,131 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:14,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:14,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1440144215, now seen corresponding path program 1 times [2019-10-03 04:10:14,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:14,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:14,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:14,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:14,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:14,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:14,308 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-03 04:10:14,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:14,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 04:10:14,309 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:14,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 04:10:14,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 04:10:14,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:14,315 INFO L87 Difference]: Start difference. First operand 271 states and 363 transitions. Second operand 6 states. [2019-10-03 04:10:15,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:15,268 INFO L93 Difference]: Finished difference Result 493 states and 688 transitions. [2019-10-03 04:10:15,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 04:10:15,269 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-10-03 04:10:15,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:15,276 INFO L225 Difference]: With dead ends: 493 [2019-10-03 04:10:15,277 INFO L226 Difference]: Without dead ends: 493 [2019-10-03 04:10:15,278 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-03 04:10:15,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-10-03 04:10:15,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 416. [2019-10-03 04:10:15,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-10-03 04:10:15,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 562 transitions. [2019-10-03 04:10:15,328 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 562 transitions. Word has length 78 [2019-10-03 04:10:15,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:15,328 INFO L475 AbstractCegarLoop]: Abstraction has 416 states and 562 transitions. [2019-10-03 04:10:15,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 04:10:15,329 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 562 transitions. [2019-10-03 04:10:15,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-03 04:10:15,333 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:15,334 INFO L411 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] [2019-10-03 04:10:15,334 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:15,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:15,334 INFO L82 PathProgramCache]: Analyzing trace with hash -53358805, now seen corresponding path program 1 times [2019-10-03 04:10:15,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:15,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:15,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:15,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:15,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:15,443 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-03 04:10:15,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:15,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 04:10:15,444 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:15,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:10:15,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:10:15,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:10:15,445 INFO L87 Difference]: Start difference. First operand 416 states and 562 transitions. Second operand 4 states. [2019-10-03 04:10:15,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:15,659 INFO L93 Difference]: Finished difference Result 774 states and 1022 transitions. [2019-10-03 04:10:15,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:10:15,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-10-03 04:10:15,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:15,665 INFO L225 Difference]: With dead ends: 774 [2019-10-03 04:10:15,665 INFO L226 Difference]: Without dead ends: 774 [2019-10-03 04:10:15,665 INFO L640 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-03 04:10:15,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2019-10-03 04:10:15,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 761. [2019-10-03 04:10:15,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-10-03 04:10:15,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1010 transitions. [2019-10-03 04:10:15,705 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1010 transitions. Word has length 78 [2019-10-03 04:10:15,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:15,706 INFO L475 AbstractCegarLoop]: Abstraction has 761 states and 1010 transitions. [2019-10-03 04:10:15,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:10:15,706 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1010 transitions. [2019-10-03 04:10:15,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-03 04:10:15,710 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:15,710 INFO L411 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] [2019-10-03 04:10:15,711 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:15,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:15,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1828215755, now seen corresponding path program 1 times [2019-10-03 04:10:15,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:15,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:15,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:15,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:15,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:15,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:15,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:15,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 04:10:15,771 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:15,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 04:10:15,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 04:10:15,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:15,773 INFO L87 Difference]: Start difference. First operand 761 states and 1010 transitions. Second operand 6 states. [2019-10-03 04:10:15,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:15,808 INFO L93 Difference]: Finished difference Result 801 states and 1061 transitions. [2019-10-03 04:10:15,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:10:15,808 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2019-10-03 04:10:15,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:15,813 INFO L225 Difference]: With dead ends: 801 [2019-10-03 04:10:15,813 INFO L226 Difference]: Without dead ends: 801 [2019-10-03 04:10:15,814 INFO L640 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-03 04:10:15,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2019-10-03 04:10:15,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 781. [2019-10-03 04:10:15,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-10-03 04:10:15,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1028 transitions. [2019-10-03 04:10:15,848 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1028 transitions. Word has length 79 [2019-10-03 04:10:15,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:15,848 INFO L475 AbstractCegarLoop]: Abstraction has 781 states and 1028 transitions. [2019-10-03 04:10:15,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 04:10:15,849 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1028 transitions. [2019-10-03 04:10:15,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-03 04:10:15,851 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:15,851 INFO L411 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] [2019-10-03 04:10:15,851 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:15,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:15,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1580069261, now seen corresponding path program 1 times [2019-10-03 04:10:15,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:15,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:15,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:15,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:15,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:15,957 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-03 04:10:15,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:15,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 04:10:15,958 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:15,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:10:15,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:10:15,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:10:15,960 INFO L87 Difference]: Start difference. First operand 781 states and 1028 transitions. Second operand 4 states. [2019-10-03 04:10:16,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:16,132 INFO L93 Difference]: Finished difference Result 1464 states and 1898 transitions. [2019-10-03 04:10:16,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:10:16,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-10-03 04:10:16,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:16,138 INFO L225 Difference]: With dead ends: 1464 [2019-10-03 04:10:16,138 INFO L226 Difference]: Without dead ends: 751 [2019-10-03 04:10:16,139 INFO L640 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-03 04:10:16,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2019-10-03 04:10:16,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 711. [2019-10-03 04:10:16,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2019-10-03 04:10:16,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 923 transitions. [2019-10-03 04:10:16,170 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 923 transitions. Word has length 79 [2019-10-03 04:10:16,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:16,171 INFO L475 AbstractCegarLoop]: Abstraction has 711 states and 923 transitions. [2019-10-03 04:10:16,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:10:16,171 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 923 transitions. [2019-10-03 04:10:16,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-03 04:10:16,173 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:16,173 INFO L411 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] [2019-10-03 04:10:16,174 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:16,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:16,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1122686250, now seen corresponding path program 1 times [2019-10-03 04:10:16,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:16,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:16,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:16,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:16,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:16,262 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-03 04:10:16,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:16,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 04:10:16,269 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:16,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 04:10:16,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 04:10:16,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:16,271 INFO L87 Difference]: Start difference. First operand 711 states and 923 transitions. Second operand 6 states. [2019-10-03 04:10:16,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:16,305 INFO L93 Difference]: Finished difference Result 753 states and 974 transitions. [2019-10-03 04:10:16,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:10:16,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-10-03 04:10:16,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:16,311 INFO L225 Difference]: With dead ends: 753 [2019-10-03 04:10:16,312 INFO L226 Difference]: Without dead ends: 753 [2019-10-03 04:10:16,312 INFO L640 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-03 04:10:16,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2019-10-03 04:10:16,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 741. [2019-10-03 04:10:16,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2019-10-03 04:10:16,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 953 transitions. [2019-10-03 04:10:16,346 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 953 transitions. Word has length 80 [2019-10-03 04:10:16,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:16,347 INFO L475 AbstractCegarLoop]: Abstraction has 741 states and 953 transitions. [2019-10-03 04:10:16,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 04:10:16,347 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 953 transitions. [2019-10-03 04:10:16,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-03 04:10:16,351 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:16,351 INFO L411 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] [2019-10-03 04:10:16,352 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:16,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:16,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1195072808, now seen corresponding path program 1 times [2019-10-03 04:10:16,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:16,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:16,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:16,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:16,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:16,445 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-03 04:10:16,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:16,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 04:10:16,446 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:16,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 04:10:16,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 04:10:16,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:16,447 INFO L87 Difference]: Start difference. First operand 741 states and 953 transitions. Second operand 6 states. [2019-10-03 04:10:17,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:17,306 INFO L93 Difference]: Finished difference Result 897 states and 1168 transitions. [2019-10-03 04:10:17,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 04:10:17,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-10-03 04:10:17,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:17,313 INFO L225 Difference]: With dead ends: 897 [2019-10-03 04:10:17,313 INFO L226 Difference]: Without dead ends: 897 [2019-10-03 04:10:17,314 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-03 04:10:17,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-10-03 04:10:17,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 760. [2019-10-03 04:10:17,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2019-10-03 04:10:17,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 967 transitions. [2019-10-03 04:10:17,360 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 967 transitions. Word has length 80 [2019-10-03 04:10:17,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:17,361 INFO L475 AbstractCegarLoop]: Abstraction has 760 states and 967 transitions. [2019-10-03 04:10:17,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 04:10:17,361 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 967 transitions. [2019-10-03 04:10:17,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-03 04:10:17,363 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:17,364 INFO L411 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] [2019-10-03 04:10:17,364 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:17,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:17,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1704545898, now seen corresponding path program 1 times [2019-10-03 04:10:17,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:17,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:17,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:17,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:17,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:17,416 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-03 04:10:17,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:17,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:10:17,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:17,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:10:17,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:10:17,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:10:17,419 INFO L87 Difference]: Start difference. First operand 760 states and 967 transitions. Second operand 3 states. [2019-10-03 04:10:17,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:17,456 INFO L93 Difference]: Finished difference Result 1435 states and 1860 transitions. [2019-10-03 04:10:17,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:10:17,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-10-03 04:10:17,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:17,469 INFO L225 Difference]: With dead ends: 1435 [2019-10-03 04:10:17,470 INFO L226 Difference]: Without dead ends: 1435 [2019-10-03 04:10:17,470 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:10:17,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2019-10-03 04:10:17,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1423. [2019-10-03 04:10:17,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1423 states. [2019-10-03 04:10:17,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1848 transitions. [2019-10-03 04:10:17,543 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1848 transitions. Word has length 80 [2019-10-03 04:10:17,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:17,543 INFO L475 AbstractCegarLoop]: Abstraction has 1423 states and 1848 transitions. [2019-10-03 04:10:17,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:10:17,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1848 transitions. [2019-10-03 04:10:17,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-03 04:10:17,547 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:17,547 INFO L411 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] [2019-10-03 04:10:17,547 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:17,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:17,548 INFO L82 PathProgramCache]: Analyzing trace with hash 683659270, now seen corresponding path program 1 times [2019-10-03 04:10:17,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:17,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:17,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:17,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:17,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:17,640 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-03 04:10:17,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:17,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:10:17,641 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:17,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:10:17,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:10:17,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:10:17,642 INFO L87 Difference]: Start difference. First operand 1423 states and 1848 transitions. Second operand 3 states. [2019-10-03 04:10:17,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:17,667 INFO L93 Difference]: Finished difference Result 1351 states and 1739 transitions. [2019-10-03 04:10:17,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:10:17,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-10-03 04:10:17,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:17,668 INFO L225 Difference]: With dead ends: 1351 [2019-10-03 04:10:17,668 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 04:10:17,668 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-03 04:10:17,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 04:10:17,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 04:10:17,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 04:10:17,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 04:10:17,669 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2019-10-03 04:10:17,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:17,670 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 04:10:17,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:10:17,670 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 04:10:17,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 04:10:17,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 04:10:17 BoogieIcfgContainer [2019-10-03 04:10:17,676 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 04:10:17,679 INFO L168 Benchmark]: Toolchain (without parser) took 6179.25 ms. Allocated memory was 139.5 MB in the beginning and 323.5 MB in the end (delta: 184.0 MB). Free memory was 87.1 MB in the beginning and 270.9 MB in the end (delta: -183.8 MB). Peak memory consumption was 191.9 kB. Max. memory is 7.1 GB. [2019-10-03 04:10:17,679 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 139.5 MB. Free memory is still 105.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-03 04:10:17,680 INFO L168 Benchmark]: CACSL2BoogieTranslator took 450.85 ms. Allocated memory was 139.5 MB in the beginning and 200.3 MB in the end (delta: 60.8 MB). Free memory was 86.6 MB in the beginning and 176.8 MB in the end (delta: -90.2 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. [2019-10-03 04:10:17,681 INFO L168 Benchmark]: Boogie Preprocessor took 47.54 ms. Allocated memory is still 200.3 MB. Free memory was 176.8 MB in the beginning and 174.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-10-03 04:10:17,682 INFO L168 Benchmark]: RCFGBuilder took 590.48 ms. Allocated memory is still 200.3 MB. Free memory was 174.0 MB in the beginning and 139.0 MB in the end (delta: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 7.1 GB. [2019-10-03 04:10:17,683 INFO L168 Benchmark]: TraceAbstraction took 5084.17 ms. Allocated memory was 200.3 MB in the beginning and 323.5 MB in the end (delta: 123.2 MB). Free memory was 138.1 MB in the beginning and 270.9 MB in the end (delta: -132.8 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-10-03 04:10:17,687 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 139.5 MB. Free memory is still 105.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 450.85 ms. Allocated memory was 139.5 MB in the beginning and 200.3 MB in the end (delta: 60.8 MB). Free memory was 86.6 MB in the beginning and 176.8 MB in the end (delta: -90.2 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.54 ms. Allocated memory is still 200.3 MB. Free memory was 176.8 MB in the beginning and 174.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 590.48 ms. Allocated memory is still 200.3 MB. Free memory was 174.0 MB in the beginning and 139.0 MB in the end (delta: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5084.17 ms. Allocated memory was 200.3 MB in the beginning and 323.5 MB in the end (delta: 123.2 MB). Free memory was 138.1 MB in the beginning and 270.9 MB in the end (delta: -132.8 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 22 procedures, 158 locations, 1 error locations. SAFE Result, 5.0s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2054 SDtfs, 2196 SDslu, 2590 SDs, 0 SdLazy, 2163 SolverSat, 483 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1423occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 336 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 713 NumberOfCodeBlocks, 713 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 704 ConstructedInterpolants, 0 QuantifiedInterpolants, 82582 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...