./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_82-list_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 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_82-list_racefree.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 6ac894f5c6207d1329786eb676509b79ca36f8c33f880cc59ffa30652ab92765 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:04:12,755 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:04:12,803 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:04:12,808 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:04:12,809 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:04:12,826 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:04:12,827 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:04:12,827 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:04:12,828 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:04:12,828 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:04:12,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:04:12,828 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:04:12,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:04:12,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:04:12,828 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:04:12,829 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:04:12,829 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:04:12,829 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:04:12,829 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:04:12,829 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:04:12,829 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:04:12,829 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:04:12,829 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:04:12,829 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:04:12,829 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:04:12,830 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:04:12,830 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:04:12,830 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:04:12,830 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:04:12,830 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:04:12,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:04:12,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:04:12,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:04:12,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:04:12,830 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:04:12,831 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:04:12,831 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:04:12,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:04:12,831 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:04:12,831 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:04:12,831 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:04:12,831 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:04:12,831 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 -> 6ac894f5c6207d1329786eb676509b79ca36f8c33f880cc59ffa30652ab92765 [2025-03-04 10:04:13,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:04:13,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:04:13,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:04:13,126 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:04:13,126 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:04:13,127 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_82-list_racefree.i [2025-03-04 10:04:14,299 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f230e9f9/68cc95fac75240d499b7e016db4662e5/FLAG44da27c5c [2025-03-04 10:04:14,578 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:04:14,578 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_82-list_racefree.i [2025-03-04 10:04:14,593 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f230e9f9/68cc95fac75240d499b7e016db4662e5/FLAG44da27c5c [2025-03-04 10:04:14,874 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f230e9f9/68cc95fac75240d499b7e016db4662e5 [2025-03-04 10:04:14,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:04:14,877 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:04:14,878 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:04:14,878 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:04:14,881 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:04:14,881 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:04:14" (1/1) ... [2025-03-04 10:04:14,882 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c1a95ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:14, skipping insertion in model container [2025-03-04 10:04:14,882 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:04:14" (1/1) ... [2025-03-04 10:04:14,921 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:04:15,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:04:15,199 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:04:15,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:04:15,289 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:04:15,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:15 WrapperNode [2025-03-04 10:04:15,290 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:04:15,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:04:15,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:04:15,291 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:04:15,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:15" (1/1) ... [2025-03-04 10:04:15,309 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:15" (1/1) ... [2025-03-04 10:04:15,329 INFO L138 Inliner]: procedures = 279, calls = 68, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2025-03-04 10:04:15,329 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:04:15,330 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:04:15,330 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:04:15,330 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:04:15,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:15" (1/1) ... [2025-03-04 10:04:15,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:15" (1/1) ... [2025-03-04 10:04:15,339 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:15" (1/1) ... [2025-03-04 10:04:15,352 INFO L175 MemorySlicer]: Split 35 memory accesses to 7 slices as follows [2, 14, 5, 5, 5, 2, 2]. 40 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 0, 5, 5, 5, 0, 0]. The 10 writes are split as follows [0, 8, 0, 0, 0, 1, 1]. [2025-03-04 10:04:15,353 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:15" (1/1) ... [2025-03-04 10:04:15,353 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:15" (1/1) ... [2025-03-04 10:04:15,361 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:15" (1/1) ... [2025-03-04 10:04:15,363 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:15" (1/1) ... [2025-03-04 10:04:15,365 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:15" (1/1) ... [2025-03-04 10:04:15,366 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:15" (1/1) ... [2025-03-04 10:04:15,369 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:04:15,370 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:04:15,370 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:04:15,370 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:04:15,371 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:15" (1/1) ... [2025-03-04 10:04:15,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:04:15,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:04:15,398 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-04 10:04:15,401 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-04 10:04:15,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 10:04:15,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 10:04:15,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 10:04:15,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 10:04:15,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 10:04:15,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 10:04:15,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 10:04:15,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 10:04:15,421 INFO L130 BoogieDeclarations]: Found specification of procedure t1_fun [2025-03-04 10:04:15,421 INFO L138 BoogieDeclarations]: Found implementation of procedure t1_fun [2025-03-04 10:04:15,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 10:04:15,421 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 10:04:15,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:04:15,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:04:15,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 10:04:15,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 10:04:15,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 10:04:15,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 10:04:15,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 10:04:15,422 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-03-04 10:04:15,422 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-03-04 10:04:15,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:04:15,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:04:15,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 10:04:15,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 10:04:15,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 10:04:15,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 10:04:15,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 10:04:15,422 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 10:04:15,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:04:15,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:04:15,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 10:04:15,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 10:04:15,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 10:04:15,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 10:04:15,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 10:04:15,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 10:04:15,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 10:04:15,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:04:15,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:04:15,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 10:04:15,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 10:04:15,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 10:04:15,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 10:04:15,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 10:04:15,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:04:15,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:04:15,424 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:04:15,593 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:04:15,595 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:04:15,904 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1044: havoc main_~#t1_ids~0#1.base, main_~#t1_ids~0#1.offset; [2025-03-04 10:04:15,904 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1044-1: SUMMARY for call ULTIMATE.dealloc(main_~#t1_ids~0#1.base, main_~#t1_ids~0#1.offset); srcloc: null [2025-03-04 10:04:15,904 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1045: havoc main_~#t2_ids~0#1.base, main_~#t2_ids~0#1.offset; [2025-03-04 10:04:15,904 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1045-1: SUMMARY for call ULTIMATE.dealloc(main_~#t2_ids~0#1.base, main_~#t2_ids~0#1.offset); srcloc: null [2025-03-04 10:04:15,905 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:04:15,905 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:04:16,045 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:04:16,045 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:04:16,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:04:16 BoogieIcfgContainer [2025-03-04 10:04:16,046 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:04:16,047 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:04:16,047 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:04:16,050 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:04:16,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:04:14" (1/3) ... [2025-03-04 10:04:16,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41a7bd5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:04:16, skipping insertion in model container [2025-03-04 10:04:16,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:15" (2/3) ... [2025-03-04 10:04:16,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41a7bd5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:04:16, skipping insertion in model container [2025-03-04 10:04:16,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:04:16" (3/3) ... [2025-03-04 10:04:16,056 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_82-list_racefree.i [2025-03-04 10:04:16,067 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:04:16,068 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_82-list_racefree.i that has 3 procedures, 112 locations, 1 initial locations, 9 loop locations, and 38 error locations. [2025-03-04 10:04:16,068 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:04:16,132 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-04 10:04:16,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 132 transitions, 284 flow [2025-03-04 10:04:16,229 INFO L124 PetriNetUnfolderBase]: 38/270 cut-off events. [2025-03-04 10:04:16,232 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-04 10:04:16,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 270 events. 38/270 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1398 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 142. Up to 8 conditions per place. [2025-03-04 10:04:16,239 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 132 transitions, 284 flow [2025-03-04 10:04:16,243 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 132 transitions, 284 flow [2025-03-04 10:04:16,251 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:04:16,258 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;@7d31c7d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:04:16,258 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2025-03-04 10:04:16,265 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:04:16,265 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-03-04 10:04:16,265 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:04:16,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:04:16,266 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-04 10:04:16,266 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-03-04 10:04:16,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:04:16,269 INFO L85 PathProgramCache]: Analyzing trace with hash 18499, now seen corresponding path program 1 times [2025-03-04 10:04:16,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:04:16,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457439925] [2025-03-04 10:04:16,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:04:16,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:04:16,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 10:04:16,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 10:04:16,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:04:16,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:04:16,515 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-04 10:04:16,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:04:16,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457439925] [2025-03-04 10:04:16,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457439925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:04:16,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:04:16,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:04:16,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216414247] [2025-03-04 10:04:16,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:04:16,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:04:16,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:04:16,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:04:16,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:04:16,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 132 [2025-03-04 10:04:16,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 132 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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-04 10:04:16,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:04:16,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 132 [2025-03-04 10:04:16,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:04:17,297 INFO L124 PetriNetUnfolderBase]: 2776/6494 cut-off events. [2025-03-04 10:04:17,298 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2025-03-04 10:04:17,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11021 conditions, 6494 events. 2776/6494 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 52311 event pairs, 2586 based on Foata normal form. 406/5900 useless extension candidates. Maximal degree in co-relation 9574. Up to 4430 conditions per place. [2025-03-04 10:04:17,335 INFO L140 encePairwiseOnDemand]: 115/132 looper letters, 52 selfloop transitions, 2 changer transitions 0/116 dead transitions. [2025-03-04 10:04:17,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 116 transitions, 360 flow [2025-03-04 10:04:17,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:04:17,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:04:17,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 255 transitions. [2025-03-04 10:04:17,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6439393939393939 [2025-03-04 10:04:17,347 INFO L175 Difference]: Start difference. First operand has 118 places, 132 transitions, 284 flow. Second operand 3 states and 255 transitions. [2025-03-04 10:04:17,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 116 transitions, 360 flow [2025-03-04 10:04:17,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 116 transitions, 360 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 10:04:17,355 INFO L231 Difference]: Finished difference. Result has 117 places, 116 transitions, 256 flow [2025-03-04 10:04:17,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=117, PETRI_TRANSITIONS=116} [2025-03-04 10:04:17,360 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -1 predicate places. [2025-03-04 10:04:17,361 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 116 transitions, 256 flow [2025-03-04 10:04:17,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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-04 10:04:17,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:04:17,362 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-04 10:04:17,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:04:17,362 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-03-04 10:04:17,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:04:17,363 INFO L85 PathProgramCache]: Analyzing trace with hash 18500, now seen corresponding path program 1 times [2025-03-04 10:04:17,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:04:17,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067517168] [2025-03-04 10:04:17,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:04:17,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:04:17,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 10:04:17,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 10:04:17,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:04:17,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:04:17,492 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-04 10:04:17,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:04:17,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067517168] [2025-03-04 10:04:17,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067517168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:04:17,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:04:17,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:04:17,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532274703] [2025-03-04 10:04:17,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:04:17,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:04:17,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:04:17,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:04:17,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:04:17,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 132 [2025-03-04 10:04:17,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 116 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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-04 10:04:17,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:04:17,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 132 [2025-03-04 10:04:17,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:04:18,146 INFO L124 PetriNetUnfolderBase]: 2776/6492 cut-off events. [2025-03-04 10:04:18,147 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2025-03-04 10:04:18,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11021 conditions, 6492 events. 2776/6492 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 52387 event pairs, 2586 based on Foata normal form. 2/5494 useless extension candidates. Maximal degree in co-relation 11009. Up to 4430 conditions per place. [2025-03-04 10:04:18,177 INFO L140 encePairwiseOnDemand]: 128/132 looper letters, 51 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2025-03-04 10:04:18,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 114 transitions, 358 flow [2025-03-04 10:04:18,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:04:18,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:04:18,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 244 transitions. [2025-03-04 10:04:18,179 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6161616161616161 [2025-03-04 10:04:18,179 INFO L175 Difference]: Start difference. First operand has 117 places, 116 transitions, 256 flow. Second operand 3 states and 244 transitions. [2025-03-04 10:04:18,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 114 transitions, 358 flow [2025-03-04 10:04:18,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 114 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:04:18,181 INFO L231 Difference]: Finished difference. Result has 115 places, 114 transitions, 252 flow [2025-03-04 10:04:18,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=115, PETRI_TRANSITIONS=114} [2025-03-04 10:04:18,182 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -3 predicate places. [2025-03-04 10:04:18,182 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 114 transitions, 252 flow [2025-03-04 10:04:18,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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-04 10:04:18,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:04:18,185 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:04:18,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:04:18,185 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-03-04 10:04:18,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:04:18,186 INFO L85 PathProgramCache]: Analyzing trace with hash 551579089, now seen corresponding path program 1 times [2025-03-04 10:04:18,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:04:18,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839262599] [2025-03-04 10:04:18,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:04:18,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:04:18,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:04:18,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:04:18,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:04:18,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:04:18,248 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-04 10:04:18,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:04:18,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839262599] [2025-03-04 10:04:18,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839262599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:04:18,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:04:18,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:04:18,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864716553] [2025-03-04 10:04:18,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:04:18,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:04:18,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:04:18,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:04:18,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:04:18,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 132 [2025-03-04 10:04:18,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 114 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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-04 10:04:18,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:04:18,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 132 [2025-03-04 10:04:18,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:04:18,823 INFO L124 PetriNetUnfolderBase]: 3172/7070 cut-off events. [2025-03-04 10:04:18,823 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2025-03-04 10:04:18,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12243 conditions, 7070 events. 3172/7070 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 57769 event pairs, 2202 based on Foata normal form. 0/6137 useless extension candidates. Maximal degree in co-relation 12231. Up to 3813 conditions per place. [2025-03-04 10:04:18,854 INFO L140 encePairwiseOnDemand]: 128/132 looper letters, 87 selfloop transitions, 2 changer transitions 0/146 dead transitions. [2025-03-04 10:04:18,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 146 transitions, 494 flow [2025-03-04 10:04:18,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:04:18,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:04:18,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 274 transitions. [2025-03-04 10:04:18,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6919191919191919 [2025-03-04 10:04:18,856 INFO L175 Difference]: Start difference. First operand has 115 places, 114 transitions, 252 flow. Second operand 3 states and 274 transitions. [2025-03-04 10:04:18,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 146 transitions, 494 flow [2025-03-04 10:04:18,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 146 transitions, 490 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:04:18,859 INFO L231 Difference]: Finished difference. Result has 113 places, 112 transitions, 248 flow [2025-03-04 10:04:18,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=113, PETRI_TRANSITIONS=112} [2025-03-04 10:04:18,860 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -5 predicate places. [2025-03-04 10:04:18,860 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 112 transitions, 248 flow [2025-03-04 10:04:18,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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-04 10:04:18,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:04:18,860 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:04:18,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:04:18,861 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-03-04 10:04:18,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:04:18,861 INFO L85 PathProgramCache]: Analyzing trace with hash 551579090, now seen corresponding path program 1 times [2025-03-04 10:04:18,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:04:18,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344266343] [2025-03-04 10:04:18,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:04:18,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:04:18,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:04:18,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:04:18,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:04:18,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:04:18,958 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-04 10:04:18,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:04:18,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344266343] [2025-03-04 10:04:18,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344266343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:04:18,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:04:18,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:04:18,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809229579] [2025-03-04 10:04:18,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:04:18,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:04:18,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:04:18,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:04:18,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:04:19,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 132 [2025-03-04 10:04:19,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 112 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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-04 10:04:19,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:04:19,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 132 [2025-03-04 10:04:19,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:04:19,530 INFO L124 PetriNetUnfolderBase]: 2693/6211 cut-off events. [2025-03-04 10:04:19,531 INFO L125 PetriNetUnfolderBase]: For 385/392 co-relation queries the response was YES. [2025-03-04 10:04:19,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10810 conditions, 6211 events. 2693/6211 cut-off events. For 385/392 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 49601 event pairs, 2331 based on Foata normal form. 1/5350 useless extension candidates. Maximal degree in co-relation 9698. Up to 4269 conditions per place. [2025-03-04 10:04:19,571 INFO L140 encePairwiseOnDemand]: 127/132 looper letters, 54 selfloop transitions, 3 changer transitions 0/115 dead transitions. [2025-03-04 10:04:19,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 115 transitions, 368 flow [2025-03-04 10:04:19,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:04:19,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:04:19,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2025-03-04 10:04:19,574 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6338383838383839 [2025-03-04 10:04:19,574 INFO L175 Difference]: Start difference. First operand has 113 places, 112 transitions, 248 flow. Second operand 3 states and 251 transitions. [2025-03-04 10:04:19,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 115 transitions, 368 flow [2025-03-04 10:04:19,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 115 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:04:19,585 INFO L231 Difference]: Finished difference. Result has 114 places, 114 transitions, 265 flow [2025-03-04 10:04:19,586 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=265, PETRI_PLACES=114, PETRI_TRANSITIONS=114} [2025-03-04 10:04:19,587 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -4 predicate places. [2025-03-04 10:04:19,587 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 114 transitions, 265 flow [2025-03-04 10:04:19,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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-04 10:04:19,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:04:19,588 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:04:19,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:04:19,588 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-03-04 10:04:19,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:04:19,588 INFO L85 PathProgramCache]: Analyzing trace with hash -451609178, now seen corresponding path program 1 times [2025-03-04 10:04:19,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:04:19,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620424535] [2025-03-04 10:04:19,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:04:19,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:04:19,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:04:19,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:04:19,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:04:19,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:04:19,696 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-04 10:04:19,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:04:19,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620424535] [2025-03-04 10:04:19,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620424535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:04:19,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:04:19,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:04:19,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660245905] [2025-03-04 10:04:19,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:04:19,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:04:19,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:04:19,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:04:19,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:04:19,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 132 [2025-03-04 10:04:19,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 114 transitions, 265 flow. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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-04 10:04:19,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:04:19,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 132 [2025-03-04 10:04:19,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:04:20,202 INFO L124 PetriNetUnfolderBase]: 3416/7815 cut-off events. [2025-03-04 10:04:20,202 INFO L125 PetriNetUnfolderBase]: For 407/414 co-relation queries the response was YES. [2025-03-04 10:04:20,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13560 conditions, 7815 events. 3416/7815 cut-off events. For 407/414 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 63775 event pairs, 2538 based on Foata normal form. 0/6701 useless extension candidates. Maximal degree in co-relation 12477. Up to 4247 conditions per place. [2025-03-04 10:04:20,234 INFO L140 encePairwiseOnDemand]: 126/132 looper letters, 97 selfloop transitions, 5 changer transitions 0/158 dead transitions. [2025-03-04 10:04:20,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 158 transitions, 570 flow [2025-03-04 10:04:20,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:04:20,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:04:20,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2025-03-04 10:04:20,236 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2025-03-04 10:04:20,236 INFO L175 Difference]: Start difference. First operand has 114 places, 114 transitions, 265 flow. Second operand 3 states and 288 transitions. [2025-03-04 10:04:20,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 158 transitions, 570 flow [2025-03-04 10:04:20,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 158 transitions, 567 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:04:20,241 INFO L231 Difference]: Finished difference. Result has 117 places, 117 transitions, 298 flow [2025-03-04 10:04:20,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=117, PETRI_TRANSITIONS=117} [2025-03-04 10:04:20,242 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -1 predicate places. [2025-03-04 10:04:20,242 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 117 transitions, 298 flow [2025-03-04 10:04:20,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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-04 10:04:20,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:04:20,242 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:04:20,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:04:20,242 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-03-04 10:04:20,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:04:20,243 INFO L85 PathProgramCache]: Analyzing trace with hash -451609177, now seen corresponding path program 1 times [2025-03-04 10:04:20,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:04:20,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638075254] [2025-03-04 10:04:20,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:04:20,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:04:20,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:04:20,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:04:20,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:04:20,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:04:20,353 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-04 10:04:20,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:04:20,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638075254] [2025-03-04 10:04:20,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638075254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:04:20,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:04:20,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:04:20,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568796297] [2025-03-04 10:04:20,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:04:20,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:04:20,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:04:20,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:04:20,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:04:20,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 132 [2025-03-04 10:04:20,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 117 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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-04 10:04:20,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:04:20,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 132 [2025-03-04 10:04:20,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:04:20,981 INFO L124 PetriNetUnfolderBase]: 4197/9435 cut-off events. [2025-03-04 10:04:20,981 INFO L125 PetriNetUnfolderBase]: For 2910/3219 co-relation queries the response was YES. [2025-03-04 10:04:20,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18574 conditions, 9435 events. 4197/9435 cut-off events. For 2910/3219 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 80634 event pairs, 2984 based on Foata normal form. 582/8835 useless extension candidates. Maximal degree in co-relation 17461. Up to 5783 conditions per place. [2025-03-04 10:04:21,017 INFO L140 encePairwiseOnDemand]: 127/132 looper letters, 98 selfloop transitions, 5 changer transitions 0/161 dead transitions. [2025-03-04 10:04:21,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 161 transitions, 615 flow [2025-03-04 10:04:21,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:04:21,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:04:21,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 289 transitions. [2025-03-04 10:04:21,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7297979797979798 [2025-03-04 10:04:21,019 INFO L175 Difference]: Start difference. First operand has 117 places, 117 transitions, 298 flow. Second operand 3 states and 289 transitions. [2025-03-04 10:04:21,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 161 transitions, 615 flow [2025-03-04 10:04:21,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 161 transitions, 601 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:04:21,024 INFO L231 Difference]: Finished difference. Result has 118 places, 120 transitions, 325 flow [2025-03-04 10:04:21,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=325, PETRI_PLACES=118, PETRI_TRANSITIONS=120} [2025-03-04 10:04:21,025 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 0 predicate places. [2025-03-04 10:04:21,025 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 120 transitions, 325 flow [2025-03-04 10:04:21,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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-04 10:04:21,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:04:21,026 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:04:21,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:04:21,026 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-03-04 10:04:21,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:04:21,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1115078734, now seen corresponding path program 1 times [2025-03-04 10:04:21,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:04:21,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026054830] [2025-03-04 10:04:21,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:04:21,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:04:21,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:04:21,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:04:21,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:04:21,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:04:21,182 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-04 10:04:21,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:04:21,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026054830] [2025-03-04 10:04:21,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026054830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:04:21,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:04:21,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:04:21,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406527397] [2025-03-04 10:04:21,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:04:21,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:04:21,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:04:21,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:04:21,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:04:21,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 132 [2025-03-04 10:04:21,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 120 transitions, 325 flow. Second operand has 5 states, 5 states have (on average 64.6) internal successors, (323), 5 states have internal predecessors, (323), 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-04 10:04:21,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:04:21,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 132 [2025-03-04 10:04:21,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:04:21,661 INFO L124 PetriNetUnfolderBase]: 2432/5605 cut-off events. [2025-03-04 10:04:21,661 INFO L125 PetriNetUnfolderBase]: For 2288/3608 co-relation queries the response was YES. [2025-03-04 10:04:21,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10400 conditions, 5605 events. 2432/5605 cut-off events. For 2288/3608 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 44499 event pairs, 2024 based on Foata normal form. 57/4891 useless extension candidates. Maximal degree in co-relation 9297. Up to 3870 conditions per place. [2025-03-04 10:04:21,685 INFO L140 encePairwiseOnDemand]: 127/132 looper letters, 61 selfloop transitions, 4 changer transitions 0/123 dead transitions. [2025-03-04 10:04:21,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 123 transitions, 456 flow [2025-03-04 10:04:21,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:04:21,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:04:21,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 315 transitions. [2025-03-04 10:04:21,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5965909090909091 [2025-03-04 10:04:21,687 INFO L175 Difference]: Start difference. First operand has 118 places, 120 transitions, 325 flow. Second operand 4 states and 315 transitions. [2025-03-04 10:04:21,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 123 transitions, 456 flow [2025-03-04 10:04:21,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 123 transitions, 452 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:04:21,691 INFO L231 Difference]: Finished difference. Result has 121 places, 119 transitions, 328 flow [2025-03-04 10:04:21,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=328, PETRI_PLACES=121, PETRI_TRANSITIONS=119} [2025-03-04 10:04:21,693 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 3 predicate places. [2025-03-04 10:04:21,693 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 119 transitions, 328 flow [2025-03-04 10:04:21,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 64.6) internal successors, (323), 5 states have internal predecessors, (323), 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-04 10:04:21,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:04:21,693 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:04:21,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:04:21,693 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-03-04 10:04:21,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:04:21,694 INFO L85 PathProgramCache]: Analyzing trace with hash -204801198, now seen corresponding path program 1 times [2025-03-04 10:04:21,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:04:21,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088547265] [2025-03-04 10:04:21,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:04:21,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:04:21,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:04:21,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:04:21,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:04:21,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:04:21,758 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-04 10:04:21,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:04:21,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088547265] [2025-03-04 10:04:21,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088547265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:04:21,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:04:21,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:04:21,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233862832] [2025-03-04 10:04:21,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:04:21,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:04:21,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:04:21,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:04:21,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:04:21,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 132 [2025-03-04 10:04:21,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 119 transitions, 328 flow. Second operand has 4 states, 4 states have (on average 66.75) internal successors, (267), 4 states have internal predecessors, (267), 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-04 10:04:21,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:04:21,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 132 [2025-03-04 10:04:21,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:04:21,793 INFO L124 PetriNetUnfolderBase]: 12/75 cut-off events. [2025-03-04 10:04:21,793 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-03-04 10:04:21,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 75 events. 12/75 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 237 event pairs, 6 based on Foata normal form. 6/65 useless extension candidates. Maximal degree in co-relation 149. Up to 26 conditions per place. [2025-03-04 10:04:21,794 INFO L140 encePairwiseOnDemand]: 129/132 looper letters, 16 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2025-03-04 10:04:21,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 33 transitions, 150 flow [2025-03-04 10:04:21,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:04:21,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:04:21,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 279 transitions. [2025-03-04 10:04:21,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5284090909090909 [2025-03-04 10:04:21,795 INFO L175 Difference]: Start difference. First operand has 121 places, 119 transitions, 328 flow. Second operand 4 states and 279 transitions. [2025-03-04 10:04:21,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 33 transitions, 150 flow [2025-03-04 10:04:21,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 33 transitions, 124 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-03-04 10:04:21,800 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 80 flow [2025-03-04 10:04:21,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2025-03-04 10:04:21,800 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -82 predicate places. [2025-03-04 10:04:21,800 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 80 flow [2025-03-04 10:04:21,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.75) internal successors, (267), 4 states have internal predecessors, (267), 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-04 10:04:21,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:04:21,801 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:04:21,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:04:21,801 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-03-04 10:04:21,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:04:21,801 INFO L85 PathProgramCache]: Analyzing trace with hash -207701789, now seen corresponding path program 1 times [2025-03-04 10:04:21,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:04:21,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225542482] [2025-03-04 10:04:21,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:04:21,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:04:21,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:04:21,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:04:21,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:04:21,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:04:21,819 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 10:04:21,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:04:21,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:04:21,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:04:21,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:04:21,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 10:04:21,848 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 10:04:21,848 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (64 of 65 remaining) [2025-03-04 10:04:21,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 65 remaining) [2025-03-04 10:04:21,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 65 remaining) [2025-03-04 10:04:21,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 65 remaining) [2025-03-04 10:04:21,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 65 remaining) [2025-03-04 10:04:21,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 65 remaining) [2025-03-04 10:04:21,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 65 remaining) [2025-03-04 10:04:21,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 65 remaining) [2025-03-04 10:04:21,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 65 remaining) [2025-03-04 10:04:21,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 65 remaining) [2025-03-04 10:04:21,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 65 remaining) [2025-03-04 10:04:21,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 65 remaining) [2025-03-04 10:04:21,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 65 remaining) [2025-03-04 10:04:21,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 65 remaining) [2025-03-04 10:04:21,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 65 remaining) [2025-03-04 10:04:21,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr8ASSERT_VIOLATIONMEMORY_LEAK (49 of 65 remaining) [2025-03-04 10:04:21,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 65 remaining) [2025-03-04 10:04:21,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 65 remaining) [2025-03-04 10:04:21,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 65 remaining) [2025-03-04 10:04:21,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 65 remaining) [2025-03-04 10:04:21,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 65 remaining) [2025-03-04 10:04:21,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 65 remaining) [2025-03-04 10:04:21,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 65 remaining) [2025-03-04 10:04:21,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 65 remaining) [2025-03-04 10:04:21,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 65 remaining) [2025-03-04 10:04:21,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 65 remaining) [2025-03-04 10:04:21,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 65 remaining) [2025-03-04 10:04:21,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 65 remaining) [2025-03-04 10:04:21,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (36 of 65 remaining) [2025-03-04 10:04:21,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 65 remaining) [2025-03-04 10:04:21,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 65 remaining) [2025-03-04 10:04:21,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 65 remaining) [2025-03-04 10:04:21,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 65 remaining) [2025-03-04 10:04:21,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 65 remaining) [2025-03-04 10:04:21,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 65 remaining) [2025-03-04 10:04:21,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 65 remaining) [2025-03-04 10:04:21,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 65 remaining) [2025-03-04 10:04:21,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 65 remaining) [2025-03-04 10:04:21,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 65 remaining) [2025-03-04 10:04:21,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 65 remaining) [2025-03-04 10:04:21,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 65 remaining) [2025-03-04 10:04:21,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 65 remaining) [2025-03-04 10:04:21,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 65 remaining) [2025-03-04 10:04:21,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 65 remaining) [2025-03-04 10:04:21,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 65 remaining) [2025-03-04 10:04:21,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 65 remaining) [2025-03-04 10:04:21,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 65 remaining) [2025-03-04 10:04:21,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 65 remaining) [2025-03-04 10:04:21,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 65 remaining) [2025-03-04 10:04:21,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 65 remaining) [2025-03-04 10:04:21,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 65 remaining) [2025-03-04 10:04:21,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 65 remaining) [2025-03-04 10:04:21,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 65 remaining) [2025-03-04 10:04:21,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 65 remaining) [2025-03-04 10:04:21,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr8ASSERT_VIOLATIONMEMORY_LEAK (10 of 65 remaining) [2025-03-04 10:04:21,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 65 remaining) [2025-03-04 10:04:21,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 65 remaining) [2025-03-04 10:04:21,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 65 remaining) [2025-03-04 10:04:21,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 65 remaining) [2025-03-04 10:04:21,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 65 remaining) [2025-03-04 10:04:21,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 65 remaining) [2025-03-04 10:04:21,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 65 remaining) [2025-03-04 10:04:21,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 65 remaining) [2025-03-04 10:04:21,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 65 remaining) [2025-03-04 10:04:21,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 65 remaining) [2025-03-04 10:04:21,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:04:21,855 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:04:21,857 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 10:04:21,857 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 10:04:21,914 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-03-04 10:04:21,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 229 transitions, 502 flow [2025-03-04 10:04:21,996 INFO L124 PetriNetUnfolderBase]: 147/839 cut-off events. [2025-03-04 10:04:21,997 INFO L125 PetriNetUnfolderBase]: For 72/90 co-relation queries the response was YES. [2025-03-04 10:04:22,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 839 events. 147/839 cut-off events. For 72/90 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 6057 event pairs, 2 based on Foata normal form. 0/476 useless extension candidates. Maximal degree in co-relation 529. Up to 32 conditions per place. [2025-03-04 10:04:22,003 INFO L82 GeneralOperation]: Start removeDead. Operand has 200 places, 229 transitions, 502 flow [2025-03-04 10:04:22,012 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 200 places, 229 transitions, 502 flow [2025-03-04 10:04:22,013 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:04:22,013 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;@7d31c7d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:04:22,013 INFO L334 AbstractCegarLoop]: Starting to check reachability of 90 error locations. [2025-03-04 10:04:22,015 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:04:22,015 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-03-04 10:04:22,015 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:04:22,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:04:22,015 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-04 10:04:22,015 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2025-03-04 10:04:22,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:04:22,015 INFO L85 PathProgramCache]: Analyzing trace with hash 25763, now seen corresponding path program 1 times [2025-03-04 10:04:22,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:04:22,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976756049] [2025-03-04 10:04:22,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:04:22,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:04:22,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 10:04:22,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 10:04:22,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:04:22,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:04:22,046 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-04 10:04:22,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:04:22,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976756049] [2025-03-04 10:04:22,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976756049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:04:22,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:04:22,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:04:22,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825076654] [2025-03-04 10:04:22,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:04:22,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:04:22,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:04:22,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:04:22,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:04:22,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 229 [2025-03-04 10:04:22,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 229 transitions, 502 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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-04 10:04:22,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:04:22,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 229 [2025-03-04 10:04:22,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand