./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 677126e8d6773c92cc337bfe0a3ec155f49f784424155f33a8c9c24ee0a42113 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:15:52,872 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:15:52,927 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:15:52,932 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:15:52,932 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:15:52,950 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:15:52,951 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:15:52,951 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:15:52,951 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:15:52,951 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:15:52,952 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:15:52,952 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:15:52,952 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:15:52,953 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:15:52,953 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:15:52,953 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:15:52,953 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:15:52,953 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:15:52,953 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:15:52,953 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:15:52,953 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:15:52,954 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:15:52,954 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:15:52,954 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:15:52,954 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:15:52,954 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:15:52,954 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:15:52,954 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:15:52,954 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:15:52,954 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:15:52,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:15:52,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:15:52,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:15:52,955 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:15:52,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:15:52,956 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:15:52,956 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:15:52,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:15:52,956 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:15:52,956 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:15:52,956 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:15:52,956 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:15:52,956 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:15:52,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:15:52,956 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:15:52,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:15:52,956 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:15:52,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:15:52,957 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 677126e8d6773c92cc337bfe0a3ec155f49f784424155f33a8c9c24ee0a42113 [2025-01-09 04:15:53,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:15:53,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:15:53,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:15:53,173 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:15:53,173 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:15:53,174 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2025-01-09 04:15:54,346 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa3af2444/e22c0179c58f4ef88e26a7c62b806b3e/FLAG08b689154 [2025-01-09 04:15:54,604 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:15:54,605 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2025-01-09 04:15:54,611 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa3af2444/e22c0179c58f4ef88e26a7c62b806b3e/FLAG08b689154 [2025-01-09 04:15:54,919 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa3af2444/e22c0179c58f4ef88e26a7c62b806b3e [2025-01-09 04:15:54,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:15:54,922 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:15:54,924 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:15:54,925 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:15:54,928 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:15:54,929 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:15:54" (1/1) ... [2025-01-09 04:15:54,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a1c3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:54, skipping insertion in model container [2025-01-09 04:15:54,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:15:54" (1/1) ... [2025-01-09 04:15:54,966 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:15:55,059 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c[640,653] [2025-01-09 04:15:55,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:15:55,113 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:15:55,120 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c[640,653] [2025-01-09 04:15:55,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:15:55,164 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:15:55,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:55 WrapperNode [2025-01-09 04:15:55,165 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:15:55,166 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:15:55,166 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:15:55,166 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:15:55,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:55" (1/1) ... [2025-01-09 04:15:55,178 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:55" (1/1) ... [2025-01-09 04:15:55,196 INFO L138 Inliner]: procedures = 31, calls = 35, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 215 [2025-01-09 04:15:55,200 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:15:55,201 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:15:55,201 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:15:55,201 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:15:55,208 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:55" (1/1) ... [2025-01-09 04:15:55,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:55" (1/1) ... [2025-01-09 04:15:55,214 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:55" (1/1) ... [2025-01-09 04:15:55,222 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 04:15:55,223 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:55" (1/1) ... [2025-01-09 04:15:55,223 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:55" (1/1) ... [2025-01-09 04:15:55,226 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:55" (1/1) ... [2025-01-09 04:15:55,226 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:55" (1/1) ... [2025-01-09 04:15:55,232 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:55" (1/1) ... [2025-01-09 04:15:55,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:55" (1/1) ... [2025-01-09 04:15:55,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:55" (1/1) ... [2025-01-09 04:15:55,240 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:15:55,240 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:15:55,243 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:15:55,243 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:15:55,244 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:55" (1/1) ... [2025-01-09 04:15:55,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:15:55,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:15:55,270 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:15:55,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:15:55,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:15:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-01-09 04:15:55,295 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-01-09 04:15:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-01-09 04:15:55,295 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-01-09 04:15:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 04:15:55,295 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 04:15:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 04:15:55,295 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 04:15:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 04:15:55,295 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 04:15:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 04:15:55,295 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 04:15:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:15:55,296 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 04:15:55,296 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 04:15:55,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:15:55,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:15:55,296 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-01-09 04:15:55,296 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-01-09 04:15:55,354 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:15:55,355 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:15:55,521 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume !(1 == ~q_free~0); [2025-01-09 04:15:55,521 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##45: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2025-01-09 04:15:55,548 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-01-09 04:15:55,549 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:15:55,556 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:15:55,556 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 04:15:55,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:15:55 BoogieIcfgContainer [2025-01-09 04:15:55,556 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:15:55,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:15:55,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:15:55,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:15:55,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:15:54" (1/3) ... [2025-01-09 04:15:55,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d12e842 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:15:55, skipping insertion in model container [2025-01-09 04:15:55,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:15:55" (2/3) ... [2025-01-09 04:15:55,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d12e842 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:15:55, skipping insertion in model container [2025-01-09 04:15:55,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:15:55" (3/3) ... [2025-01-09 04:15:55,562 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil.c [2025-01-09 04:15:55,571 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:15:55,572 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_3.cil.c that has 9 procedures, 115 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-01-09 04:15:55,629 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:15:55,644 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4d87014d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:15:55,645 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:15:55,652 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 90 states have (on average 1.488888888888889) internal successors, (134), 93 states have internal predecessors, (134), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 04:15:55,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 04:15:55,665 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:55,665 INFO L218 NwaCegarLoop]: 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] [2025-01-09 04:15:55,666 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:55,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:55,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1758174731, now seen corresponding path program 1 times [2025-01-09 04:15:55,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:55,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881529282] [2025-01-09 04:15:55,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:55,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:55,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 04:15:55,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 04:15:55,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:55,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:56,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:56,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:56,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881529282] [2025-01-09 04:15:56,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881529282] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:56,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:56,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:15:56,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862460624] [2025-01-09 04:15:56,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:56,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:15:56,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:56,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:15:56,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:15:56,117 INFO L87 Difference]: Start difference. First operand has 115 states, 90 states have (on average 1.488888888888889) internal successors, (134), 93 states have internal predecessors, (134), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 04:15:56,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:56,665 INFO L93 Difference]: Finished difference Result 338 states and 502 transitions. [2025-01-09 04:15:56,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:15:56,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2025-01-09 04:15:56,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:56,681 INFO L225 Difference]: With dead ends: 338 [2025-01-09 04:15:56,684 INFO L226 Difference]: Without dead ends: 224 [2025-01-09 04:15:56,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:56,692 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 246 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:56,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 389 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:15:56,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-01-09 04:15:56,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 217. [2025-01-09 04:15:56,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 171 states have (on average 1.4444444444444444) internal successors, (247), 175 states have internal predecessors, (247), 29 states have call successors, (29), 15 states have call predecessors, (29), 16 states have return successors, (32), 28 states have call predecessors, (32), 27 states have call successors, (32) [2025-01-09 04:15:56,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 308 transitions. [2025-01-09 04:15:56,737 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 308 transitions. Word has length 62 [2025-01-09 04:15:56,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:56,738 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 308 transitions. [2025-01-09 04:15:56,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 04:15:56,738 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 308 transitions. [2025-01-09 04:15:56,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 04:15:56,742 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:56,742 INFO L218 NwaCegarLoop]: 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] [2025-01-09 04:15:56,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:15:56,742 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:56,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:56,743 INFO L85 PathProgramCache]: Analyzing trace with hash -528343861, now seen corresponding path program 1 times [2025-01-09 04:15:56,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:56,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949809394] [2025-01-09 04:15:56,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:56,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:56,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 04:15:56,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 04:15:56,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:56,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:56,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:56,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:56,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949809394] [2025-01-09 04:15:56,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949809394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:56,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:56,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:15:56,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457197104] [2025-01-09 04:15:56,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:56,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:15:56,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:56,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:15:56,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:56,955 INFO L87 Difference]: Start difference. First operand 217 states and 308 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 04:15:57,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:57,460 INFO L93 Difference]: Finished difference Result 572 states and 811 transitions. [2025-01-09 04:15:57,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:15:57,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2025-01-09 04:15:57,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:57,463 INFO L225 Difference]: With dead ends: 572 [2025-01-09 04:15:57,464 INFO L226 Difference]: Without dead ends: 371 [2025-01-09 04:15:57,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:15:57,467 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 252 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:57,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 702 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:15:57,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-01-09 04:15:57,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 325. [2025-01-09 04:15:57,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 257 states have (on average 1.4357976653696498) internal successors, (369), 263 states have internal predecessors, (369), 42 states have call successors, (42), 22 states have call predecessors, (42), 25 states have return successors, (53), 42 states have call predecessors, (53), 40 states have call successors, (53) [2025-01-09 04:15:57,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 464 transitions. [2025-01-09 04:15:57,511 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 464 transitions. Word has length 62 [2025-01-09 04:15:57,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:57,511 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 464 transitions. [2025-01-09 04:15:57,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 04:15:57,511 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 464 transitions. [2025-01-09 04:15:57,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 04:15:57,514 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:57,514 INFO L218 NwaCegarLoop]: 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] [2025-01-09 04:15:57,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:15:57,514 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:57,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:57,515 INFO L85 PathProgramCache]: Analyzing trace with hash -543862579, now seen corresponding path program 1 times [2025-01-09 04:15:57,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:57,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994219760] [2025-01-09 04:15:57,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:57,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:57,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 04:15:57,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 04:15:57,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:57,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:57,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:57,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:57,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994219760] [2025-01-09 04:15:57,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994219760] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:57,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:57,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:15:57,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423520084] [2025-01-09 04:15:57,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:57,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:15:57,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:57,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:15:57,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:15:57,600 INFO L87 Difference]: Start difference. First operand 325 states and 464 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 04:15:57,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:57,907 INFO L93 Difference]: Finished difference Result 1195 states and 1710 transitions. [2025-01-09 04:15:57,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:15:57,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 62 [2025-01-09 04:15:57,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:57,919 INFO L225 Difference]: With dead ends: 1195 [2025-01-09 04:15:57,919 INFO L226 Difference]: Without dead ends: 892 [2025-01-09 04:15:57,920 INFO L434 NwaCegarLoop]: 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 [2025-01-09 04:15:57,920 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 247 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:57,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 507 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:15:57,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2025-01-09 04:15:57,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 875. [2025-01-09 04:15:57,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 697 states have (on average 1.4017216642754662) internal successors, (977), 711 states have internal predecessors, (977), 102 states have call successors, (102), 64 states have call predecessors, (102), 75 states have return successors, (138), 102 states have call predecessors, (138), 100 states have call successors, (138) [2025-01-09 04:15:57,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1217 transitions. [2025-01-09 04:15:57,981 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1217 transitions. Word has length 62 [2025-01-09 04:15:57,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:57,981 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1217 transitions. [2025-01-09 04:15:57,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 04:15:57,981 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1217 transitions. [2025-01-09 04:15:57,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 04:15:57,983 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:57,983 INFO L218 NwaCegarLoop]: 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] [2025-01-09 04:15:57,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:15:57,984 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:57,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:57,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1886178937, now seen corresponding path program 1 times [2025-01-09 04:15:57,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:57,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141504446] [2025-01-09 04:15:57,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:57,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:57,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 04:15:57,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 04:15:57,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:57,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:58,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:58,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:58,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141504446] [2025-01-09 04:15:58,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141504446] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:58,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:58,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:15:58,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747598186] [2025-01-09 04:15:58,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:58,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:15:58,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:58,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:15:58,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:58,037 INFO L87 Difference]: Start difference. First operand 875 states and 1217 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 04:15:58,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:58,086 INFO L93 Difference]: Finished difference Result 1748 states and 2451 transitions. [2025-01-09 04:15:58,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:15:58,087 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2025-01-09 04:15:58,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:58,094 INFO L225 Difference]: With dead ends: 1748 [2025-01-09 04:15:58,094 INFO L226 Difference]: Without dead ends: 895 [2025-01-09 04:15:58,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:58,096 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:58,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 749 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:58,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2025-01-09 04:15:58,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 895. [2025-01-09 04:15:58,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 713 states have (on average 1.385694249649369) internal successors, (988), 727 states have internal predecessors, (988), 102 states have call successors, (102), 64 states have call predecessors, (102), 79 states have return successors, (145), 106 states have call predecessors, (145), 100 states have call successors, (145) [2025-01-09 04:15:58,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1235 transitions. [2025-01-09 04:15:58,159 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1235 transitions. Word has length 63 [2025-01-09 04:15:58,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:58,160 INFO L471 AbstractCegarLoop]: Abstraction has 895 states and 1235 transitions. [2025-01-09 04:15:58,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 04:15:58,160 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1235 transitions. [2025-01-09 04:15:58,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 04:15:58,162 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:58,162 INFO L218 NwaCegarLoop]: 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] [2025-01-09 04:15:58,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:15:58,162 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:58,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:58,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1491812151, now seen corresponding path program 1 times [2025-01-09 04:15:58,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:58,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413479212] [2025-01-09 04:15:58,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:58,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:58,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 04:15:58,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 04:15:58,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:58,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:58,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:58,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:58,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413479212] [2025-01-09 04:15:58,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413479212] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:58,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:58,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:15:58,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615115481] [2025-01-09 04:15:58,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:58,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:15:58,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:58,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:15:58,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:58,236 INFO L87 Difference]: Start difference. First operand 895 states and 1235 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 04:15:58,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:58,766 INFO L93 Difference]: Finished difference Result 3357 states and 4672 transitions. [2025-01-09 04:15:58,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:15:58,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 63 [2025-01-09 04:15:58,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:58,772 INFO L225 Difference]: With dead ends: 3357 [2025-01-09 04:15:58,772 INFO L226 Difference]: Without dead ends: 1185 [2025-01-09 04:15:58,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:15:58,776 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 883 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:58,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 1160 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:15:58,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2025-01-09 04:15:58,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 820. [2025-01-09 04:15:58,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 638 states have (on average 1.3385579937304075) internal successors, (854), 652 states have internal predecessors, (854), 102 states have call successors, (102), 64 states have call predecessors, (102), 79 states have return successors, (133), 106 states have call predecessors, (133), 100 states have call successors, (133) [2025-01-09 04:15:58,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1089 transitions. [2025-01-09 04:15:58,850 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1089 transitions. Word has length 63 [2025-01-09 04:15:58,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:58,851 INFO L471 AbstractCegarLoop]: Abstraction has 820 states and 1089 transitions. [2025-01-09 04:15:58,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 04:15:58,853 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1089 transitions. [2025-01-09 04:15:58,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:15:58,854 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:58,854 INFO L218 NwaCegarLoop]: 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] [2025-01-09 04:15:58,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:15:58,855 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:58,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:58,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1188242622, now seen corresponding path program 1 times [2025-01-09 04:15:58,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:58,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400936998] [2025-01-09 04:15:58,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:58,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:58,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:15:58,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:15:58,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:58,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:58,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:58,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:58,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400936998] [2025-01-09 04:15:58,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400936998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:58,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:58,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:15:58,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179575573] [2025-01-09 04:15:58,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:58,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:15:58,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:58,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:15:58,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:58,933 INFO L87 Difference]: Start difference. First operand 820 states and 1089 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 04:15:58,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:58,988 INFO L93 Difference]: Finished difference Result 1663 states and 2216 transitions. [2025-01-09 04:15:58,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:15:58,989 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 64 [2025-01-09 04:15:58,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:58,995 INFO L225 Difference]: With dead ends: 1663 [2025-01-09 04:15:58,995 INFO L226 Difference]: Without dead ends: 865 [2025-01-09 04:15:58,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:58,997 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:58,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 710 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:15:58,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2025-01-09 04:15:59,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2025-01-09 04:15:59,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 674 states have (on average 1.3204747774480712) internal successors, (890), 688 states have internal predecessors, (890), 102 states have call successors, (102), 64 states have call predecessors, (102), 88 states have return successors, (142), 115 states have call predecessors, (142), 100 states have call successors, (142) [2025-01-09 04:15:59,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1134 transitions. [2025-01-09 04:15:59,042 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1134 transitions. Word has length 64 [2025-01-09 04:15:59,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:59,042 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1134 transitions. [2025-01-09 04:15:59,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 04:15:59,043 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1134 transitions. [2025-01-09 04:15:59,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:15:59,043 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:59,043 INFO L218 NwaCegarLoop]: 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] [2025-01-09 04:15:59,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:15:59,044 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:59,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:59,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1183496640, now seen corresponding path program 1 times [2025-01-09 04:15:59,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:59,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863630628] [2025-01-09 04:15:59,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:59,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:59,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:15:59,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:15:59,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:59,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:59,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:59,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:59,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863630628] [2025-01-09 04:15:59,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863630628] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:59,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:59,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:15:59,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358188404] [2025-01-09 04:15:59,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:59,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:15:59,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:59,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:15:59,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:15:59,156 INFO L87 Difference]: Start difference. First operand 865 states and 1134 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 04:15:59,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:59,503 INFO L93 Difference]: Finished difference Result 1762 states and 2284 transitions. [2025-01-09 04:15:59,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 04:15:59,503 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2025-01-09 04:15:59,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:59,508 INFO L225 Difference]: With dead ends: 1762 [2025-01-09 04:15:59,508 INFO L226 Difference]: Without dead ends: 1004 [2025-01-09 04:15:59,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:15:59,510 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 252 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:59,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 423 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:15:59,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2025-01-09 04:15:59,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 874. [2025-01-09 04:15:59,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 683 states have (on average 1.3133235724743777) internal successors, (897), 695 states have internal predecessors, (897), 103 states have call successors, (103), 65 states have call predecessors, (103), 87 states have return successors, (137), 116 states have call predecessors, (137), 101 states have call successors, (137) [2025-01-09 04:15:59,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1137 transitions. [2025-01-09 04:15:59,548 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1137 transitions. Word has length 64 [2025-01-09 04:15:59,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:59,549 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1137 transitions. [2025-01-09 04:15:59,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 04:15:59,549 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1137 transitions. [2025-01-09 04:15:59,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:15:59,550 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:59,550 INFO L218 NwaCegarLoop]: 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] [2025-01-09 04:15:59,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:15:59,550 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:59,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:59,550 INFO L85 PathProgramCache]: Analyzing trace with hash -964641922, now seen corresponding path program 1 times [2025-01-09 04:15:59,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:59,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876121888] [2025-01-09 04:15:59,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:59,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:59,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:15:59,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:15:59,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:59,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:59,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:59,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:59,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876121888] [2025-01-09 04:15:59,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876121888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:59,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:59,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:15:59,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866711344] [2025-01-09 04:15:59,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:59,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:15:59,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:59,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:15:59,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:15:59,589 INFO L87 Difference]: Start difference. First operand 874 states and 1137 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 04:15:59,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:15:59,812 INFO L93 Difference]: Finished difference Result 2564 states and 3371 transitions. [2025-01-09 04:15:59,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:15:59,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2025-01-09 04:15:59,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:15:59,820 INFO L225 Difference]: With dead ends: 2564 [2025-01-09 04:15:59,820 INFO L226 Difference]: Without dead ends: 1715 [2025-01-09 04:15:59,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:15:59,822 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 207 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:15:59,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 212 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:15:59,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2025-01-09 04:15:59,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1705. [2025-01-09 04:15:59,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1705 states, 1319 states have (on average 1.290371493555724) internal successors, (1702), 1344 states have internal predecessors, (1702), 207 states have call successors, (207), 129 states have call predecessors, (207), 178 states have return successors, (314), 237 states have call predecessors, (314), 205 states have call successors, (314) [2025-01-09 04:15:59,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2223 transitions. [2025-01-09 04:15:59,904 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2223 transitions. Word has length 64 [2025-01-09 04:15:59,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:15:59,905 INFO L471 AbstractCegarLoop]: Abstraction has 1705 states and 2223 transitions. [2025-01-09 04:15:59,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 04:15:59,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2223 transitions. [2025-01-09 04:15:59,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 04:15:59,906 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:15:59,906 INFO L218 NwaCegarLoop]: 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] [2025-01-09 04:15:59,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:15:59,906 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:15:59,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:15:59,907 INFO L85 PathProgramCache]: Analyzing trace with hash 2015653685, now seen corresponding path program 1 times [2025-01-09 04:15:59,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:15:59,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911705686] [2025-01-09 04:15:59,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:15:59,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:15:59,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 04:15:59,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 04:15:59,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:15:59,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:15:59,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:15:59,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:15:59,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911705686] [2025-01-09 04:15:59,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911705686] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:15:59,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:15:59,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:15:59,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682298964] [2025-01-09 04:15:59,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:15:59,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:15:59,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:15:59,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:15:59,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:15:59,939 INFO L87 Difference]: Start difference. First operand 1705 states and 2223 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 04:16:00,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:00,048 INFO L93 Difference]: Finished difference Result 3249 states and 4311 transitions. [2025-01-09 04:16:00,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:16:00,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2025-01-09 04:16:00,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:00,052 INFO L225 Difference]: With dead ends: 3249 [2025-01-09 04:16:00,052 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 04:16:00,058 INFO L434 NwaCegarLoop]: 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 [2025-01-09 04:16:00,059 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 113 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:00,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 130 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:16:00,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 04:16:00,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 04:16:00,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:16:00,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 04:16:00,061 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2025-01-09 04:16:00,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:00,062 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 04:16:00,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 04:16:00,062 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 04:16:00,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 04:16:00,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 04:16:00,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:16:00,067 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:16:00,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 04:16:04,137 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 04:16:04,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:16:04 BoogieIcfgContainer [2025-01-09 04:16:04,162 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 04:16:04,163 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 04:16:04,163 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 04:16:04,163 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 04:16:04,164 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:15:55" (3/4) ... [2025-01-09 04:16:04,166 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 04:16:04,170 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2025-01-09 04:16:04,170 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2025-01-09 04:16:04,170 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2025-01-09 04:16:04,170 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2025-01-09 04:16:04,170 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2025-01-09 04:16:04,171 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2025-01-09 04:16:04,171 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2025-01-09 04:16:04,171 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2025-01-09 04:16:04,177 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-01-09 04:16:04,178 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 04:16:04,179 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 04:16:04,179 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 04:16:04,257 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 04:16:04,258 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 04:16:04,258 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 04:16:04,258 INFO L158 Benchmark]: Toolchain (without parser) took 9335.95ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 112.5MB in the beginning and 262.9MB in the end (delta: -150.5MB). Peak memory consumption was 111.7MB. Max. memory is 16.1GB. [2025-01-09 04:16:04,258 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 122.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:16:04,259 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.94ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 98.6MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:16:04,259 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.49ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 96.9MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:16:04,259 INFO L158 Benchmark]: Boogie Preprocessor took 38.94ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 95.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:16:04,259 INFO L158 Benchmark]: RCFGBuilder took 315.89ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 75.1MB in the end (delta: 20.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 04:16:04,259 INFO L158 Benchmark]: TraceAbstraction took 8604.36ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 74.6MB in the beginning and 271.3MB in the end (delta: -196.7MB). Peak memory consumption was 208.7MB. Max. memory is 16.1GB. [2025-01-09 04:16:04,260 INFO L158 Benchmark]: Witness Printer took 94.76ms. Allocated memory is still 411.0MB. Free memory was 271.3MB in the beginning and 262.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:16:04,260 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 122.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.94ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 98.6MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.49ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 96.9MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.94ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 95.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 315.89ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 75.1MB in the end (delta: 20.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8604.36ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 74.6MB in the beginning and 271.3MB in the end (delta: -196.7MB). Peak memory consumption was 208.7MB. Max. memory is 16.1GB. * Witness Printer took 94.76ms. Allocated memory is still 411.0MB. Free memory was 271.3MB in the beginning and 262.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 115 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2239 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2200 mSDsluCounter, 4982 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3431 mSDsCounter, 363 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1760 IncrementalHoareTripleChecker+Invalid, 2123 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 363 mSolverCounterUnsat, 1551 mSDtfsCounter, 1760 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1705occurred in iteration=8, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 575 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 569 NumberOfCodeBlocks, 569 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 560 ConstructedInterpolants, 0 QuantifiedInterpolants, 910 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 164]: Location Invariant Derived location invariant: ((c_dr_pc == 1) || (c_dr_pc == 0)) - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: ((c_dr_pc == 1) || (c_dr_pc == 0)) - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: ((c_dr_pc == 1) || (c_dr_pc == 0)) RESULT: Ultimate proved your program to be correct! [2025-01-09 04:16:04,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE