./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a178b12ba1b75e8e390c539a1b1599b5e56cbe73098e0c8e7ca0eeb62a619e80 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:15:47,601 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:15:47,653 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:15:47,659 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:15:47,659 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:15:47,686 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:15:47,688 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:15:47,688 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:15:47,689 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:15:47,689 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:15:47,689 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:15:47,689 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:15:47,689 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:15:47,689 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:15:47,689 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:15:47,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:15:47,690 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:15:47,690 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:15:47,690 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:15:47,690 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:15:47,690 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:15:47,690 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:15:47,690 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:15:47,690 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:15:47,690 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:15:47,690 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:15:47,690 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:15:47,690 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:15:47,690 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:15:47,690 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:15:47,690 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:15:47,690 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:15:47,690 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:15:47,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:15:47,690 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:15:47,690 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:15:47,690 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:15:47,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:15:47,691 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:15:47,691 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:15:47,691 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:15:47,691 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:15:47,691 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/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> a178b12ba1b75e8e390c539a1b1599b5e56cbe73098e0c8e7ca0eeb62a619e80 [2025-03-09 01:15:47,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:15:47,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:15:47,961 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:15:47,961 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:15:47,962 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:15:47,963 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i [2025-03-09 01:15:49,201 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5d322833/5efc732792344edabbf3d560ab9d6df7/FLAG0b8aead49 [2025-03-09 01:15:49,515 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:15:49,517 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i [2025-03-09 01:15:49,535 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5d322833/5efc732792344edabbf3d560ab9d6df7/FLAG0b8aead49 [2025-03-09 01:15:49,550 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5d322833/5efc732792344edabbf3d560ab9d6df7 [2025-03-09 01:15:49,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:15:49,553 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:15:49,555 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:15:49,556 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:15:49,560 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:15:49,561 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:15:49" (1/1) ... [2025-03-09 01:15:49,563 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c0497ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:15:49, skipping insertion in model container [2025-03-09 01:15:49,563 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:15:49" (1/1) ... [2025-03-09 01:15:49,587 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:15:49,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:15:49,829 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:15:49,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:15:49,907 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:15:49,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:15:49 WrapperNode [2025-03-09 01:15:49,908 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:15:49,909 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:15:49,909 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:15:49,909 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:15:49,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:15:49" (1/1) ... [2025-03-09 01:15:49,928 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:15:49" (1/1) ... [2025-03-09 01:15:49,950 INFO L138 Inliner]: procedures = 174, calls = 45, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 136 [2025-03-09 01:15:49,951 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:15:49,952 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:15:49,952 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:15:49,952 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:15:49,959 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:15:49" (1/1) ... [2025-03-09 01:15:49,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:15:49" (1/1) ... [2025-03-09 01:15:49,962 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:15:49" (1/1) ... [2025-03-09 01:15:49,984 INFO L175 MemorySlicer]: Split 19 memory accesses to 5 slices as follows [2, 5, 5, 5, 2]. 26 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 0, 1]. [2025-03-09 01:15:49,986 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:15:49" (1/1) ... [2025-03-09 01:15:49,986 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:15:49" (1/1) ... [2025-03-09 01:15:49,995 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:15:49" (1/1) ... [2025-03-09 01:15:49,997 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:15:49" (1/1) ... [2025-03-09 01:15:49,999 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:15:49" (1/1) ... [2025-03-09 01:15:49,999 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:15:49" (1/1) ... [2025-03-09 01:15:50,001 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:15:50,005 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:15:50,005 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:15:50,005 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:15:50,006 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:15:49" (1/1) ... [2025-03-09 01:15:50,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:15:50,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:15:50,044 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:15:50,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:15:50,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:15:50,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:15:50,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 01:15:50,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 01:15:50,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-09 01:15:50,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:15:50,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:15:50,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 01:15:50,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 01:15:50,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-09 01:15:50,066 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 01:15:50,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:15:50,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 01:15:50,066 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-09 01:15:50,066 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-09 01:15:50,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 01:15:50,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:15:50,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:15:50,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 01:15:50,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 01:15:50,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-09 01:15:50,067 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 01:15:50,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:15:50,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:15:50,068 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:15:50,157 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:15:50,159 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:15:50,343 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L720: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-09 01:15:50,344 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-09 01:15:50,376 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:15:50,377 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:15:50,503 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:15:50,505 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:15:50,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:15:50 BoogieIcfgContainer [2025-03-09 01:15:50,505 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:15:50,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:15:50,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:15:50,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:15:50,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:15:49" (1/3) ... [2025-03-09 01:15:50,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50200ab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:15:50, skipping insertion in model container [2025-03-09 01:15:50,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:15:49" (2/3) ... [2025-03-09 01:15:50,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50200ab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:15:50, skipping insertion in model container [2025-03-09 01:15:50,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:15:50" (3/3) ... [2025-03-09 01:15:50,514 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_19-callback_racing.i [2025-03-09 01:15:50,525 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:15:50,527 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_19-callback_racing.i that has 2 procedures, 51 locations, 1 initial locations, 6 loop locations, and 6 error locations. [2025-03-09 01:15:50,527 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:15:50,560 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-09 01:15:50,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 64 transitions, 135 flow [2025-03-09 01:15:50,641 INFO L124 PetriNetUnfolderBase]: 21/102 cut-off events. [2025-03-09 01:15:50,644 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 01:15:50,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 102 events. 21/102 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 381 event pairs, 0 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 59. Up to 6 conditions per place. [2025-03-09 01:15:50,646 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 64 transitions, 135 flow [2025-03-09 01:15:50,651 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 64 transitions, 135 flow [2025-03-09 01:15:50,659 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:15:50,672 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=None, 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;@16b0b0c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:15:50,673 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-09 01:15:50,676 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:15:50,676 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-03-09 01:15:50,677 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:15:50,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:15:50,677 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:15:50,678 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-09 01:15:50,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:15:50,682 INFO L85 PathProgramCache]: Analyzing trace with hash 359249, now seen corresponding path program 1 times [2025-03-09 01:15:50,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:15:50,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795119355] [2025-03-09 01:15:50,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:15:50,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:15:50,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:15:50,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:15:50,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:15:50,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:15:50,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:15:50,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:15:50,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795119355] [2025-03-09 01:15:50,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795119355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:15:50,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:15:50,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:15:50,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709239979] [2025-03-09 01:15:50,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:15:50,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:15:50,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:15:50,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:15:50,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:15:50,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2025-03-09 01:15:50,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 64 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-03-09 01:15:50,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:15:50,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2025-03-09 01:15:50,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:15:51,134 INFO L124 PetriNetUnfolderBase]: 173/516 cut-off events. [2025-03-09 01:15:51,135 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 01:15:51,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 895 conditions, 516 events. 173/516 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2813 event pairs, 136 based on Foata normal form. 88/566 useless extension candidates. Maximal degree in co-relation 828. Up to 337 conditions per place. [2025-03-09 01:15:51,142 INFO L140 encePairwiseOnDemand]: 50/64 looper letters, 39 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2025-03-09 01:15:51,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 59 transitions, 207 flow [2025-03-09 01:15:51,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:15:51,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:15:51,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2025-03-09 01:15:51,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.578125 [2025-03-09 01:15:51,154 INFO L175 Difference]: Start difference. First operand has 54 places, 64 transitions, 135 flow. Second operand 3 states and 111 transitions. [2025-03-09 01:15:51,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 59 transitions, 207 flow [2025-03-09 01:15:51,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 207 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:15:51,161 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 113 flow [2025-03-09 01:15:51,163 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2025-03-09 01:15:51,167 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -1 predicate places. [2025-03-09 01:15:51,168 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 113 flow [2025-03-09 01:15:51,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-03-09 01:15:51,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:15:51,168 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:15:51,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:15:51,169 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-09 01:15:51,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:15:51,170 INFO L85 PathProgramCache]: Analyzing trace with hash 359250, now seen corresponding path program 1 times [2025-03-09 01:15:51,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:15:51,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438596411] [2025-03-09 01:15:51,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:15:51,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:15:51,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:15:51,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:15:51,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:15:51,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:15:51,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:15:51,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:15:51,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438596411] [2025-03-09 01:15:51,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438596411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:15:51,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:15:51,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:15:51,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309594453] [2025-03-09 01:15:51,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:15:51,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:15:51,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:15:51,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:15:51,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:15:51,342 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 64 [2025-03-09 01:15:51,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-03-09 01:15:51,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:15:51,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 64 [2025-03-09 01:15:51,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:15:51,490 INFO L124 PetriNetUnfolderBase]: 162/476 cut-off events. [2025-03-09 01:15:51,490 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-09 01:15:51,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 833 conditions, 476 events. 162/476 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2446 event pairs, 136 based on Foata normal form. 1/440 useless extension candidates. Maximal degree in co-relation 804. Up to 329 conditions per place. [2025-03-09 01:15:51,495 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 39 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2025-03-09 01:15:51,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 60 transitions, 213 flow [2025-03-09 01:15:51,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:15:51,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:15:51,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2025-03-09 01:15:51,497 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5520833333333334 [2025-03-09 01:15:51,498 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 113 flow. Second operand 3 states and 106 transitions. [2025-03-09 01:15:51,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 60 transitions, 213 flow [2025-03-09 01:15:51,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 60 transitions, 209 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:15:51,500 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 119 flow [2025-03-09 01:15:51,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2025-03-09 01:15:51,501 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places. [2025-03-09 01:15:51,502 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 119 flow [2025-03-09 01:15:51,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-03-09 01:15:51,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:15:51,502 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-09 01:15:51,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:15:51,503 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-09 01:15:51,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:15:51,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1071975219, now seen corresponding path program 1 times [2025-03-09 01:15:51,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:15:51,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666160584] [2025-03-09 01:15:51,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:15:51,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:15:51,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:15:51,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:15:51,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:15:51,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:15:51,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:15:51,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:15:51,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666160584] [2025-03-09 01:15:51,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666160584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:15:51,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:15:51,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:15:51,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844246168] [2025-03-09 01:15:51,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:15:51,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:15:51,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:15:51,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:15:51,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:15:51,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2025-03-09 01:15:51,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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-03-09 01:15:51,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:15:51,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2025-03-09 01:15:51,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:15:51,732 INFO L124 PetriNetUnfolderBase]: 24/79 cut-off events. [2025-03-09 01:15:51,732 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-09 01:15:51,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 79 events. 24/79 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 238 event pairs, 0 based on Foata normal form. 18/96 useless extension candidates. Maximal degree in co-relation 143. Up to 51 conditions per place. [2025-03-09 01:15:51,734 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 21 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2025-03-09 01:15:51,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 31 transitions, 118 flow [2025-03-09 01:15:51,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:15:51,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:15:51,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2025-03-09 01:15:51,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41015625 [2025-03-09 01:15:51,738 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 119 flow. Second operand 4 states and 105 transitions. [2025-03-09 01:15:51,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 31 transitions, 118 flow [2025-03-09 01:15:51,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 31 transitions, 112 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:15:51,740 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 50 flow [2025-03-09 01:15:51,740 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=50, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2025-03-09 01:15:51,741 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -27 predicate places. [2025-03-09 01:15:51,741 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 50 flow [2025-03-09 01:15:51,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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-03-09 01:15:51,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:15:51,742 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-09 01:15:51,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:15:51,742 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-09 01:15:51,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:15:51,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1128506270, now seen corresponding path program 1 times [2025-03-09 01:15:51,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:15:51,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151282858] [2025-03-09 01:15:51,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:15:51,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:15:51,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:15:51,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:15:51,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:15:51,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:15:51,758 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:15:51,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:15:51,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:15:51,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:15:51,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:15:51,790 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 01:15:51,790 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:15:51,791 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-03-09 01:15:51,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 8 remaining) [2025-03-09 01:15:51,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 8 remaining) [2025-03-09 01:15:51,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 8 remaining) [2025-03-09 01:15:51,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 8 remaining) [2025-03-09 01:15:51,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 8 remaining) [2025-03-09 01:15:51,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 8 remaining) [2025-03-09 01:15:51,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-03-09 01:15:51,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:15:51,793 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-09 01:15:51,796 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 01:15:51,796 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-09 01:15:51,812 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 01:15:51,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 86 transitions, 188 flow [2025-03-09 01:15:51,824 INFO L124 PetriNetUnfolderBase]: 35/174 cut-off events. [2025-03-09 01:15:51,824 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-03-09 01:15:51,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 174 events. 35/174 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 740 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 106. Up to 9 conditions per place. [2025-03-09 01:15:51,828 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 86 transitions, 188 flow [2025-03-09 01:15:51,829 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 86 transitions, 188 flow [2025-03-09 01:15:51,830 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:15:51,831 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=None, 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;@16b0b0c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:15:51,831 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-09 01:15:51,832 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:15:51,832 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-03-09 01:15:51,832 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:15:51,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:15:51,833 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:15:51,833 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-09 01:15:51,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:15:51,833 INFO L85 PathProgramCache]: Analyzing trace with hash 444647, now seen corresponding path program 1 times [2025-03-09 01:15:51,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:15:51,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970719508] [2025-03-09 01:15:51,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:15:51,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:15:51,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:15:51,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:15:51,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:15:51,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:15:51,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:15:51,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:15:51,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970719508] [2025-03-09 01:15:51,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970719508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:15:51,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:15:51,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:15:51,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099934254] [2025-03-09 01:15:51,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:15:51,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:15:51,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:15:51,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:15:51,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:15:51,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 86 [2025-03-09 01:15:51,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 86 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-03-09 01:15:51,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:15:51,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 86 [2025-03-09 01:15:51,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:15:52,411 INFO L124 PetriNetUnfolderBase]: 3201/6431 cut-off events. [2025-03-09 01:15:52,411 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-03-09 01:15:52,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11559 conditions, 6431 events. 3201/6431 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 50245 event pairs, 2688 based on Foata normal form. 1371/7411 useless extension candidates. Maximal degree in co-relation 8172. Up to 4555 conditions per place. [2025-03-09 01:15:52,446 INFO L140 encePairwiseOnDemand]: 68/86 looper letters, 57 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2025-03-09 01:15:52,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 84 transitions, 302 flow [2025-03-09 01:15:52,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:15:52,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:15:52,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2025-03-09 01:15:52,448 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6124031007751938 [2025-03-09 01:15:52,448 INFO L175 Difference]: Start difference. First operand has 73 places, 86 transitions, 188 flow. Second operand 3 states and 158 transitions. [2025-03-09 01:15:52,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 84 transitions, 302 flow [2025-03-09 01:15:52,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 84 transitions, 302 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:15:52,451 INFO L231 Difference]: Finished difference. Result has 71 places, 68 transitions, 156 flow [2025-03-09 01:15:52,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=71, PETRI_TRANSITIONS=68} [2025-03-09 01:15:52,451 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -2 predicate places. [2025-03-09 01:15:52,451 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 156 flow [2025-03-09 01:15:52,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-03-09 01:15:52,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:15:52,452 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:15:52,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:15:52,452 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-09 01:15:52,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:15:52,452 INFO L85 PathProgramCache]: Analyzing trace with hash 444648, now seen corresponding path program 1 times [2025-03-09 01:15:52,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:15:52,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161141584] [2025-03-09 01:15:52,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:15:52,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:15:52,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:15:52,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:15:52,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:15:52,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:15:52,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:15:52,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:15:52,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161141584] [2025-03-09 01:15:52,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161141584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:15:52,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:15:52,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:15:52,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697642836] [2025-03-09 01:15:52,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:15:52,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:15:52,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:15:52,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:15:52,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:15:52,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 86 [2025-03-09 01:15:52,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-03-09 01:15:52,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:15:52,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 86 [2025-03-09 01:15:52,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:15:53,012 INFO L124 PetriNetUnfolderBase]: 3038/6182 cut-off events. [2025-03-09 01:15:53,013 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-03-09 01:15:53,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11136 conditions, 6182 events. 3038/6182 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 47782 event pairs, 2651 based on Foata normal form. 1/5776 useless extension candidates. Maximal degree in co-relation 9842. Up to 4789 conditions per place. [2025-03-09 01:15:53,045 INFO L140 encePairwiseOnDemand]: 82/86 looper letters, 50 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2025-03-09 01:15:53,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 78 transitions, 280 flow [2025-03-09 01:15:53,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:15:53,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:15:53,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2025-03-09 01:15:53,047 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5348837209302325 [2025-03-09 01:15:53,047 INFO L175 Difference]: Start difference. First operand has 71 places, 68 transitions, 156 flow. Second operand 3 states and 138 transitions. [2025-03-09 01:15:53,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 78 transitions, 280 flow [2025-03-09 01:15:53,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 78 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:15:53,051 INFO L231 Difference]: Finished difference. Result has 72 places, 69 transitions, 166 flow [2025-03-09 01:15:53,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=72, PETRI_TRANSITIONS=69} [2025-03-09 01:15:53,051 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -1 predicate places. [2025-03-09 01:15:53,051 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 69 transitions, 166 flow [2025-03-09 01:15:53,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-03-09 01:15:53,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:15:53,051 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-09 01:15:53,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:15:53,052 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-09 01:15:53,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:15:53,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1662313803, now seen corresponding path program 1 times [2025-03-09 01:15:53,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:15:53,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164266068] [2025-03-09 01:15:53,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:15:53,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:15:53,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:15:53,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:15:53,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:15:53,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:15:53,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:15:53,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:15:53,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164266068] [2025-03-09 01:15:53,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164266068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:15:53,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:15:53,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:15:53,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39100085] [2025-03-09 01:15:53,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:15:53,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:15:53,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:15:53,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:15:53,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:15:53,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 86 [2025-03-09 01:15:53,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 69 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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-03-09 01:15:53,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:15:53,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 86 [2025-03-09 01:15:53,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:15:53,587 INFO L124 PetriNetUnfolderBase]: 3030/5917 cut-off events. [2025-03-09 01:15:53,587 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2025-03-09 01:15:53,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11025 conditions, 5917 events. 3030/5917 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 43688 event pairs, 1608 based on Foata normal form. 9/5668 useless extension candidates. Maximal degree in co-relation 3266. Up to 4585 conditions per place. [2025-03-09 01:15:53,618 INFO L140 encePairwiseOnDemand]: 82/86 looper letters, 66 selfloop transitions, 4 changer transitions 0/96 dead transitions. [2025-03-09 01:15:53,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 96 transitions, 362 flow [2025-03-09 01:15:53,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:15:53,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:15:53,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2025-03-09 01:15:53,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5319767441860465 [2025-03-09 01:15:53,619 INFO L175 Difference]: Start difference. First operand has 72 places, 69 transitions, 166 flow. Second operand 4 states and 183 transitions. [2025-03-09 01:15:53,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 96 transitions, 362 flow [2025-03-09 01:15:53,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 96 transitions, 360 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:15:53,622 INFO L231 Difference]: Finished difference. Result has 75 places, 70 transitions, 183 flow [2025-03-09 01:15:53,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=75, PETRI_TRANSITIONS=70} [2025-03-09 01:15:53,623 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 2 predicate places. [2025-03-09 01:15:53,623 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 70 transitions, 183 flow [2025-03-09 01:15:53,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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-03-09 01:15:53,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:15:53,623 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:15:53,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:15:53,624 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-09 01:15:53,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:15:53,624 INFO L85 PathProgramCache]: Analyzing trace with hash 244332224, now seen corresponding path program 1 times [2025-03-09 01:15:53,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:15:53,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979298280] [2025-03-09 01:15:53,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:15:53,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:15:53,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:15:53,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:15:53,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:15:53,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:15:53,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:15:53,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:15:53,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979298280] [2025-03-09 01:15:53,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979298280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:15:53,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:15:53,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:15:53,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671337850] [2025-03-09 01:15:53,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:15:53,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:15:53,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:15:53,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:15:53,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:15:53,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 86 [2025-03-09 01:15:53,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 70 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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-03-09 01:15:53,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:15:53,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 86 [2025-03-09 01:15:53,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:15:53,999 INFO L124 PetriNetUnfolderBase]: 2763/5549 cut-off events. [2025-03-09 01:15:53,999 INFO L125 PetriNetUnfolderBase]: For 571/571 co-relation queries the response was YES. [2025-03-09 01:15:54,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10392 conditions, 5549 events. 2763/5549 cut-off events. For 571/571 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 41684 event pairs, 1037 based on Foata normal form. 9/5328 useless extension candidates. Maximal degree in co-relation 1480. Up to 4129 conditions per place. [2025-03-09 01:15:54,022 INFO L140 encePairwiseOnDemand]: 83/86 looper letters, 65 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2025-03-09 01:15:54,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 95 transitions, 364 flow [2025-03-09 01:15:54,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:15:54,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:15:54,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 185 transitions. [2025-03-09 01:15:54,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5377906976744186 [2025-03-09 01:15:54,023 INFO L175 Difference]: Start difference. First operand has 75 places, 70 transitions, 183 flow. Second operand 4 states and 185 transitions. [2025-03-09 01:15:54,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 95 transitions, 364 flow [2025-03-09 01:15:54,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 95 transitions, 358 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-09 01:15:54,027 INFO L231 Difference]: Finished difference. Result has 76 places, 69 transitions, 176 flow [2025-03-09 01:15:54,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=76, PETRI_TRANSITIONS=69} [2025-03-09 01:15:54,028 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 3 predicate places. [2025-03-09 01:15:54,028 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 69 transitions, 176 flow [2025-03-09 01:15:54,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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-03-09 01:15:54,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:15:54,029 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-03-09 01:15:54,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:15:54,029 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-09 01:15:54,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:15:54,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1467469215, now seen corresponding path program 1 times [2025-03-09 01:15:54,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:15:54,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857344237] [2025-03-09 01:15:54,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:15:54,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:15:54,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:15:54,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:15:54,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:15:54,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:15:54,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:15:54,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:15:54,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857344237] [2025-03-09 01:15:54,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857344237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:15:54,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:15:54,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:15:54,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382850149] [2025-03-09 01:15:54,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:15:54,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:15:54,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:15:54,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:15:54,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:15:54,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 86 [2025-03-09 01:15:54,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 69 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 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-03-09 01:15:54,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:15:54,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 86 [2025-03-09 01:15:54,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:15:54,604 INFO L124 PetriNetUnfolderBase]: 2763/5419 cut-off events. [2025-03-09 01:15:54,604 INFO L125 PetriNetUnfolderBase]: For 792/792 co-relation queries the response was YES. [2025-03-09 01:15:54,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10154 conditions, 5419 events. 2763/5419 cut-off events. For 792/792 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 40867 event pairs, 134 based on Foata normal form. 81/5214 useless extension candidates. Maximal degree in co-relation 8648. Up to 3679 conditions per place. [2025-03-09 01:15:54,632 INFO L140 encePairwiseOnDemand]: 82/86 looper letters, 80 selfloop transitions, 4 changer transitions 0/110 dead transitions. [2025-03-09 01:15:54,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 110 transitions, 422 flow [2025-03-09 01:15:54,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:15:54,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:15:54,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 225 transitions. [2025-03-09 01:15:54,634 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5232558139534884 [2025-03-09 01:15:54,635 INFO L175 Difference]: Start difference. First operand has 76 places, 69 transitions, 176 flow. Second operand 5 states and 225 transitions. [2025-03-09 01:15:54,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 110 transitions, 422 flow [2025-03-09 01:15:54,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 110 transitions, 416 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:15:54,639 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 172 flow [2025-03-09 01:15:54,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=76, PETRI_TRANSITIONS=68} [2025-03-09 01:15:54,640 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 3 predicate places. [2025-03-09 01:15:54,640 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 172 flow [2025-03-09 01:15:54,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 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-03-09 01:15:54,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:15:54,640 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2025-03-09 01:15:54,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:15:54,640 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-09 01:15:54,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:15:54,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1753095006, now seen corresponding path program 1 times [2025-03-09 01:15:54,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:15:54,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210140663] [2025-03-09 01:15:54,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:15:54,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:15:54,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:15:54,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:15:54,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:15:54,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:15:54,661 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:15:54,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:15:54,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:15:54,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:15:54,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:15:54,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 01:15:54,677 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:15:54,677 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-03-09 01:15:54,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 9 remaining) [2025-03-09 01:15:54,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2025-03-09 01:15:54,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2025-03-09 01:15:54,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2025-03-09 01:15:54,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 9 remaining) [2025-03-09 01:15:54,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 9 remaining) [2025-03-09 01:15:54,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 9 remaining) [2025-03-09 01:15:54,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2025-03-09 01:15:54,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:15:54,678 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-09 01:15:54,679 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 01:15:54,679 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-09 01:15:54,696 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-09 01:15:54,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 108 transitions, 243 flow [2025-03-09 01:15:54,714 INFO L124 PetriNetUnfolderBase]: 52/267 cut-off events. [2025-03-09 01:15:54,715 INFO L125 PetriNetUnfolderBase]: For 19/21 co-relation queries the response was YES. [2025-03-09 01:15:54,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 267 events. 52/267 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1223 event pairs, 1 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 185. Up to 12 conditions per place. [2025-03-09 01:15:54,716 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 108 transitions, 243 flow [2025-03-09 01:15:54,717 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 108 transitions, 243 flow [2025-03-09 01:15:54,718 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:15:54,718 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=None, 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;@16b0b0c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:15:54,718 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-09 01:15:54,720 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:15:54,720 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-03-09 01:15:54,720 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:15:54,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:15:54,721 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:15:54,721 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-03-09 01:15:54,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:15:54,721 INFO L85 PathProgramCache]: Analyzing trace with hash 551891, now seen corresponding path program 1 times [2025-03-09 01:15:54,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:15:54,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931775357] [2025-03-09 01:15:54,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:15:54,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:15:54,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:15:54,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:15:54,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:15:54,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:15:54,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:15:54,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:15:54,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931775357] [2025-03-09 01:15:54,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931775357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:15:54,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:15:54,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:15:54,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160574721] [2025-03-09 01:15:54,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:15:54,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:15:54,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:15:54,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:15:54,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:15:54,766 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 108 [2025-03-09 01:15:54,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 108 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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-03-09 01:15:54,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:15:54,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 108 [2025-03-09 01:15:54,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:15:58,448 INFO L124 PetriNetUnfolderBase]: 44624/74173 cut-off events. [2025-03-09 01:15:58,448 INFO L125 PetriNetUnfolderBase]: For 1078/1078 co-relation queries the response was YES. [2025-03-09 01:15:58,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136845 conditions, 74173 events. 44624/74173 cut-off events. For 1078/1078 co-relation queries the response was YES. Maximal size of possible extension queue 2225. Compared 673270 event pairs, 38073 based on Foata normal form. 18228/88715 useless extension candidates. Maximal degree in co-relation 42416. Up to 55214 conditions per place. [2025-03-09 01:15:58,888 INFO L140 encePairwiseOnDemand]: 86/108 looper letters, 75 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2025-03-09 01:15:58,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 109 transitions, 399 flow [2025-03-09 01:15:58,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:15:58,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:15:58,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 205 transitions. [2025-03-09 01:15:58,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6327160493827161 [2025-03-09 01:15:58,890 INFO L175 Difference]: Start difference. First operand has 92 places, 108 transitions, 243 flow. Second operand 3 states and 205 transitions. [2025-03-09 01:15:58,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 109 transitions, 399 flow [2025-03-09 01:15:58,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 109 transitions, 399 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:15:58,893 INFO L231 Difference]: Finished difference. Result has 89 places, 85 transitions, 201 flow [2025-03-09 01:15:58,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=201, PETRI_PLACES=89, PETRI_TRANSITIONS=85} [2025-03-09 01:15:58,893 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, -3 predicate places. [2025-03-09 01:15:58,893 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 85 transitions, 201 flow [2025-03-09 01:15:58,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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-03-09 01:15:58,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:15:58,894 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:15:58,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:15:58,894 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-03-09 01:15:58,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:15:58,894 INFO L85 PathProgramCache]: Analyzing trace with hash 551892, now seen corresponding path program 1 times [2025-03-09 01:15:58,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:15:58,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422584307] [2025-03-09 01:15:58,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:15:58,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:15:58,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:15:58,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:15:58,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:15:58,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:15:58,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:15:58,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:15:58,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422584307] [2025-03-09 01:15:58,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422584307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:15:58,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:15:58,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:15:58,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903935348] [2025-03-09 01:15:58,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:15:58,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:15:58,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:15:58,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:15:58,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:15:58,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 108 [2025-03-09 01:15:58,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 85 transitions, 201 flow. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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-03-09 01:15:58,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:15:58,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 108 [2025-03-09 01:15:58,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:16:02,217 INFO L124 PetriNetUnfolderBase]: 42221/70629 cut-off events. [2025-03-09 01:16:02,217 INFO L125 PetriNetUnfolderBase]: For 1989/2019 co-relation queries the response was YES. [2025-03-09 01:16:02,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130887 conditions, 70629 events. 42221/70629 cut-off events. For 1989/2019 co-relation queries the response was YES. Maximal size of possible extension queue 2093. Compared 638193 event pairs, 29827 based on Foata normal form. 1/66779 useless extension candidates. Maximal degree in co-relation 114979. Up to 58588 conditions per place. [2025-03-09 01:16:02,545 INFO L140 encePairwiseOnDemand]: 104/108 looper letters, 60 selfloop transitions, 2 changer transitions 0/95 dead transitions. [2025-03-09 01:16:02,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 95 transitions, 345 flow [2025-03-09 01:16:02,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:16:02,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:16:02,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2025-03-09 01:16:02,546 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5216049382716049 [2025-03-09 01:16:02,546 INFO L175 Difference]: Start difference. First operand has 89 places, 85 transitions, 201 flow. Second operand 3 states and 169 transitions. [2025-03-09 01:16:02,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 95 transitions, 345 flow [2025-03-09 01:16:02,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 95 transitions, 341 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:16:02,584 INFO L231 Difference]: Finished difference. Result has 90 places, 86 transitions, 211 flow [2025-03-09 01:16:02,585 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=211, PETRI_PLACES=90, PETRI_TRANSITIONS=86} [2025-03-09 01:16:02,585 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, -2 predicate places. [2025-03-09 01:16:02,585 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 86 transitions, 211 flow [2025-03-09 01:16:02,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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-03-09 01:16:02,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:16:02,585 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-09 01:16:02,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:16:02,585 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-03-09 01:16:02,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:16:02,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1400554995, now seen corresponding path program 1 times [2025-03-09 01:16:02,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:16:02,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400109481] [2025-03-09 01:16:02,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:16:02,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:16:02,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:16:02,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:16:02,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:16:02,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:16:02,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:16:02,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:16:02,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400109481] [2025-03-09 01:16:02,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400109481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:16:02,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:16:02,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:16:02,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917633675] [2025-03-09 01:16:02,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:16:02,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:16:02,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:16:02,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:16:02,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:16:02,674 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 108 [2025-03-09 01:16:02,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 86 transitions, 211 flow. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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-03-09 01:16:02,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:16:02,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 108 [2025-03-09 01:16:02,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:16:06,157 INFO L124 PetriNetUnfolderBase]: 42213/71395 cut-off events. [2025-03-09 01:16:06,157 INFO L125 PetriNetUnfolderBase]: For 3556/3566 co-relation queries the response was YES. [2025-03-09 01:16:06,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133094 conditions, 71395 events. 42213/71395 cut-off events. For 3556/3566 co-relation queries the response was YES. Maximal size of possible extension queue 2144. Compared 654993 event pairs, 24468 based on Foata normal form. 9/68466 useless extension candidates. Maximal degree in co-relation 18425. Up to 58384 conditions per place. [2025-03-09 01:16:06,465 INFO L140 encePairwiseOnDemand]: 104/108 looper letters, 77 selfloop transitions, 4 changer transitions 0/114 dead transitions. [2025-03-09 01:16:06,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 114 transitions, 433 flow [2025-03-09 01:16:06,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:16:06,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:16:06,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2025-03-09 01:16:06,466 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2025-03-09 01:16:06,466 INFO L175 Difference]: Start difference. First operand has 90 places, 86 transitions, 211 flow. Second operand 4 states and 222 transitions. [2025-03-09 01:16:06,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 114 transitions, 433 flow [2025-03-09 01:16:06,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 114 transitions, 431 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:16:06,469 INFO L231 Difference]: Finished difference. Result has 93 places, 88 transitions, 234 flow [2025-03-09 01:16:06,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=93, PETRI_TRANSITIONS=88} [2025-03-09 01:16:06,469 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 1 predicate places. [2025-03-09 01:16:06,470 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 88 transitions, 234 flow [2025-03-09 01:16:06,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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-03-09 01:16:06,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:16:06,470 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:16:06,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:16:06,470 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-03-09 01:16:06,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:16:06,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1608520296, now seen corresponding path program 1 times [2025-03-09 01:16:06,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:16:06,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56291489] [2025-03-09 01:16:06,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:16:06,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:16:06,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:16:06,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:16:06,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:16:06,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:16:06,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:16:06,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:16:06,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56291489] [2025-03-09 01:16:06,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56291489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:16:06,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:16:06,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:16:06,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635194770] [2025-03-09 01:16:06,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:16:06,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:16:06,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:16:06,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:16:06,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:16:06,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 108 [2025-03-09 01:16:06,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 88 transitions, 234 flow. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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-03-09 01:16:06,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:16:06,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 108 [2025-03-09 01:16:06,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:16:10,023 INFO L124 PetriNetUnfolderBase]: 40002/68128 cut-off events. [2025-03-09 01:16:10,023 INFO L125 PetriNetUnfolderBase]: For 6099/6099 co-relation queries the response was YES. [2025-03-09 01:16:10,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128230 conditions, 68128 events. 40002/68128 cut-off events. For 6099/6099 co-relation queries the response was YES. Maximal size of possible extension queue 2055. Compared 629992 event pairs, 11704 based on Foata normal form. 9/65430 useless extension candidates. Maximal degree in co-relation 10974. Up to 55255 conditions per place. [2025-03-09 01:16:10,332 INFO L140 encePairwiseOnDemand]: 105/108 looper letters, 76 selfloop transitions, 3 changer transitions 0/113 dead transitions. [2025-03-09 01:16:10,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 113 transitions, 437 flow [2025-03-09 01:16:10,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:16:10,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:16:10,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 224 transitions. [2025-03-09 01:16:10,333 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2025-03-09 01:16:10,333 INFO L175 Difference]: Start difference. First operand has 93 places, 88 transitions, 234 flow. Second operand 4 states and 224 transitions. [2025-03-09 01:16:10,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 113 transitions, 437 flow [2025-03-09 01:16:10,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 113 transitions, 431 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-09 01:16:10,336 INFO L231 Difference]: Finished difference. Result has 94 places, 87 transitions, 227 flow [2025-03-09 01:16:10,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=227, PETRI_PLACES=94, PETRI_TRANSITIONS=87} [2025-03-09 01:16:10,336 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 2 predicate places. [2025-03-09 01:16:10,336 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 87 transitions, 227 flow [2025-03-09 01:16:10,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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-03-09 01:16:10,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:16:10,337 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-03-09 01:16:10,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:16:10,337 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-03-09 01:16:10,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:16:10,337 INFO L85 PathProgramCache]: Analyzing trace with hash 353286181, now seen corresponding path program 1 times [2025-03-09 01:16:10,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:16:10,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550770789] [2025-03-09 01:16:10,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:16:10,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:16:10,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:16:10,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:16:10,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:16:10,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:16:10,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:16:10,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:16:10,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550770789] [2025-03-09 01:16:10,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550770789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:16:10,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:16:10,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:16:10,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015501341] [2025-03-09 01:16:10,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:16:10,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:16:10,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:16:10,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:16:10,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:16:10,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 108 [2025-03-09 01:16:10,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 87 transitions, 227 flow. Second operand has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 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-03-09 01:16:10,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:16:10,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 108 [2025-03-09 01:16:10,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:16:13,956 INFO L124 PetriNetUnfolderBase]: 41946/69842 cut-off events. [2025-03-09 01:16:13,956 INFO L125 PetriNetUnfolderBase]: For 8107/8107 co-relation queries the response was YES. [2025-03-09 01:16:14,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133355 conditions, 69842 events. 41946/69842 cut-off events. For 8107/8107 co-relation queries the response was YES. Maximal size of possible extension queue 2074. Compared 622906 event pairs, 17271 based on Foata normal form. 81/67145 useless extension candidates. Maximal degree in co-relation 16255. Up to 55453 conditions per place. [2025-03-09 01:16:14,281 INFO L140 encePairwiseOnDemand]: 104/108 looper letters, 101 selfloop transitions, 5 changer transitions 0/139 dead transitions. [2025-03-09 01:16:14,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 139 transitions, 547 flow [2025-03-09 01:16:14,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:16:14,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:16:14,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 282 transitions. [2025-03-09 01:16:14,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2025-03-09 01:16:14,283 INFO L175 Difference]: Start difference. First operand has 94 places, 87 transitions, 227 flow. Second operand 5 states and 282 transitions. [2025-03-09 01:16:14,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 139 transitions, 547 flow [2025-03-09 01:16:14,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 139 transitions, 541 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:16:14,286 INFO L231 Difference]: Finished difference. Result has 96 places, 88 transitions, 244 flow [2025-03-09 01:16:14,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=244, PETRI_PLACES=96, PETRI_TRANSITIONS=88} [2025-03-09 01:16:14,288 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 4 predicate places. [2025-03-09 01:16:14,288 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 88 transitions, 244 flow [2025-03-09 01:16:14,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 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-03-09 01:16:14,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:16:14,288 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:16:14,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:16:14,289 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-03-09 01:16:14,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:16:14,289 INFO L85 PathProgramCache]: Analyzing trace with hash 490676566, now seen corresponding path program 1 times [2025-03-09 01:16:14,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:16:14,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137208371] [2025-03-09 01:16:14,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:16:14,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:16:14,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:16:14,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:16:14,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:16:14,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:16:14,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:16:14,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:16:14,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137208371] [2025-03-09 01:16:14,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137208371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:16:14,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:16:14,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:16:14,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829354523] [2025-03-09 01:16:14,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:16:14,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:16:14,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:16:14,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:16:14,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:16:14,355 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 108 [2025-03-09 01:16:14,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 88 transitions, 244 flow. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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-03-09 01:16:14,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:16:14,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 108 [2025-03-09 01:16:14,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:16:20,504 INFO L124 PetriNetUnfolderBase]: 68744/112361 cut-off events. [2025-03-09 01:16:20,505 INFO L125 PetriNetUnfolderBase]: For 11855/11881 co-relation queries the response was YES. [2025-03-09 01:16:20,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214266 conditions, 112361 events. 68744/112361 cut-off events. For 11855/11881 co-relation queries the response was YES. Maximal size of possible extension queue 2259. Compared 1006906 event pairs, 22552 based on Foata normal form. 0/105112 useless extension candidates. Maximal degree in co-relation 121312. Up to 47254 conditions per place. [2025-03-09 01:16:21,068 INFO L140 encePairwiseOnDemand]: 102/108 looper letters, 159 selfloop transitions, 7 changer transitions 0/199 dead transitions. [2025-03-09 01:16:21,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 199 transitions, 862 flow [2025-03-09 01:16:21,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:16:21,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:16:21,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 337 transitions. [2025-03-09 01:16:21,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6240740740740741 [2025-03-09 01:16:21,070 INFO L175 Difference]: Start difference. First operand has 96 places, 88 transitions, 244 flow. Second operand 5 states and 337 transitions. [2025-03-09 01:16:21,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 199 transitions, 862 flow [2025-03-09 01:16:21,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 199 transitions, 834 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-03-09 01:16:21,077 INFO L231 Difference]: Finished difference. Result has 101 places, 93 transitions, 279 flow [2025-03-09 01:16:21,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=279, PETRI_PLACES=101, PETRI_TRANSITIONS=93} [2025-03-09 01:16:21,078 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 9 predicate places. [2025-03-09 01:16:21,078 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 93 transitions, 279 flow [2025-03-09 01:16:21,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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-03-09 01:16:21,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:16:21,078 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:16:21,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:16:21,078 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-03-09 01:16:21,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:16:21,078 INFO L85 PathProgramCache]: Analyzing trace with hash 205669808, now seen corresponding path program 1 times [2025-03-09 01:16:21,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:16:21,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176651785] [2025-03-09 01:16:21,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:16:21,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:16:21,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:16:21,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:16:21,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:16:21,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:16:21,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:16:21,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:16:21,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176651785] [2025-03-09 01:16:21,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176651785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:16:21,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:16:21,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:16:21,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848156451] [2025-03-09 01:16:21,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:16:21,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:16:21,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:16:21,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:16:21,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:16:21,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 108 [2025-03-09 01:16:21,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 93 transitions, 279 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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-03-09 01:16:21,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:16:21,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 108 [2025-03-09 01:16:21,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand