./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_82-list_racefree.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G 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-?-c00e63d-m [2025-02-06 12:58:45,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:58:45,562 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:58:45,567 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:58:45,570 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:58:45,592 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:58:45,593 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:58:45,593 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:58:45,594 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:58:45,594 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:58:45,595 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:58:45,595 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:58:45,595 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:58:45,595 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:58:45,595 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:58:45,595 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:58:45,595 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:58:45,595 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:58:45,595 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:58:45,596 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:58:45,596 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:58:45,596 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:58:45,596 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:58:45,596 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:58:45,596 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:58:45,596 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:58:45,596 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:58:45,596 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:58:45,596 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:58:45,596 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:58:45,597 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:58:45,597 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:58:45,597 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:58:45,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:58:45,597 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:58:45,597 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:58:45,598 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:58:45,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:58:45,598 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:58:45,598 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:58:45,598 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:58:45,598 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:58:45,598 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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-02-06 12:58:45,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:58:45,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:58:45,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:58:45,826 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:58:45,827 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:58:45,827 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_82-list_racefree.i [2025-02-06 12:58:46,945 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36ccd9f79/e13e1d9bd61c4e9ca3b039a2706f3ccc/FLAG0b7e13507 [2025-02-06 12:58:47,256 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:58:47,257 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_82-list_racefree.i [2025-02-06 12:58:47,270 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36ccd9f79/e13e1d9bd61c4e9ca3b039a2706f3ccc/FLAG0b7e13507 [2025-02-06 12:58:47,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36ccd9f79/e13e1d9bd61c4e9ca3b039a2706f3ccc [2025-02-06 12:58:47,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:58:47,522 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:58:47,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:58:47,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:58:47,526 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:58:47,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:58:47" (1/1) ... [2025-02-06 12:58:47,527 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d4037ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:47, skipping insertion in model container [2025-02-06 12:58:47,527 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:58:47" (1/1) ... [2025-02-06 12:58:47,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:58:47,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:58:47,941 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:58:47,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:58:48,040 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:58:48,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:48 WrapperNode [2025-02-06 12:58:48,041 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:58:48,042 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:58:48,042 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:58:48,042 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:58:48,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:48" (1/1) ... [2025-02-06 12:58:48,064 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:48" (1/1) ... [2025-02-06 12:58:48,086 INFO L138 Inliner]: procedures = 279, calls = 68, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2025-02-06 12:58:48,086 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:58:48,087 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:58:48,087 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:58:48,087 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:58:48,093 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:48" (1/1) ... [2025-02-06 12:58:48,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:48" (1/1) ... [2025-02-06 12:58:48,097 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:48" (1/1) ... [2025-02-06 12:58:48,111 INFO L175 MemorySlicer]: Split 35 memory accesses to 7 slices as follows [2, 5, 5, 5, 2, 2, 14]. 40 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5, 0, 0, 0]. The 10 writes are split as follows [0, 0, 0, 0, 1, 1, 8]. [2025-02-06 12:58:48,111 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:48" (1/1) ... [2025-02-06 12:58:48,111 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:48" (1/1) ... [2025-02-06 12:58:48,119 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:48" (1/1) ... [2025-02-06 12:58:48,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:48" (1/1) ... [2025-02-06 12:58:48,121 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:48" (1/1) ... [2025-02-06 12:58:48,122 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:48" (1/1) ... [2025-02-06 12:58:48,124 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:58:48,125 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:58:48,125 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:58:48,125 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:58:48,125 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:48" (1/1) ... [2025-02-06 12:58:48,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:58:48,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:58:48,152 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:58:48,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:58:48,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 12:58:48,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 12:58:48,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 12:58:48,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 12:58:48,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 12:58:48,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 12:58:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 12:58:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-06 12:58:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure t1_fun [2025-02-06 12:58:48,171 INFO L138 BoogieDeclarations]: Found implementation of procedure t1_fun [2025-02-06 12:58:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 12:58:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 12:58:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:58:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:58:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 12:58:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 12:58:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 12:58:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 12:58:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 12:58:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-02-06 12:58:48,171 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-02-06 12:58:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:58:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:58:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 12:58:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 12:58:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 12:58:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 12:58:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 12:58:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 12:58:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 12:58:48,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:58:48,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 12:58:48,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 12:58:48,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 12:58:48,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 12:58:48,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 12:58:48,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 12:58:48,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-06 12:58:48,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:58:48,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:58:48,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 12:58:48,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 12:58:48,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 12:58:48,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 12:58:48,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 12:58:48,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:58:48,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:58:48,174 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:58:48,351 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:58:48,353 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:58:48,752 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1044: havoc main_~#t1_ids~0#1.base, main_~#t1_ids~0#1.offset; [2025-02-06 12:58:48,752 INFO L1309 $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-02-06 12:58:48,755 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1045: havoc main_~#t2_ids~0#1.base, main_~#t2_ids~0#1.offset; [2025-02-06 12:58:48,755 INFO L1309 $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-02-06 12:58:48,756 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:58:48,756 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:58:48,917 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:58:48,918 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:58:48,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:58:48 BoogieIcfgContainer [2025-02-06 12:58:48,918 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:58:48,919 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:58:48,919 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:58:48,925 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:58:48,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:58:47" (1/3) ... [2025-02-06 12:58:48,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@773be086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:58:48, skipping insertion in model container [2025-02-06 12:58:48,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:48" (2/3) ... [2025-02-06 12:58:48,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@773be086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:58:48, skipping insertion in model container [2025-02-06 12:58:48,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:58:48" (3/3) ... [2025-02-06 12:58:48,927 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_82-list_racefree.i [2025-02-06 12:58:48,937 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:58:48,938 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_82-list_racefree.i that has 3 procedures, 117 locations, 1 initial locations, 10 loop locations, and 38 error locations. [2025-02-06 12:58:48,938 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:58:49,011 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-06 12:58:49,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 137 transitions, 294 flow [2025-02-06 12:58:49,091 INFO L124 PetriNetUnfolderBase]: 38/280 cut-off events. [2025-02-06 12:58:49,093 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-06 12:58:49,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 280 events. 38/280 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1453 event pairs, 0 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 147. Up to 8 conditions per place. [2025-02-06 12:58:49,099 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 137 transitions, 294 flow [2025-02-06 12:58:49,102 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 137 transitions, 294 flow [2025-02-06 12:58:49,107 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:58:49,114 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;@5d8b5310, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:58:49,114 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2025-02-06 12:58:49,117 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:58:49,117 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-02-06 12:58:49,117 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:58:49,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:49,118 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-02-06 12:58:49,118 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-02-06 12:58:49,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:49,121 INFO L85 PathProgramCache]: Analyzing trace with hash 18722, now seen corresponding path program 1 times [2025-02-06 12:58:49,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:49,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132704739] [2025-02-06 12:58:49,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:49,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:49,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 12:58:49,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 12:58:49,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:49,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:49,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:49,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:49,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132704739] [2025-02-06 12:58:49,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132704739] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:49,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:49,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:58:49,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944047523] [2025-02-06 12:58:49,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:49,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:49,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:49,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:49,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:49,422 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 137 [2025-02-06 12:58:49,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 137 transitions, 294 flow. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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-02-06 12:58:49,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:49,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 137 [2025-02-06 12:58:49,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:50,106 INFO L124 PetriNetUnfolderBase]: 2776/6724 cut-off events. [2025-02-06 12:58:50,107 INFO L125 PetriNetUnfolderBase]: For 159/159 co-relation queries the response was YES. [2025-02-06 12:58:50,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11251 conditions, 6724 events. 2776/6724 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 54913 event pairs, 2586 based on Foata normal form. 696/6458 useless extension candidates. Maximal degree in co-relation 9780. Up to 4430 conditions per place. [2025-02-06 12:58:50,147 INFO L140 encePairwiseOnDemand]: 120/137 looper letters, 52 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2025-02-06 12:58:50,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 121 transitions, 370 flow [2025-02-06 12:58:50,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:58:50,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:58:50,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2025-02-06 12:58:50,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.656934306569343 [2025-02-06 12:58:50,157 INFO L175 Difference]: Start difference. First operand has 123 places, 137 transitions, 294 flow. Second operand 3 states and 270 transitions. [2025-02-06 12:58:50,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 121 transitions, 370 flow [2025-02-06 12:58:50,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 121 transitions, 370 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:58:50,164 INFO L231 Difference]: Finished difference. Result has 122 places, 121 transitions, 266 flow [2025-02-06 12:58:50,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=266, PETRI_PLACES=122, PETRI_TRANSITIONS=121} [2025-02-06 12:58:50,168 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, -1 predicate places. [2025-02-06 12:58:50,168 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 121 transitions, 266 flow [2025-02-06 12:58:50,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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-02-06 12:58:50,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:50,168 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-02-06 12:58:50,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:58:50,169 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-02-06 12:58:50,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:50,169 INFO L85 PathProgramCache]: Analyzing trace with hash 18723, now seen corresponding path program 1 times [2025-02-06 12:58:50,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:50,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153283108] [2025-02-06 12:58:50,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:50,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:50,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 12:58:50,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 12:58:50,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:50,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:50,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:50,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:50,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153283108] [2025-02-06 12:58:50,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153283108] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:50,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:50,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:58:50,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27928116] [2025-02-06 12:58:50,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:50,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:50,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:50,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:50,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:50,319 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 137 [2025-02-06 12:58:50,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 121 transitions, 266 flow. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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-02-06 12:58:50,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:50,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 137 [2025-02-06 12:58:50,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:50,842 INFO L124 PetriNetUnfolderBase]: 2776/6722 cut-off events. [2025-02-06 12:58:50,842 INFO L125 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2025-02-06 12:58:50,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11251 conditions, 6722 events. 2776/6722 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 54889 event pairs, 2586 based on Foata normal form. 2/5762 useless extension candidates. Maximal degree in co-relation 11239. Up to 4430 conditions per place. [2025-02-06 12:58:50,929 INFO L140 encePairwiseOnDemand]: 133/137 looper letters, 51 selfloop transitions, 2 changer transitions 0/119 dead transitions. [2025-02-06 12:58:50,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 119 transitions, 368 flow [2025-02-06 12:58:50,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:58:50,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:58:50,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2025-02-06 12:58:50,931 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6301703163017032 [2025-02-06 12:58:50,931 INFO L175 Difference]: Start difference. First operand has 122 places, 121 transitions, 266 flow. Second operand 3 states and 259 transitions. [2025-02-06 12:58:50,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 119 transitions, 368 flow [2025-02-06 12:58:50,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 119 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:58:50,934 INFO L231 Difference]: Finished difference. Result has 120 places, 119 transitions, 262 flow [2025-02-06 12:58:50,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=120, PETRI_TRANSITIONS=119} [2025-02-06 12:58:50,935 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, -3 predicate places. [2025-02-06 12:58:50,935 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 119 transitions, 262 flow [2025-02-06 12:58:50,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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-02-06 12:58:50,935 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:50,935 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:58:50,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:58:50,935 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-02-06 12:58:50,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:50,936 INFO L85 PathProgramCache]: Analyzing trace with hash 558230425, now seen corresponding path program 1 times [2025-02-06 12:58:50,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:50,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131791817] [2025-02-06 12:58:50,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:50,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:50,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:58:50,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:58:50,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:50,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:51,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:51,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:51,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131791817] [2025-02-06 12:58:51,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131791817] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:51,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:51,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:58:51,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613313621] [2025-02-06 12:58:51,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:51,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:51,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:51,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:51,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:51,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 137 [2025-02-06 12:58:51,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 119 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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-02-06 12:58:51,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:51,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 137 [2025-02-06 12:58:51,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:51,576 INFO L124 PetriNetUnfolderBase]: 3172/7272 cut-off events. [2025-02-06 12:58:51,577 INFO L125 PetriNetUnfolderBase]: For 159/159 co-relation queries the response was YES. [2025-02-06 12:58:51,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12445 conditions, 7272 events. 3172/7272 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 59880 event pairs, 2202 based on Foata normal form. 0/6356 useless extension candidates. Maximal degree in co-relation 12433. Up to 3813 conditions per place. [2025-02-06 12:58:51,609 INFO L140 encePairwiseOnDemand]: 133/137 looper letters, 87 selfloop transitions, 2 changer transitions 0/151 dead transitions. [2025-02-06 12:58:51,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 151 transitions, 504 flow [2025-02-06 12:58:51,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:58:51,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:58:51,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 289 transitions. [2025-02-06 12:58:51,613 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7031630170316302 [2025-02-06 12:58:51,615 INFO L175 Difference]: Start difference. First operand has 120 places, 119 transitions, 262 flow. Second operand 3 states and 289 transitions. [2025-02-06 12:58:51,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 151 transitions, 504 flow [2025-02-06 12:58:51,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 151 transitions, 500 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:58:51,619 INFO L231 Difference]: Finished difference. Result has 118 places, 117 transitions, 258 flow [2025-02-06 12:58:51,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=258, PETRI_PLACES=118, PETRI_TRANSITIONS=117} [2025-02-06 12:58:51,620 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, -5 predicate places. [2025-02-06 12:58:51,620 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 117 transitions, 258 flow [2025-02-06 12:58:51,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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-02-06 12:58:51,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:51,621 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:58:51,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:58:51,621 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-02-06 12:58:51,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:51,621 INFO L85 PathProgramCache]: Analyzing trace with hash 558230426, now seen corresponding path program 1 times [2025-02-06 12:58:51,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:51,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662823332] [2025-02-06 12:58:51,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:51,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:51,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:58:51,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:58:51,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:51,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:51,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:51,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:51,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662823332] [2025-02-06 12:58:51,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662823332] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:51,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:51,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:58:51,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097194727] [2025-02-06 12:58:51,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:51,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:51,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:51,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:51,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:51,771 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 137 [2025-02-06 12:58:51,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 117 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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-02-06 12:58:51,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:51,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 137 [2025-02-06 12:58:51,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:52,291 INFO L124 PetriNetUnfolderBase]: 2693/6386 cut-off events. [2025-02-06 12:58:52,292 INFO L125 PetriNetUnfolderBase]: For 394/399 co-relation queries the response was YES. [2025-02-06 12:58:52,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10985 conditions, 6386 events. 2693/6386 cut-off events. For 394/399 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 51389 event pairs, 2331 based on Foata normal form. 1/5561 useless extension candidates. Maximal degree in co-relation 9864. Up to 4269 conditions per place. [2025-02-06 12:58:52,324 INFO L140 encePairwiseOnDemand]: 132/137 looper letters, 54 selfloop transitions, 3 changer transitions 0/120 dead transitions. [2025-02-06 12:58:52,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 120 transitions, 378 flow [2025-02-06 12:58:52,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:58:52,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:58:52,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2025-02-06 12:58:52,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6472019464720195 [2025-02-06 12:58:52,326 INFO L175 Difference]: Start difference. First operand has 118 places, 117 transitions, 258 flow. Second operand 3 states and 266 transitions. [2025-02-06 12:58:52,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 120 transitions, 378 flow [2025-02-06 12:58:52,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 120 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:58:52,333 INFO L231 Difference]: Finished difference. Result has 119 places, 119 transitions, 275 flow [2025-02-06 12:58:52,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=275, PETRI_PLACES=119, PETRI_TRANSITIONS=119} [2025-02-06 12:58:52,334 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, -4 predicate places. [2025-02-06 12:58:52,334 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 119 transitions, 275 flow [2025-02-06 12:58:52,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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-02-06 12:58:52,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:52,334 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:58:52,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:58:52,335 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-02-06 12:58:52,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:52,335 INFO L85 PathProgramCache]: Analyzing trace with hash 129860877, now seen corresponding path program 1 times [2025-02-06 12:58:52,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:52,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644953368] [2025-02-06 12:58:52,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:52,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:52,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:58:52,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:58:52,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:52,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:52,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:52,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:52,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644953368] [2025-02-06 12:58:52,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644953368] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:52,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:52,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:58:52,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867493834] [2025-02-06 12:58:52,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:52,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:52,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:52,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:52,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:52,463 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 137 [2025-02-06 12:58:52,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 119 transitions, 275 flow. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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-02-06 12:58:52,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:52,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 137 [2025-02-06 12:58:52,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:53,111 INFO L124 PetriNetUnfolderBase]: 3416/8035 cut-off events. [2025-02-06 12:58:53,112 INFO L125 PetriNetUnfolderBase]: For 408/413 co-relation queries the response was YES. [2025-02-06 12:58:53,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13780 conditions, 8035 events. 3416/8035 cut-off events. For 408/413 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 66217 event pairs, 2538 based on Foata normal form. 0/6962 useless extension candidates. Maximal degree in co-relation 12688. Up to 4247 conditions per place. [2025-02-06 12:58:53,152 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 97 selfloop transitions, 5 changer transitions 0/163 dead transitions. [2025-02-06 12:58:53,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 163 transitions, 580 flow [2025-02-06 12:58:53,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:58:53,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:58:53,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2025-02-06 12:58:53,154 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7372262773722628 [2025-02-06 12:58:53,154 INFO L175 Difference]: Start difference. First operand has 119 places, 119 transitions, 275 flow. Second operand 3 states and 303 transitions. [2025-02-06 12:58:53,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 163 transitions, 580 flow [2025-02-06 12:58:53,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 163 transitions, 577 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:58:53,157 INFO L231 Difference]: Finished difference. Result has 122 places, 122 transitions, 308 flow [2025-02-06 12:58:53,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=122, PETRI_TRANSITIONS=122} [2025-02-06 12:58:53,158 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, -1 predicate places. [2025-02-06 12:58:53,158 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 122 transitions, 308 flow [2025-02-06 12:58:53,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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-02-06 12:58:53,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:53,159 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:58:53,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:58:53,159 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-02-06 12:58:53,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:53,159 INFO L85 PathProgramCache]: Analyzing trace with hash 129860878, now seen corresponding path program 1 times [2025-02-06 12:58:53,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:53,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120401535] [2025-02-06 12:58:53,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:53,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:53,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:58:53,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:58:53,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:53,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:53,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:53,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:53,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120401535] [2025-02-06 12:58:53,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120401535] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:53,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:53,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:58:53,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365283232] [2025-02-06 12:58:53,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:53,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:53,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:53,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:53,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:53,371 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 137 [2025-02-06 12:58:53,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 122 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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-02-06 12:58:53,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:53,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 137 [2025-02-06 12:58:53,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:54,065 INFO L124 PetriNetUnfolderBase]: 4199/9684 cut-off events. [2025-02-06 12:58:54,066 INFO L125 PetriNetUnfolderBase]: For 3043/3409 co-relation queries the response was YES. [2025-02-06 12:58:54,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18763 conditions, 9684 events. 4199/9684 cut-off events. For 3043/3409 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 83199 event pairs, 3011 based on Foata normal form. 582/9112 useless extension candidates. Maximal degree in co-relation 17641. Up to 5783 conditions per place. [2025-02-06 12:58:54,154 INFO L140 encePairwiseOnDemand]: 132/137 looper letters, 98 selfloop transitions, 5 changer transitions 0/166 dead transitions. [2025-02-06 12:58:54,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 166 transitions, 625 flow [2025-02-06 12:58:54,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:58:54,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:58:54,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2025-02-06 12:58:54,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7396593673965937 [2025-02-06 12:58:54,157 INFO L175 Difference]: Start difference. First operand has 122 places, 122 transitions, 308 flow. Second operand 3 states and 304 transitions. [2025-02-06 12:58:54,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 166 transitions, 625 flow [2025-02-06 12:58:54,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 166 transitions, 611 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:58:54,162 INFO L231 Difference]: Finished difference. Result has 123 places, 125 transitions, 335 flow [2025-02-06 12:58:54,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=335, PETRI_PLACES=123, PETRI_TRANSITIONS=125} [2025-02-06 12:58:54,162 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 0 predicate places. [2025-02-06 12:58:54,162 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 125 transitions, 335 flow [2025-02-06 12:58:54,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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-02-06 12:58:54,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:54,163 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:58:54,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:58:54,163 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-02-06 12:58:54,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:54,164 INFO L85 PathProgramCache]: Analyzing trace with hash -269382189, now seen corresponding path program 1 times [2025-02-06 12:58:54,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:54,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237459462] [2025-02-06 12:58:54,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:54,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:54,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:58:54,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:58:54,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:54,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:54,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:54,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:54,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237459462] [2025-02-06 12:58:54,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237459462] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:54,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:54,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:58:54,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234167232] [2025-02-06 12:58:54,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:54,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:58:54,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:54,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:58:54,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:58:54,385 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 137 [2025-02-06 12:58:54,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 125 transitions, 335 flow. Second operand has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 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-02-06 12:58:54,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:54,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 137 [2025-02-06 12:58:54,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:54,850 INFO L124 PetriNetUnfolderBase]: 2432/5809 cut-off events. [2025-02-06 12:58:54,850 INFO L125 PetriNetUnfolderBase]: For 1476/2239 co-relation queries the response was YES. [2025-02-06 12:58:54,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10600 conditions, 5809 events. 2432/5809 cut-off events. For 1476/2239 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 46558 event pairs, 2165 based on Foata normal form. 55/5096 useless extension candidates. Maximal degree in co-relation 10353. Up to 3870 conditions per place. [2025-02-06 12:58:54,878 INFO L140 encePairwiseOnDemand]: 132/137 looper letters, 61 selfloop transitions, 4 changer transitions 0/128 dead transitions. [2025-02-06 12:58:54,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 128 transitions, 466 flow [2025-02-06 12:58:54,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:58:54,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:58:54,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 335 transitions. [2025-02-06 12:58:54,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6113138686131386 [2025-02-06 12:58:54,880 INFO L175 Difference]: Start difference. First operand has 123 places, 125 transitions, 335 flow. Second operand 4 states and 335 transitions. [2025-02-06 12:58:54,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 128 transitions, 466 flow [2025-02-06 12:58:54,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 128 transitions, 462 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:58:54,885 INFO L231 Difference]: Finished difference. Result has 126 places, 124 transitions, 338 flow [2025-02-06 12:58:54,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=338, PETRI_PLACES=126, PETRI_TRANSITIONS=124} [2025-02-06 12:58:54,886 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 3 predicate places. [2025-02-06 12:58:54,887 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 124 transitions, 338 flow [2025-02-06 12:58:54,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 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-02-06 12:58:54,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:54,887 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:58:54,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:58:54,887 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-02-06 12:58:54,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:54,888 INFO L85 PathProgramCache]: Analyzing trace with hash 242167547, now seen corresponding path program 1 times [2025-02-06 12:58:54,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:54,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018146796] [2025-02-06 12:58:54,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:54,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:54,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 12:58:54,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 12:58:54,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:54,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:55,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:55,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:55,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018146796] [2025-02-06 12:58:55,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018146796] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:55,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:55,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:58:55,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697741780] [2025-02-06 12:58:55,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:55,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:58:55,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:55,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:58:55,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:58:55,189 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 137 [2025-02-06 12:58:55,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 124 transitions, 338 flow. Second operand has 5 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 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-02-06 12:58:55,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:55,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 137 [2025-02-06 12:58:55,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:55,748 INFO L124 PetriNetUnfolderBase]: 2789/6606 cut-off events. [2025-02-06 12:58:55,748 INFO L125 PetriNetUnfolderBase]: For 1630/2478 co-relation queries the response was YES. [2025-02-06 12:58:55,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12050 conditions, 6606 events. 2789/6606 cut-off events. For 1630/2478 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 54442 event pairs, 2484 based on Foata normal form. 65/5855 useless extension candidates. Maximal degree in co-relation 11780. Up to 4402 conditions per place. [2025-02-06 12:58:55,778 INFO L140 encePairwiseOnDemand]: 132/137 looper letters, 72 selfloop transitions, 4 changer transitions 0/138 dead transitions. [2025-02-06 12:58:55,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 138 transitions, 526 flow [2025-02-06 12:58:55,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:58:55,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:58:55,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 333 transitions. [2025-02-06 12:58:55,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6076642335766423 [2025-02-06 12:58:55,783 INFO L175 Difference]: Start difference. First operand has 126 places, 124 transitions, 338 flow. Second operand 4 states and 333 transitions. [2025-02-06 12:58:55,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 138 transitions, 526 flow [2025-02-06 12:58:55,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 138 transitions, 518 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 12:58:55,786 INFO L231 Difference]: Finished difference. Result has 128 places, 124 transitions, 347 flow [2025-02-06 12:58:55,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=347, PETRI_PLACES=128, PETRI_TRANSITIONS=124} [2025-02-06 12:58:55,787 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 5 predicate places. [2025-02-06 12:58:55,787 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 124 transitions, 347 flow [2025-02-06 12:58:55,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 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-02-06 12:58:55,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:55,787 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:58:55,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:58:55,787 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-02-06 12:58:55,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:55,787 INFO L85 PathProgramCache]: Analyzing trace with hash 239090177, now seen corresponding path program 2 times [2025-02-06 12:58:55,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:55,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029083252] [2025-02-06 12:58:55,788 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:58:55,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:55,798 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 1 equivalence classes. [2025-02-06 12:58:55,804 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 12:58:55,804 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:58:55,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:55,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:55,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:55,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029083252] [2025-02-06 12:58:55,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029083252] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:55,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:55,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:58:55,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871002771] [2025-02-06 12:58:55,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:55,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:58:55,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:55,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:58:55,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:58:56,138 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 137 [2025-02-06 12:58:56,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 124 transitions, 347 flow. Second operand has 6 states, 6 states have (on average 66.5) internal successors, (399), 6 states have internal predecessors, (399), 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-02-06 12:58:56,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:56,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 137 [2025-02-06 12:58:56,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:56,189 INFO L124 PetriNetUnfolderBase]: 27/141 cut-off events. [2025-02-06 12:58:56,190 INFO L125 PetriNetUnfolderBase]: For 161/165 co-relation queries the response was YES. [2025-02-06 12:58:56,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 141 events. 27/141 cut-off events. For 161/165 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 668 event pairs, 18 based on Foata normal form. 12/121 useless extension candidates. Maximal degree in co-relation 272. Up to 66 conditions per place. [2025-02-06 12:58:56,191 INFO L140 encePairwiseOnDemand]: 133/137 looper letters, 18 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2025-02-06 12:58:56,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 33 transitions, 153 flow [2025-02-06 12:58:56,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:58:56,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:58:56,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 282 transitions. [2025-02-06 12:58:56,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5145985401459854 [2025-02-06 12:58:56,192 INFO L175 Difference]: Start difference. First operand has 128 places, 124 transitions, 347 flow. Second operand 4 states and 282 transitions. [2025-02-06 12:58:56,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 33 transitions, 153 flow [2025-02-06 12:58:56,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 33 transitions, 122 flow, removed 1 selfloop flow, removed 9 redundant places. [2025-02-06 12:58:56,193 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 72 flow [2025-02-06 12:58:56,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2025-02-06 12:58:56,194 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, -89 predicate places. [2025-02-06 12:58:56,195 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 72 flow [2025-02-06 12:58:56,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 66.5) internal successors, (399), 6 states have internal predecessors, (399), 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-02-06 12:58:56,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:56,195 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 12:58:56,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:58:56,196 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-02-06 12:58:56,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:56,196 INFO L85 PathProgramCache]: Analyzing trace with hash 239087345, now seen corresponding path program 1 times [2025-02-06 12:58:56,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:56,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839619485] [2025-02-06 12:58:56,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:56,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:56,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 12:58:56,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 12:58:56,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:56,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:58:56,222 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:58:56,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 12:58:56,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 12:58:56,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:56,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:58:56,259 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:58:56,259 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:58:56,260 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (64 of 65 remaining) [2025-02-06 12:58:56,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 65 remaining) [2025-02-06 12:58:56,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 65 remaining) [2025-02-06 12:58:56,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 65 remaining) [2025-02-06 12:58:56,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 65 remaining) [2025-02-06 12:58:56,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 65 remaining) [2025-02-06 12:58:56,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 65 remaining) [2025-02-06 12:58:56,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 65 remaining) [2025-02-06 12:58:56,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 65 remaining) [2025-02-06 12:58:56,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 65 remaining) [2025-02-06 12:58:56,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 65 remaining) [2025-02-06 12:58:56,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 65 remaining) [2025-02-06 12:58:56,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 65 remaining) [2025-02-06 12:58:56,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 65 remaining) [2025-02-06 12:58:56,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 65 remaining) [2025-02-06 12:58:56,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr8ASSERT_VIOLATIONMEMORY_LEAK (49 of 65 remaining) [2025-02-06 12:58:56,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 65 remaining) [2025-02-06 12:58:56,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 65 remaining) [2025-02-06 12:58:56,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 65 remaining) [2025-02-06 12:58:56,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 65 remaining) [2025-02-06 12:58:56,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 65 remaining) [2025-02-06 12:58:56,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 65 remaining) [2025-02-06 12:58:56,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 65 remaining) [2025-02-06 12:58:56,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 65 remaining) [2025-02-06 12:58:56,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 65 remaining) [2025-02-06 12:58:56,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 65 remaining) [2025-02-06 12:58:56,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 65 remaining) [2025-02-06 12:58:56,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 65 remaining) [2025-02-06 12:58:56,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (36 of 65 remaining) [2025-02-06 12:58:56,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 65 remaining) [2025-02-06 12:58:56,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 65 remaining) [2025-02-06 12:58:56,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 65 remaining) [2025-02-06 12:58:56,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 65 remaining) [2025-02-06 12:58:56,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 65 remaining) [2025-02-06 12:58:56,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 65 remaining) [2025-02-06 12:58:56,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 65 remaining) [2025-02-06 12:58:56,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 65 remaining) [2025-02-06 12:58:56,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 65 remaining) [2025-02-06 12:58:56,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 65 remaining) [2025-02-06 12:58:56,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 65 remaining) [2025-02-06 12:58:56,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 65 remaining) [2025-02-06 12:58:56,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 65 remaining) [2025-02-06 12:58:56,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 65 remaining) [2025-02-06 12:58:56,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 65 remaining) [2025-02-06 12:58:56,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 65 remaining) [2025-02-06 12:58:56,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 65 remaining) [2025-02-06 12:58:56,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 65 remaining) [2025-02-06 12:58:56,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 65 remaining) [2025-02-06 12:58:56,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 65 remaining) [2025-02-06 12:58:56,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 65 remaining) [2025-02-06 12:58:56,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 65 remaining) [2025-02-06 12:58:56,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 65 remaining) [2025-02-06 12:58:56,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 65 remaining) [2025-02-06 12:58:56,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 65 remaining) [2025-02-06 12:58:56,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr8ASSERT_VIOLATIONMEMORY_LEAK (10 of 65 remaining) [2025-02-06 12:58:56,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 65 remaining) [2025-02-06 12:58:56,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 65 remaining) [2025-02-06 12:58:56,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 65 remaining) [2025-02-06 12:58:56,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 65 remaining) [2025-02-06 12:58:56,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 65 remaining) [2025-02-06 12:58:56,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 65 remaining) [2025-02-06 12:58:56,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 65 remaining) [2025-02-06 12:58:56,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 65 remaining) [2025-02-06 12:58:56,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 65 remaining) [2025-02-06 12:58:56,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 65 remaining) [2025-02-06 12:58:56,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:58:56,267 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:58:56,269 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:58:56,269 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 12:58:56,326 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-02-06 12:58:56,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 239 transitions, 522 flow [2025-02-06 12:58:56,386 INFO L124 PetriNetUnfolderBase]: 147/869 cut-off events. [2025-02-06 12:58:56,387 INFO L125 PetriNetUnfolderBase]: For 72/88 co-relation queries the response was YES. [2025-02-06 12:58:56,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 869 events. 147/869 cut-off events. For 72/88 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 6400 event pairs, 2 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 549. Up to 32 conditions per place. [2025-02-06 12:58:56,393 INFO L82 GeneralOperation]: Start removeDead. Operand has 210 places, 239 transitions, 522 flow [2025-02-06 12:58:56,401 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 210 places, 239 transitions, 522 flow [2025-02-06 12:58:56,402 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:58:56,402 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;@5d8b5310, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:58:56,402 INFO L334 AbstractCegarLoop]: Starting to check reachability of 90 error locations. [2025-02-06 12:58:56,403 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:58:56,403 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-02-06 12:58:56,403 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:58:56,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:56,403 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-02-06 12:58:56,404 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-02-06 12:58:56,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:56,404 INFO L85 PathProgramCache]: Analyzing trace with hash 26306, now seen corresponding path program 1 times [2025-02-06 12:58:56,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:56,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896276371] [2025-02-06 12:58:56,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:56,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:56,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 12:58:56,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 12:58:56,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:56,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:56,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:58:56,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:56,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896276371] [2025-02-06 12:58:56,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896276371] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:56,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:56,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:58:56,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117344294] [2025-02-06 12:58:56,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:56,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:56,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:56,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:56,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:56,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 239 [2025-02-06 12:58:56,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 239 transitions, 522 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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-02-06 12:58:56,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:56,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 239 [2025-02-06 12:58:56,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand