./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_81-list_racing.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_81-list_racing.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 3de6ec2acea23c0ab47fbc2e02ad0931145060ca78b80531ef692b3505f9553b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:58:38,893 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:58:38,944 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:38,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:58:38,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:58:38,965 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:58:38,965 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:58:38,966 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:58:38,966 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:58:38,966 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:58:38,966 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:58:38,966 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:58:38,966 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:58:38,966 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:58:38,967 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:58:38,967 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:58:38,967 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:58:38,967 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:58:38,967 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:58:38,967 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:58:38,967 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:58:38,967 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:58:38,967 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:58:38,967 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:58:38,967 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:58:38,968 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:58:38,968 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:58:38,968 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:58:38,968 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:58:38,968 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:58:38,968 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:58:38,968 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:58:38,968 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:58:38,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:58:38,968 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:58:38,968 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:58:38,968 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:58:38,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:58:38,968 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:58:38,968 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:58:38,968 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:58:38,968 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:58:38,968 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 -> 3de6ec2acea23c0ab47fbc2e02ad0931145060ca78b80531ef692b3505f9553b [2025-02-06 12:58:39,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:58:39,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:58:39,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:58:39,222 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:58:39,222 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:58:39,224 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_81-list_racing.i [2025-02-06 12:58:40,416 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b0bcf272/f08a1c09115d40b98bcb0de43b18e262/FLAG753668289 [2025-02-06 12:58:40,700 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:58:40,702 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_81-list_racing.i [2025-02-06 12:58:40,714 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b0bcf272/f08a1c09115d40b98bcb0de43b18e262/FLAG753668289 [2025-02-06 12:58:40,729 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b0bcf272/f08a1c09115d40b98bcb0de43b18e262 [2025-02-06 12:58:40,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:58:40,733 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:58:40,735 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:58:40,735 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:58:40,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:58:40,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:58:40" (1/1) ... [2025-02-06 12:58:40,739 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@466d4831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:40, skipping insertion in model container [2025-02-06 12:58:40,739 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:58:40" (1/1) ... [2025-02-06 12:58:40,775 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:58:41,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:58:41,164 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:58:41,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:58:41,253 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:58:41,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:41 WrapperNode [2025-02-06 12:58:41,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:58:41,255 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:58:41,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:58:41,255 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:58:41,259 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:41" (1/1) ... [2025-02-06 12:58:41,269 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:41" (1/1) ... [2025-02-06 12:58:41,289 INFO L138 Inliner]: procedures = 279, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 248 [2025-02-06 12:58:41,290 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:58:41,290 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:58:41,290 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:58:41,290 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:58:41,297 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:41" (1/1) ... [2025-02-06 12:58:41,297 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:41" (1/1) ... [2025-02-06 12:58:41,300 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:41" (1/1) ... [2025-02-06 12:58:41,319 INFO L175 MemorySlicer]: Split 30 memory accesses to 6 slices as follows [2, 5, 5, 14, 2, 2]. 47 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5, 0, 0, 0]. The 10 writes are split as follows [0, 0, 0, 8, 1, 1]. [2025-02-06 12:58:41,319 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:41" (1/1) ... [2025-02-06 12:58:41,322 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:41" (1/1) ... [2025-02-06 12:58:41,332 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:41" (1/1) ... [2025-02-06 12:58:41,333 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:41" (1/1) ... [2025-02-06 12:58:41,335 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:41" (1/1) ... [2025-02-06 12:58:41,336 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:41" (1/1) ... [2025-02-06 12:58:41,340 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:58:41,341 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:58:41,341 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:58:41,341 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:58:41,342 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:41" (1/1) ... [2025-02-06 12:58:41,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:58:41,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:58:41,368 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:41,371 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:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 12:58:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 12:58:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 12:58:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 12:58:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 12:58:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 12:58:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 12:58:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure t1_fun [2025-02-06 12:58:41,390 INFO L138 BoogieDeclarations]: Found implementation of procedure t1_fun [2025-02-06 12:58:41,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 12:58:41,390 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 12:58:41,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:58:41,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:58:41,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 12:58:41,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 12:58:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 12:58:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 12:58:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-02-06 12:58:41,391 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-02-06 12:58:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:58:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:58:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 12:58:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 12:58:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 12:58:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 12:58:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 12:58:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 12:58:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:58:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 12:58:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 12:58:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 12:58:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 12:58:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 12:58:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 12:58:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:58:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:58:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 12:58:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 12:58:41,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 12:58:41,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 12:58:41,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:58:41,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:58:41,393 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:41,544 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:58:41,546 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:58:41,928 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1043: havoc main_~#t2_ids~0#1.base, main_~#t2_ids~0#1.offset; [2025-02-06 12:58:41,928 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1043-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:41,928 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1042: havoc main_~#t1_ids~0#1.base, main_~#t1_ids~0#1.offset; [2025-02-06 12:58:41,928 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1042-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:41,929 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:58:41,929 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:58:42,118 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:58:42,118 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:58:42,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:58:42 BoogieIcfgContainer [2025-02-06 12:58:42,120 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:58:42,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:58:42,122 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:58:42,125 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:58:42,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:58:40" (1/3) ... [2025-02-06 12:58:42,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb4e558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:58:42, skipping insertion in model container [2025-02-06 12:58:42,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:58:41" (2/3) ... [2025-02-06 12:58:42,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb4e558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:58:42, skipping insertion in model container [2025-02-06 12:58:42,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:58:42" (3/3) ... [2025-02-06 12:58:42,127 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_81-list_racing.i [2025-02-06 12:58:42,139 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:58:42,140 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_81-list_racing.i that has 3 procedures, 114 locations, 1 initial locations, 10 loop locations, and 38 error locations. [2025-02-06 12:58:42,142 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:58:42,221 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-06 12:58:42,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 134 transitions, 288 flow [2025-02-06 12:58:42,347 INFO L124 PetriNetUnfolderBase]: 38/274 cut-off events. [2025-02-06 12:58:42,349 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-06 12:58:42,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291 conditions, 274 events. 38/274 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1433 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 144. Up to 8 conditions per place. [2025-02-06 12:58:42,355 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 134 transitions, 288 flow [2025-02-06 12:58:42,361 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 134 transitions, 288 flow [2025-02-06 12:58:42,370 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:58:42,385 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;@37a18e28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:58:42,386 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2025-02-06 12:58:42,389 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:58:42,390 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-02-06 12:58:42,390 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:58:42,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:42,390 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-02-06 12:58:42,391 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:42,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:42,395 INFO L85 PathProgramCache]: Analyzing trace with hash 21481, now seen corresponding path program 1 times [2025-02-06 12:58:42,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:42,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011797920] [2025-02-06 12:58:42,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:42,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:42,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 12:58:42,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 12:58:42,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:42,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:42,707 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:42,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:42,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011797920] [2025-02-06 12:58:42,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011797920] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:42,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:42,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:58:42,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538714874] [2025-02-06 12:58:42,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:42,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:42,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:42,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:42,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:42,811 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 134 [2025-02-06 12:58:42,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 134 transitions, 288 flow. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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:42,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:42,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 134 [2025-02-06 12:58:42,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:43,500 INFO L124 PetriNetUnfolderBase]: 2588/6364 cut-off events. [2025-02-06 12:58:43,501 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2025-02-06 12:58:43,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10583 conditions, 6364 events. 2588/6364 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 52480 event pairs, 2402 based on Foata normal form. 696/6114 useless extension candidates. Maximal degree in co-relation 9199. Up to 4126 conditions per place. [2025-02-06 12:58:43,548 INFO L140 encePairwiseOnDemand]: 117/134 looper letters, 50 selfloop transitions, 2 changer transitions 0/118 dead transitions. [2025-02-06 12:58:43,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 118 transitions, 360 flow [2025-02-06 12:58:43,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:58:43,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:58:43,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2025-02-06 12:58:43,562 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6592039800995025 [2025-02-06 12:58:43,563 INFO L175 Difference]: Start difference. First operand has 120 places, 134 transitions, 288 flow. Second operand 3 states and 265 transitions. [2025-02-06 12:58:43,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 118 transitions, 360 flow [2025-02-06 12:58:43,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 118 transitions, 360 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:58:43,576 INFO L231 Difference]: Finished difference. Result has 119 places, 118 transitions, 260 flow [2025-02-06 12:58:43,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=119, PETRI_TRANSITIONS=118} [2025-02-06 12:58:43,581 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, -1 predicate places. [2025-02-06 12:58:43,581 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 118 transitions, 260 flow [2025-02-06 12:58:43,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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:43,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:43,582 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-02-06 12:58:43,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:58:43,582 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:43,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:43,583 INFO L85 PathProgramCache]: Analyzing trace with hash 21482, now seen corresponding path program 1 times [2025-02-06 12:58:43,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:43,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055586137] [2025-02-06 12:58:43,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:43,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:43,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 12:58:43,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 12:58:43,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:43,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:43,778 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:43,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:43,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055586137] [2025-02-06 12:58:43,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055586137] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:43,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:43,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:58:43,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165372666] [2025-02-06 12:58:43,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:43,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:43,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:43,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:43,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:43,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 134 [2025-02-06 12:58:43,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 118 transitions, 260 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:43,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:43,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 134 [2025-02-06 12:58:43,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:44,357 INFO L124 PetriNetUnfolderBase]: 2588/6362 cut-off events. [2025-02-06 12:58:44,358 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2025-02-06 12:58:44,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10583 conditions, 6362 events. 2588/6362 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 52466 event pairs, 2402 based on Foata normal form. 2/5418 useless extension candidates. Maximal degree in co-relation 10571. Up to 4126 conditions per place. [2025-02-06 12:58:44,390 INFO L140 encePairwiseOnDemand]: 130/134 looper letters, 49 selfloop transitions, 2 changer transitions 0/116 dead transitions. [2025-02-06 12:58:44,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 116 transitions, 358 flow [2025-02-06 12:58:44,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:58:44,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:58:44,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2025-02-06 12:58:44,392 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6318407960199005 [2025-02-06 12:58:44,393 INFO L175 Difference]: Start difference. First operand has 119 places, 118 transitions, 260 flow. Second operand 3 states and 254 transitions. [2025-02-06 12:58:44,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 116 transitions, 358 flow [2025-02-06 12:58:44,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 116 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:58:44,397 INFO L231 Difference]: Finished difference. Result has 117 places, 116 transitions, 256 flow [2025-02-06 12:58:44,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=117, PETRI_TRANSITIONS=116} [2025-02-06 12:58:44,398 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, -3 predicate places. [2025-02-06 12:58:44,398 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 116 transitions, 256 flow [2025-02-06 12:58:44,399 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:44,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:44,399 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:58:44,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:58:44,399 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:44,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:44,400 INFO L85 PathProgramCache]: Analyzing trace with hash 640518419, now seen corresponding path program 1 times [2025-02-06 12:58:44,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:44,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912888486] [2025-02-06 12:58:44,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:44,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:44,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:58:44,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:58:44,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:44,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:44,470 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:44,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:44,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912888486] [2025-02-06 12:58:44,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912888486] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:44,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:44,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:58:44,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425902204] [2025-02-06 12:58:44,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:44,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:44,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:44,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:44,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:44,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 134 [2025-02-06 12:58:44,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 116 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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:44,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:44,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 134 [2025-02-06 12:58:44,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:45,082 INFO L124 PetriNetUnfolderBase]: 2956/6860 cut-off events. [2025-02-06 12:58:45,083 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2025-02-06 12:58:45,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11681 conditions, 6860 events. 2956/6860 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 57007 event pairs, 2046 based on Foata normal form. 0/5962 useless extension candidates. Maximal degree in co-relation 11669. Up to 3553 conditions per place. [2025-02-06 12:58:45,123 INFO L140 encePairwiseOnDemand]: 130/134 looper letters, 83 selfloop transitions, 2 changer transitions 0/146 dead transitions. [2025-02-06 12:58:45,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 146 transitions, 486 flow [2025-02-06 12:58:45,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:58:45,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:58:45,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions. [2025-02-06 12:58:45,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7014925373134329 [2025-02-06 12:58:45,125 INFO L175 Difference]: Start difference. First operand has 117 places, 116 transitions, 256 flow. Second operand 3 states and 282 transitions. [2025-02-06 12:58:45,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 146 transitions, 486 flow [2025-02-06 12:58:45,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 146 transitions, 482 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:58:45,130 INFO L231 Difference]: Finished difference. Result has 115 places, 114 transitions, 252 flow [2025-02-06 12:58:45,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=115, PETRI_TRANSITIONS=114} [2025-02-06 12:58:45,131 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, -5 predicate places. [2025-02-06 12:58:45,131 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 114 transitions, 252 flow [2025-02-06 12:58:45,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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:45,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:45,132 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:58:45,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:58:45,132 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:45,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:45,133 INFO L85 PathProgramCache]: Analyzing trace with hash 640518420, now seen corresponding path program 1 times [2025-02-06 12:58:45,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:45,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518087889] [2025-02-06 12:58:45,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:45,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:45,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:58:45,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:58:45,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:45,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:45,251 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:45,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:45,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518087889] [2025-02-06 12:58:45,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518087889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:45,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:45,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:58:45,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078231853] [2025-02-06 12:58:45,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:45,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:45,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:45,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:45,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:45,299 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 134 [2025-02-06 12:58:45,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 114 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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:45,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:45,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 134 [2025-02-06 12:58:45,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:45,837 INFO L124 PetriNetUnfolderBase]: 2511/6032 cut-off events. [2025-02-06 12:58:45,837 INFO L125 PetriNetUnfolderBase]: For 360/365 co-relation queries the response was YES. [2025-02-06 12:58:45,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10319 conditions, 6032 events. 2511/6032 cut-off events. For 360/365 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 49111 event pairs, 2165 based on Foata normal form. 1/5212 useless extension candidates. Maximal degree in co-relation 9269. Up to 3977 conditions per place. [2025-02-06 12:58:45,950 INFO L140 encePairwiseOnDemand]: 129/134 looper letters, 52 selfloop transitions, 3 changer transitions 0/117 dead transitions. [2025-02-06 12:58:45,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 117 transitions, 368 flow [2025-02-06 12:58:45,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:58:45,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:58:45,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2025-02-06 12:58:45,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6492537313432836 [2025-02-06 12:58:45,956 INFO L175 Difference]: Start difference. First operand has 115 places, 114 transitions, 252 flow. Second operand 3 states and 261 transitions. [2025-02-06 12:58:45,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 117 transitions, 368 flow [2025-02-06 12:58:45,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 117 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:58:45,964 INFO L231 Difference]: Finished difference. Result has 116 places, 116 transitions, 269 flow [2025-02-06 12:58:45,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=269, PETRI_PLACES=116, PETRI_TRANSITIONS=116} [2025-02-06 12:58:45,965 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, -4 predicate places. [2025-02-06 12:58:45,965 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 116 transitions, 269 flow [2025-02-06 12:58:45,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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:45,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:45,965 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:58:45,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:58:45,965 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:45,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:45,966 INFO L85 PathProgramCache]: Analyzing trace with hash -854755452, now seen corresponding path program 1 times [2025-02-06 12:58:45,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:45,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032960908] [2025-02-06 12:58:45,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:45,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:45,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:58:45,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:58:45,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:45,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:46,068 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:46,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:46,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032960908] [2025-02-06 12:58:46,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032960908] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:46,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:46,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:58:46,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763586534] [2025-02-06 12:58:46,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:46,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:46,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:46,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:46,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:46,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 134 [2025-02-06 12:58:46,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 116 transitions, 269 flow. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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:46,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:46,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 134 [2025-02-06 12:58:46,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:46,682 INFO L124 PetriNetUnfolderBase]: 3174/7489 cut-off events. [2025-02-06 12:58:46,682 INFO L125 PetriNetUnfolderBase]: For 387/391 co-relation queries the response was YES. [2025-02-06 12:58:46,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12843 conditions, 7489 events. 3174/7489 cut-off events. For 387/391 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 62708 event pairs, 2260 based on Foata normal form. 0/6500 useless extension candidates. Maximal degree in co-relation 12772. Up to 3955 conditions per place. [2025-02-06 12:58:46,716 INFO L140 encePairwiseOnDemand]: 128/134 looper letters, 93 selfloop transitions, 5 changer transitions 0/158 dead transitions. [2025-02-06 12:58:46,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 158 transitions, 562 flow [2025-02-06 12:58:46,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:58:46,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:58:46,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2025-02-06 12:58:46,718 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.736318407960199 [2025-02-06 12:58:46,718 INFO L175 Difference]: Start difference. First operand has 116 places, 116 transitions, 269 flow. Second operand 3 states and 296 transitions. [2025-02-06 12:58:46,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 158 transitions, 562 flow [2025-02-06 12:58:46,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 158 transitions, 559 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:58:46,723 INFO L231 Difference]: Finished difference. Result has 119 places, 119 transitions, 302 flow [2025-02-06 12:58:46,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=302, PETRI_PLACES=119, PETRI_TRANSITIONS=119} [2025-02-06 12:58:46,724 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, -1 predicate places. [2025-02-06 12:58:46,724 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 119 transitions, 302 flow [2025-02-06 12:58:46,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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:46,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:46,725 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:58:46,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:58:46,725 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:46,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:46,725 INFO L85 PathProgramCache]: Analyzing trace with hash -854755451, now seen corresponding path program 1 times [2025-02-06 12:58:46,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:46,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431351634] [2025-02-06 12:58:46,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:46,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:46,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:58:46,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:58:46,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:46,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:46,845 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:46,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:46,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431351634] [2025-02-06 12:58:46,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431351634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:46,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:46,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:58:46,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833700538] [2025-02-06 12:58:46,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:46,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:46,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:46,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:46,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:46,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 134 [2025-02-06 12:58:46,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 119 transitions, 302 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:46,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:46,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 134 [2025-02-06 12:58:46,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:47,431 INFO L124 PetriNetUnfolderBase]: 3900/9180 cut-off events. [2025-02-06 12:58:47,431 INFO L125 PetriNetUnfolderBase]: For 3121/3610 co-relation queries the response was YES. [2025-02-06 12:58:47,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17449 conditions, 9180 events. 3900/9180 cut-off events. For 3121/3610 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 79735 event pairs, 2858 based on Foata normal form. 543/8517 useless extension candidates. Maximal degree in co-relation 16398. Up to 5385 conditions per place. [2025-02-06 12:58:47,474 INFO L140 encePairwiseOnDemand]: 129/134 looper letters, 94 selfloop transitions, 5 changer transitions 0/161 dead transitions. [2025-02-06 12:58:47,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 161 transitions, 607 flow [2025-02-06 12:58:47,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:58:47,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:58:47,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2025-02-06 12:58:47,476 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7388059701492538 [2025-02-06 12:58:47,476 INFO L175 Difference]: Start difference. First operand has 119 places, 119 transitions, 302 flow. Second operand 3 states and 297 transitions. [2025-02-06 12:58:47,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 161 transitions, 607 flow [2025-02-06 12:58:47,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 161 transitions, 593 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:58:47,482 INFO L231 Difference]: Finished difference. Result has 120 places, 122 transitions, 329 flow [2025-02-06 12:58:47,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=117, 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=329, PETRI_PLACES=120, PETRI_TRANSITIONS=122} [2025-02-06 12:58:47,483 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 0 predicate places. [2025-02-06 12:58:47,483 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 122 transitions, 329 flow [2025-02-06 12:58:47,483 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:47,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:47,483 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:58:47,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:58:47,483 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:47,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:47,484 INFO L85 PathProgramCache]: Analyzing trace with hash -727712653, now seen corresponding path program 1 times [2025-02-06 12:58:47,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:47,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803850795] [2025-02-06 12:58:47,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:47,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:47,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:58:47,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:58:47,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:47,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:47,609 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:47,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:47,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803850795] [2025-02-06 12:58:47,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803850795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:47,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:47,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:58:47,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639594251] [2025-02-06 12:58:47,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:47,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:58:47,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:47,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:58:47,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:58:47,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 134 [2025-02-06 12:58:47,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 122 transitions, 329 flow. Second operand has 5 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 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:47,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:47,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 134 [2025-02-06 12:58:47,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:48,143 INFO L124 PetriNetUnfolderBase]: 2268/5473 cut-off events. [2025-02-06 12:58:48,144 INFO L125 PetriNetUnfolderBase]: For 1377/2091 co-relation queries the response was YES. [2025-02-06 12:58:48,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9944 conditions, 5473 events. 2268/5473 cut-off events. For 1377/2091 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 44470 event pairs, 1880 based on Foata normal form. 52/4773 useless extension candidates. Maximal degree in co-relation 8875. Up to 3606 conditions per place. [2025-02-06 12:58:48,171 INFO L140 encePairwiseOnDemand]: 129/134 looper letters, 59 selfloop transitions, 4 changer transitions 0/125 dead transitions. [2025-02-06 12:58:48,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 125 transitions, 456 flow [2025-02-06 12:58:48,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:58:48,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:58:48,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 329 transitions. [2025-02-06 12:58:48,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6138059701492538 [2025-02-06 12:58:48,173 INFO L175 Difference]: Start difference. First operand has 120 places, 122 transitions, 329 flow. Second operand 4 states and 329 transitions. [2025-02-06 12:58:48,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 125 transitions, 456 flow [2025-02-06 12:58:48,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 125 transitions, 452 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:58:48,176 INFO L231 Difference]: Finished difference. Result has 123 places, 121 transitions, 332 flow [2025-02-06 12:58:48,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=332, PETRI_PLACES=123, PETRI_TRANSITIONS=121} [2025-02-06 12:58:48,177 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 3 predicate places. [2025-02-06 12:58:48,177 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 121 transitions, 332 flow [2025-02-06 12:58:48,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 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:48,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:48,178 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:58:48,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:58:48,178 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-02-06 12:58:48,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:48,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1081312133, now seen corresponding path program 1 times [2025-02-06 12:58:48,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:48,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547027028] [2025-02-06 12:58:48,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:48,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:48,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 12:58:48,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 12:58:48,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:48,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:48,250 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:48,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:48,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547027028] [2025-02-06 12:58:48,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547027028] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:48,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:48,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:58:48,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635930858] [2025-02-06 12:58:48,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:48,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:58:48,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:48,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:58:48,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:58:48,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 134 [2025-02-06 12:58:48,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 121 transitions, 332 flow. Second operand has 4 states, 4 states have (on average 70.75) internal successors, (283), 4 states have internal predecessors, (283), 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:48,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:48,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 134 [2025-02-06 12:58:48,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:58:48,293 INFO L124 PetriNetUnfolderBase]: 12/71 cut-off events. [2025-02-06 12:58:48,293 INFO L125 PetriNetUnfolderBase]: For 61/63 co-relation queries the response was YES. [2025-02-06 12:58:48,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 71 events. 12/71 cut-off events. For 61/63 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 221 event pairs, 3 based on Foata normal form. 6/64 useless extension candidates. Maximal degree in co-relation 146. Up to 26 conditions per place. [2025-02-06 12:58:48,293 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 16 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2025-02-06 12:58:48,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 33 transitions, 150 flow [2025-02-06 12:58:48,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:58:48,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:58:48,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 295 transitions. [2025-02-06 12:58:48,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5503731343283582 [2025-02-06 12:58:48,295 INFO L175 Difference]: Start difference. First operand has 123 places, 121 transitions, 332 flow. Second operand 4 states and 295 transitions. [2025-02-06 12:58:48,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 33 transitions, 150 flow [2025-02-06 12:58:48,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 33 transitions, 124 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-02-06 12:58:48,295 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 80 flow [2025-02-06 12:58:48,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2025-02-06 12:58:48,296 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, -84 predicate places. [2025-02-06 12:58:48,296 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 80 flow [2025-02-06 12:58:48,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.75) internal successors, (283), 4 states have internal predecessors, (283), 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:48,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:48,296 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 12:58:48,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:58:48,296 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-02-06 12:58:48,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:48,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1084255070, now seen corresponding path program 1 times [2025-02-06 12:58:48,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:48,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748794842] [2025-02-06 12:58:48,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:48,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:48,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 12:58:48,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 12:58:48,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:48,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:58:48,338 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:58:48,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 12:58:48,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 12:58:48,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:48,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:58:48,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:58:48,384 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:58:48,384 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (64 of 65 remaining) [2025-02-06 12:58:48,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 65 remaining) [2025-02-06 12:58:48,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 65 remaining) [2025-02-06 12:58:48,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 65 remaining) [2025-02-06 12:58:48,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 65 remaining) [2025-02-06 12:58:48,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 65 remaining) [2025-02-06 12:58:48,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 65 remaining) [2025-02-06 12:58:48,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 65 remaining) [2025-02-06 12:58:48,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 65 remaining) [2025-02-06 12:58:48,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 65 remaining) [2025-02-06 12:58:48,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 65 remaining) [2025-02-06 12:58:48,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 65 remaining) [2025-02-06 12:58:48,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 65 remaining) [2025-02-06 12:58:48,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 65 remaining) [2025-02-06 12:58:48,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 65 remaining) [2025-02-06 12:58:48,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr8ASSERT_VIOLATIONMEMORY_LEAK (49 of 65 remaining) [2025-02-06 12:58:48,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 65 remaining) [2025-02-06 12:58:48,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 65 remaining) [2025-02-06 12:58:48,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 65 remaining) [2025-02-06 12:58:48,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 65 remaining) [2025-02-06 12:58:48,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 65 remaining) [2025-02-06 12:58:48,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 65 remaining) [2025-02-06 12:58:48,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 65 remaining) [2025-02-06 12:58:48,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 65 remaining) [2025-02-06 12:58:48,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 65 remaining) [2025-02-06 12:58:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 65 remaining) [2025-02-06 12:58:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 65 remaining) [2025-02-06 12:58:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 65 remaining) [2025-02-06 12:58:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (36 of 65 remaining) [2025-02-06 12:58:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 65 remaining) [2025-02-06 12:58:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 65 remaining) [2025-02-06 12:58:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 65 remaining) [2025-02-06 12:58:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 65 remaining) [2025-02-06 12:58:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 65 remaining) [2025-02-06 12:58:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 65 remaining) [2025-02-06 12:58:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 65 remaining) [2025-02-06 12:58:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 65 remaining) [2025-02-06 12:58:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 65 remaining) [2025-02-06 12:58:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 65 remaining) [2025-02-06 12:58:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 65 remaining) [2025-02-06 12:58:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 65 remaining) [2025-02-06 12:58:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 65 remaining) [2025-02-06 12:58:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 65 remaining) [2025-02-06 12:58:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 65 remaining) [2025-02-06 12:58:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 65 remaining) [2025-02-06 12:58:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 65 remaining) [2025-02-06 12:58:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 65 remaining) [2025-02-06 12:58:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 65 remaining) [2025-02-06 12:58:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 65 remaining) [2025-02-06 12:58:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 65 remaining) [2025-02-06 12:58:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 65 remaining) [2025-02-06 12:58:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 65 remaining) [2025-02-06 12:58:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 65 remaining) [2025-02-06 12:58:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 65 remaining) [2025-02-06 12:58:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr8ASSERT_VIOLATIONMEMORY_LEAK (10 of 65 remaining) [2025-02-06 12:58:48,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 65 remaining) [2025-02-06 12:58:48,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 65 remaining) [2025-02-06 12:58:48,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 65 remaining) [2025-02-06 12:58:48,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 65 remaining) [2025-02-06 12:58:48,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 65 remaining) [2025-02-06 12:58:48,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 65 remaining) [2025-02-06 12:58:48,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 65 remaining) [2025-02-06 12:58:48,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 65 remaining) [2025-02-06 12:58:48,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 65 remaining) [2025-02-06 12:58:48,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 65 remaining) [2025-02-06 12:58:48,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:58:48,388 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:58:48,393 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:58:48,393 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 12:58:48,462 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-02-06 12:58:48,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 233 transitions, 510 flow [2025-02-06 12:58:48,548 INFO L124 PetriNetUnfolderBase]: 147/851 cut-off events. [2025-02-06 12:58:48,548 INFO L125 PetriNetUnfolderBase]: For 72/82 co-relation queries the response was YES. [2025-02-06 12:58:48,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 851 events. 147/851 cut-off events. For 72/82 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 6264 event pairs, 1 based on Foata normal form. 0/496 useless extension candidates. Maximal degree in co-relation 541. Up to 32 conditions per place. [2025-02-06 12:58:48,556 INFO L82 GeneralOperation]: Start removeDead. Operand has 204 places, 233 transitions, 510 flow [2025-02-06 12:58:48,565 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 204 places, 233 transitions, 510 flow [2025-02-06 12:58:48,565 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:58:48,566 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;@37a18e28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:58:48,566 INFO L334 AbstractCegarLoop]: Starting to check reachability of 90 error locations. [2025-02-06 12:58:48,568 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:58:48,568 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-02-06 12:58:48,568 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:58:48,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:58:48,568 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-02-06 12:58:48,568 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:48,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:58:48,568 INFO L85 PathProgramCache]: Analyzing trace with hash 28873, now seen corresponding path program 1 times [2025-02-06 12:58:48,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:58:48,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457383742] [2025-02-06 12:58:48,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:58:48,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:58:48,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 12:58:48,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 12:58:48,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:58:48,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:58:48,615 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:48,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:58:48,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457383742] [2025-02-06 12:58:48,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457383742] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:58:48,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:58:48,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:58:48,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646621438] [2025-02-06 12:58:48,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:58:48,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:58:48,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:58:48,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:58:48,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:58:48,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 233 [2025-02-06 12:58:48,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 233 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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:48,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:58:48,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 233 [2025-02-06 12:58:48,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand