./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_82-list_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_82-list_racefree.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6ac894f5c6207d1329786eb676509b79ca36f8c33f880cc59ffa30652ab92765 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:59:38,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:59:38,730 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:59:38,734 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:59:38,734 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:59:38,747 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:59:38,748 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:59:38,748 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:59:38,748 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:59:38,748 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:59:38,748 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:59:38,748 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:59:38,748 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:59:38,748 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:59:38,748 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:59:38,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:59:38,748 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:59:38,749 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:59:38,749 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:59:38,749 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:59:38,749 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:59:38,749 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:59:38,749 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:59:38,749 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:59:38,749 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:59:38,749 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:59:38,749 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:59:38,749 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:59:38,749 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:59:38,749 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:59:38,749 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:59:38,749 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:59:38,749 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:59:38,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:59:38,750 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:59:38,750 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:59:38,750 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:59:38,750 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:59:38,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:59:38,750 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:59:38,750 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:59:38,750 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:59:38,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:59:38,750 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:59:38,750 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:59:38,750 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:59:38,750 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:59:38,750 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6ac894f5c6207d1329786eb676509b79ca36f8c33f880cc59ffa30652ab92765 [2025-01-10 00:59:38,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:59:38,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:59:38,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:59:38,966 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:59:38,966 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:59:38,967 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_82-list_racefree.i [2025-01-10 00:59:40,209 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e872d95ee/dce266fe7df144779b78387ea8cfcd1c/FLAGff2c82d3c [2025-01-10 00:59:40,507 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:59:40,507 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_82-list_racefree.i [2025-01-10 00:59:40,522 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e872d95ee/dce266fe7df144779b78387ea8cfcd1c/FLAGff2c82d3c [2025-01-10 00:59:40,542 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e872d95ee/dce266fe7df144779b78387ea8cfcd1c [2025-01-10 00:59:40,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:59:40,546 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:59:40,547 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:59:40,547 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:59:40,550 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:59:40,550 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:59:40" (1/1) ... [2025-01-10 00:59:40,551 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e386d16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:40, skipping insertion in model container [2025-01-10 00:59:40,551 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:59:40" (1/1) ... [2025-01-10 00:59:40,581 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:59:40,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:59:40,907 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:59:40,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:59:40,971 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:59:40,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:40 WrapperNode [2025-01-10 00:59:40,973 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:59:40,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:59:40,974 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:59:40,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:59:40,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:40" (1/1) ... [2025-01-10 00:59:41,004 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:40" (1/1) ... [2025-01-10 00:59:41,035 INFO L138 Inliner]: procedures = 279, calls = 68, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2025-01-10 00:59:41,035 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:59:41,036 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:59:41,036 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:59:41,036 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:59:41,044 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:40" (1/1) ... [2025-01-10 00:59:41,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:40" (1/1) ... [2025-01-10 00:59:41,048 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:40" (1/1) ... [2025-01-10 00:59:41,071 INFO L175 MemorySlicer]: Split 35 memory accesses to 7 slices as follows [2, 5, 5, 5, 2, 14, 2]. 40 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5, 0, 0, 0]. The 10 writes are split as follows [0, 0, 0, 0, 1, 8, 1]. [2025-01-10 00:59:41,072 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:40" (1/1) ... [2025-01-10 00:59:41,072 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:40" (1/1) ... [2025-01-10 00:59:41,081 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:40" (1/1) ... [2025-01-10 00:59:41,081 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:40" (1/1) ... [2025-01-10 00:59:41,084 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:40" (1/1) ... [2025-01-10 00:59:41,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:40" (1/1) ... [2025-01-10 00:59:41,087 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:40" (1/1) ... [2025-01-10 00:59:41,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:59:41,090 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:59:41,093 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:59:41,093 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:59:41,094 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:40" (1/1) ... [2025-01-10 00:59:41,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:59:41,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:59:41,134 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:59:41,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:59:41,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 00:59:41,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 00:59:41,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 00:59:41,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 00:59:41,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-10 00:59:41,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-10 00:59:41,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-10 00:59:41,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-10 00:59:41,160 INFO L130 BoogieDeclarations]: Found specification of procedure t1_fun [2025-01-10 00:59:41,160 INFO L138 BoogieDeclarations]: Found implementation of procedure t1_fun [2025-01-10 00:59:41,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:59:41,160 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:59:41,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:59:41,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:59:41,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:59:41,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 00:59:41,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 00:59:41,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-10 00:59:41,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-10 00:59:41,161 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-01-10 00:59:41,161 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-01-10 00:59:41,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:59:41,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:59:41,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:59:41,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 00:59:41,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 00:59:41,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-10 00:59:41,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-10 00:59:41,163 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:59:41,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:59:41,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:59:41,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 00:59:41,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 00:59:41,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 00:59:41,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-10 00:59:41,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-10 00:59:41,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-10 00:59:41,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-10 00:59:41,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:59:41,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:59:41,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:59:41,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 00:59:41,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 00:59:41,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-10 00:59:41,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-10 00:59:41,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:59:41,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:59:41,167 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:59:41,366 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:59:41,368 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:59:41,710 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:59:41,710 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:59:41,842 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:59:41,842 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2025-01-10 00:59:41,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:59:41 BoogieIcfgContainer [2025-01-10 00:59:41,843 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:59:41,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:59:41,844 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:59:41,847 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:59:41,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:59:40" (1/3) ... [2025-01-10 00:59:41,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755700e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:59:41, skipping insertion in model container [2025-01-10 00:59:41,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:40" (2/3) ... [2025-01-10 00:59:41,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755700e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:59:41, skipping insertion in model container [2025-01-10 00:59:41,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:59:41" (3/3) ... [2025-01-10 00:59:41,849 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_82-list_racefree.i [2025-01-10 00:59:41,859 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:59:41,860 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_82-list_racefree.i that has 3 procedures, 113 locations, 1 initial locations, 10 loop locations, and 38 error locations. [2025-01-10 00:59:41,860 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:59:41,924 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-10 00:59:41,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 133 transitions, 286 flow [2025-01-10 00:59:42,003 INFO L124 PetriNetUnfolderBase]: 38/272 cut-off events. [2025-01-10 00:59:42,005 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-10 00:59:42,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 272 events. 38/272 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1407 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 143. Up to 8 conditions per place. [2025-01-10 00:59:42,010 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 133 transitions, 286 flow [2025-01-10 00:59:42,014 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 133 transitions, 286 flow [2025-01-10 00:59:42,020 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:59:42,032 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;@f75184c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:59:42,032 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2025-01-10 00:59:42,039 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:59:42,039 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-01-10 00:59:42,039 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:59:42,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:42,040 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 00:59:42,040 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-10 00:59:42,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:42,044 INFO L85 PathProgramCache]: Analyzing trace with hash 18554, now seen corresponding path program 1 times [2025-01-10 00:59:42,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:42,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095474307] [2025-01-10 00:59:42,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:42,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:42,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 00:59:42,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 00:59:42,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:42,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:42,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-01-10 00:59:42,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:42,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095474307] [2025-01-10 00:59:42,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095474307] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:42,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:42,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:59:42,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373674320] [2025-01-10 00:59:42,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:42,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:42,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:42,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:42,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:42,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 133 [2025-01-10 00:59:42,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 133 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:42,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:42,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 133 [2025-01-10 00:59:42,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:43,122 INFO L124 PetriNetUnfolderBase]: 2776/6498 cut-off events. [2025-01-10 00:59:43,122 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2025-01-10 00:59:43,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11025 conditions, 6498 events. 2776/6498 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 52211 event pairs, 2586 based on Foata normal form. 464/5986 useless extension candidates. Maximal degree in co-relation 9584. Up to 4430 conditions per place. [2025-01-10 00:59:43,164 INFO L140 encePairwiseOnDemand]: 116/133 looper letters, 52 selfloop transitions, 2 changer transitions 0/117 dead transitions. [2025-01-10 00:59:43,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 117 transitions, 362 flow [2025-01-10 00:59:43,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:43,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:43,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2025-01-10 00:59:43,174 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6466165413533834 [2025-01-10 00:59:43,176 INFO L175 Difference]: Start difference. First operand has 119 places, 133 transitions, 286 flow. Second operand 3 states and 258 transitions. [2025-01-10 00:59:43,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 117 transitions, 362 flow [2025-01-10 00:59:43,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 117 transitions, 362 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:59:43,185 INFO L231 Difference]: Finished difference. Result has 118 places, 117 transitions, 258 flow [2025-01-10 00:59:43,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=258, PETRI_PLACES=118, PETRI_TRANSITIONS=117} [2025-01-10 00:59:43,189 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, -1 predicate places. [2025-01-10 00:59:43,189 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 117 transitions, 258 flow [2025-01-10 00:59:43,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:43,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:43,189 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 00:59:43,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:59:43,190 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-10 00:59:43,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:43,190 INFO L85 PathProgramCache]: Analyzing trace with hash 18555, now seen corresponding path program 1 times [2025-01-10 00:59:43,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:43,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490077031] [2025-01-10 00:59:43,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:43,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:43,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 00:59:43,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 00:59:43,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:43,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:43,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:59:43,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:43,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490077031] [2025-01-10 00:59:43,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490077031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:43,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:43,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:59:43,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882238886] [2025-01-10 00:59:43,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:43,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:43,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:43,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:43,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:43,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 133 [2025-01-10 00:59:43,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 117 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:43,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:43,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 133 [2025-01-10 00:59:43,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:43,934 INFO L124 PetriNetUnfolderBase]: 2776/6496 cut-off events. [2025-01-10 00:59:43,934 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2025-01-10 00:59:43,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11025 conditions, 6496 events. 2776/6496 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 52197 event pairs, 2586 based on Foata normal form. 2/5522 useless extension candidates. Maximal degree in co-relation 11013. Up to 4430 conditions per place. [2025-01-10 00:59:43,965 INFO L140 encePairwiseOnDemand]: 129/133 looper letters, 51 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2025-01-10 00:59:43,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 115 transitions, 360 flow [2025-01-10 00:59:43,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:43,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:43,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 247 transitions. [2025-01-10 00:59:43,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-01-10 00:59:43,967 INFO L175 Difference]: Start difference. First operand has 118 places, 117 transitions, 258 flow. Second operand 3 states and 247 transitions. [2025-01-10 00:59:43,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 115 transitions, 360 flow [2025-01-10 00:59:43,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 115 transitions, 356 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:59:43,972 INFO L231 Difference]: Finished difference. Result has 116 places, 115 transitions, 254 flow [2025-01-10 00:59:43,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=254, PETRI_PLACES=116, PETRI_TRANSITIONS=115} [2025-01-10 00:59:43,972 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places. [2025-01-10 00:59:43,972 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 115 transitions, 254 flow [2025-01-10 00:59:43,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:43,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:43,973 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:59:43,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:59:43,973 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-10 00:59:43,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:43,973 INFO L85 PathProgramCache]: Analyzing trace with hash 553277486, now seen corresponding path program 1 times [2025-01-10 00:59:43,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:43,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802070821] [2025-01-10 00:59:43,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:43,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:43,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:59:43,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:59:43,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:43,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:44,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:59:44,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:44,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802070821] [2025-01-10 00:59:44,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802070821] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:44,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:44,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:59:44,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514408114] [2025-01-10 00:59:44,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:44,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:44,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:44,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:44,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:44,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 133 [2025-01-10 00:59:44,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 115 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:44,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:44,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 133 [2025-01-10 00:59:44,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:44,722 INFO L124 PetriNetUnfolderBase]: 3172/7078 cut-off events. [2025-01-10 00:59:44,722 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2025-01-10 00:59:44,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12251 conditions, 7078 events. 3172/7078 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 57776 event pairs, 2202 based on Foata normal form. 0/6161 useless extension candidates. Maximal degree in co-relation 12239. Up to 3813 conditions per place. [2025-01-10 00:59:44,765 INFO L140 encePairwiseOnDemand]: 129/133 looper letters, 87 selfloop transitions, 2 changer transitions 0/147 dead transitions. [2025-01-10 00:59:44,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 147 transitions, 496 flow [2025-01-10 00:59:44,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:44,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:44,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2025-01-10 00:59:44,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6942355889724311 [2025-01-10 00:59:44,769 INFO L175 Difference]: Start difference. First operand has 116 places, 115 transitions, 254 flow. Second operand 3 states and 277 transitions. [2025-01-10 00:59:44,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 147 transitions, 496 flow [2025-01-10 00:59:44,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 147 transitions, 492 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:59:44,773 INFO L231 Difference]: Finished difference. Result has 114 places, 113 transitions, 250 flow [2025-01-10 00:59:44,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=114, PETRI_TRANSITIONS=113} [2025-01-10 00:59:44,774 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, -5 predicate places. [2025-01-10 00:59:44,774 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 113 transitions, 250 flow [2025-01-10 00:59:44,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:44,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:44,776 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:59:44,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:59:44,776 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-10 00:59:44,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:44,777 INFO L85 PathProgramCache]: Analyzing trace with hash 553277487, now seen corresponding path program 1 times [2025-01-10 00:59:44,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:44,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033261271] [2025-01-10 00:59:44,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:44,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:44,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:59:44,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:59:44,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:44,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:44,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:59:44,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:44,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033261271] [2025-01-10 00:59:44,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033261271] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:44,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:44,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:59:44,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208160933] [2025-01-10 00:59:44,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:44,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:44,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:44,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:44,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:44,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 133 [2025-01-10 00:59:44,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 113 transitions, 250 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-01-10 00:59:44,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:44,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 133 [2025-01-10 00:59:44,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:45,498 INFO L124 PetriNetUnfolderBase]: 2693/6186 cut-off events. [2025-01-10 00:59:45,498 INFO L125 PetriNetUnfolderBase]: For 390/395 co-relation queries the response was YES. [2025-01-10 00:59:45,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10785 conditions, 6186 events. 2693/6186 cut-off events. For 390/395 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 49091 event pairs, 2331 based on Foata normal form. 1/5355 useless extension candidates. Maximal degree in co-relation 9675. Up to 4269 conditions per place. [2025-01-10 00:59:45,524 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 54 selfloop transitions, 3 changer transitions 0/116 dead transitions. [2025-01-10 00:59:45,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 116 transitions, 370 flow [2025-01-10 00:59:45,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:45,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:45,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2025-01-10 00:59:45,526 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6365914786967418 [2025-01-10 00:59:45,526 INFO L175 Difference]: Start difference. First operand has 114 places, 113 transitions, 250 flow. Second operand 3 states and 254 transitions. [2025-01-10 00:59:45,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 116 transitions, 370 flow [2025-01-10 00:59:45,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 116 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:59:45,534 INFO L231 Difference]: Finished difference. Result has 115 places, 115 transitions, 267 flow [2025-01-10 00:59:45,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=267, PETRI_PLACES=115, PETRI_TRANSITIONS=115} [2025-01-10 00:59:45,535 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, -4 predicate places. [2025-01-10 00:59:45,535 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 115 transitions, 267 flow [2025-01-10 00:59:45,536 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-01-10 00:59:45,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:45,536 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:59:45,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:59:45,536 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-10 00:59:45,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:45,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1394185312, now seen corresponding path program 1 times [2025-01-10 00:59:45,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:45,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543147276] [2025-01-10 00:59:45,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:45,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:45,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:59:45,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:59:45,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:45,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:45,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:59:45,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:45,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543147276] [2025-01-10 00:59:45,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543147276] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:45,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:45,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:59:45,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421131145] [2025-01-10 00:59:45,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:45,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:45,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:45,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:45,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:45,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 133 [2025-01-10 00:59:45,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 115 transitions, 267 flow. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:45,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:45,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 133 [2025-01-10 00:59:45,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:46,373 INFO L124 PetriNetUnfolderBase]: 3410/7730 cut-off events. [2025-01-10 00:59:46,373 INFO L125 PetriNetUnfolderBase]: For 405/409 co-relation queries the response was YES. [2025-01-10 00:59:46,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13474 conditions, 7730 events. 3410/7730 cut-off events. For 405/409 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 62970 event pairs, 2342 based on Foata normal form. 0/6712 useless extension candidates. Maximal degree in co-relation 13403. Up to 4247 conditions per place. [2025-01-10 00:59:46,404 INFO L140 encePairwiseOnDemand]: 127/133 looper letters, 97 selfloop transitions, 5 changer transitions 0/159 dead transitions. [2025-01-10 00:59:46,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 159 transitions, 572 flow [2025-01-10 00:59:46,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:46,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:46,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2025-01-10 00:59:46,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7293233082706767 [2025-01-10 00:59:46,406 INFO L175 Difference]: Start difference. First operand has 115 places, 115 transitions, 267 flow. Second operand 3 states and 291 transitions. [2025-01-10 00:59:46,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 159 transitions, 572 flow [2025-01-10 00:59:46,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 159 transitions, 569 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:59:46,409 INFO L231 Difference]: Finished difference. Result has 118 places, 118 transitions, 300 flow [2025-01-10 00:59:46,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=118, PETRI_TRANSITIONS=118} [2025-01-10 00:59:46,409 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, -1 predicate places. [2025-01-10 00:59:46,409 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 118 transitions, 300 flow [2025-01-10 00:59:46,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:46,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:46,410 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:59:46,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:59:46,410 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-10 00:59:46,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:46,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1394185311, now seen corresponding path program 1 times [2025-01-10 00:59:46,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:46,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146851086] [2025-01-10 00:59:46,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:46,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:46,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:59:46,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:59:46,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:46,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:46,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:59:46,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:46,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146851086] [2025-01-10 00:59:46,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146851086] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:46,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:46,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:59:46,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181070538] [2025-01-10 00:59:46,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:46,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:46,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:46,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:46,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:46,555 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 133 [2025-01-10 00:59:46,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 118 transitions, 300 flow. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:46,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:46,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 133 [2025-01-10 00:59:46,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:47,218 INFO L124 PetriNetUnfolderBase]: 4197/9400 cut-off events. [2025-01-10 00:59:47,218 INFO L125 PetriNetUnfolderBase]: For 3076/3387 co-relation queries the response was YES. [2025-01-10 00:59:47,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18535 conditions, 9400 events. 4197/9400 cut-off events. For 3076/3387 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 79734 event pairs, 2984 based on Foata normal form. 583/8841 useless extension candidates. Maximal degree in co-relation 17424. Up to 5783 conditions per place. [2025-01-10 00:59:47,261 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 98 selfloop transitions, 5 changer transitions 0/162 dead transitions. [2025-01-10 00:59:47,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 162 transitions, 617 flow [2025-01-10 00:59:47,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:47,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:47,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2025-01-10 00:59:47,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.731829573934837 [2025-01-10 00:59:47,263 INFO L175 Difference]: Start difference. First operand has 118 places, 118 transitions, 300 flow. Second operand 3 states and 292 transitions. [2025-01-10 00:59:47,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 162 transitions, 617 flow [2025-01-10 00:59:47,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 162 transitions, 603 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:59:47,268 INFO L231 Difference]: Finished difference. Result has 119 places, 121 transitions, 327 flow [2025-01-10 00:59:47,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=327, PETRI_PLACES=119, PETRI_TRANSITIONS=121} [2025-01-10 00:59:47,269 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 0 predicate places. [2025-01-10 00:59:47,269 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 121 transitions, 327 flow [2025-01-10 00:59:47,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:47,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:47,269 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:59:47,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:59:47,270 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-10 00:59:47,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:47,270 INFO L85 PathProgramCache]: Analyzing trace with hash -270161554, now seen corresponding path program 1 times [2025-01-10 00:59:47,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:47,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044316756] [2025-01-10 00:59:47,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:47,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:47,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:59:47,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:59:47,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:47,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:47,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:59:47,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:47,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044316756] [2025-01-10 00:59:47,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044316756] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:47,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:47,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:59:47,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135328898] [2025-01-10 00:59:47,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:47,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:59:47,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:47,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:59:47,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:59:47,413 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 133 [2025-01-10 00:59:47,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 121 transitions, 327 flow. Second operand has 4 states, 4 states have (on average 66.75) internal successors, (267), 4 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:47,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:47,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 133 [2025-01-10 00:59:47,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:48,028 INFO L124 PetriNetUnfolderBase]: 3336/7604 cut-off events. [2025-01-10 00:59:48,028 INFO L125 PetriNetUnfolderBase]: For 5654/7219 co-relation queries the response was YES. [2025-01-10 00:59:48,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15295 conditions, 7604 events. 3336/7604 cut-off events. For 5654/7219 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 62098 event pairs, 2814 based on Foata normal form. 54/6624 useless extension candidates. Maximal degree in co-relation 14184. Up to 5272 conditions per place. [2025-01-10 00:59:48,067 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 60 selfloop transitions, 5 changer transitions 0/125 dead transitions. [2025-01-10 00:59:48,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 125 transitions, 476 flow [2025-01-10 00:59:48,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:59:48,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:59:48,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 321 transitions. [2025-01-10 00:59:48,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6033834586466166 [2025-01-10 00:59:48,069 INFO L175 Difference]: Start difference. First operand has 119 places, 121 transitions, 327 flow. Second operand 4 states and 321 transitions. [2025-01-10 00:59:48,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 125 transitions, 476 flow [2025-01-10 00:59:48,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 125 transitions, 470 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:59:48,073 INFO L231 Difference]: Finished difference. Result has 122 places, 123 transitions, 355 flow [2025-01-10 00:59:48,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=355, PETRI_PLACES=122, PETRI_TRANSITIONS=123} [2025-01-10 00:59:48,073 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 3 predicate places. [2025-01-10 00:59:48,074 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 123 transitions, 355 flow [2025-01-10 00:59:48,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.75) internal successors, (267), 4 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:48,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:48,074 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 00:59:48,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:59:48,074 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-10 00:59:48,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:48,075 INFO L85 PathProgramCache]: Analyzing trace with hash 214927102, now seen corresponding path program 1 times [2025-01-10 00:59:48,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:48,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055664284] [2025-01-10 00:59:48,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:48,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:48,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:59:48,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:59:48,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:48,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:59:48,104 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:59:48,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:59:48,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:59:48,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:48,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:59:48,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:59:48,155 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:59:48,156 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (64 of 65 remaining) [2025-01-10 00:59:48,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 65 remaining) [2025-01-10 00:59:48,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 65 remaining) [2025-01-10 00:59:48,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 65 remaining) [2025-01-10 00:59:48,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 65 remaining) [2025-01-10 00:59:48,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 65 remaining) [2025-01-10 00:59:48,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 65 remaining) [2025-01-10 00:59:48,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 65 remaining) [2025-01-10 00:59:48,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 65 remaining) [2025-01-10 00:59:48,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 65 remaining) [2025-01-10 00:59:48,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 65 remaining) [2025-01-10 00:59:48,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 65 remaining) [2025-01-10 00:59:48,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 65 remaining) [2025-01-10 00:59:48,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 65 remaining) [2025-01-10 00:59:48,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 65 remaining) [2025-01-10 00:59:48,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr14ASSERT_VIOLATIONMEMORY_LEAK (49 of 65 remaining) [2025-01-10 00:59:48,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 65 remaining) [2025-01-10 00:59:48,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 65 remaining) [2025-01-10 00:59:48,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 65 remaining) [2025-01-10 00:59:48,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 65 remaining) [2025-01-10 00:59:48,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 65 remaining) [2025-01-10 00:59:48,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 65 remaining) [2025-01-10 00:59:48,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 65 remaining) [2025-01-10 00:59:48,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 65 remaining) [2025-01-10 00:59:48,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 65 remaining) [2025-01-10 00:59:48,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 65 remaining) [2025-01-10 00:59:48,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 65 remaining) [2025-01-10 00:59:48,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 65 remaining) [2025-01-10 00:59:48,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (36 of 65 remaining) [2025-01-10 00:59:48,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 65 remaining) [2025-01-10 00:59:48,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 65 remaining) [2025-01-10 00:59:48,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 65 remaining) [2025-01-10 00:59:48,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 65 remaining) [2025-01-10 00:59:48,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 65 remaining) [2025-01-10 00:59:48,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 65 remaining) [2025-01-10 00:59:48,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 65 remaining) [2025-01-10 00:59:48,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 65 remaining) [2025-01-10 00:59:48,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 65 remaining) [2025-01-10 00:59:48,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 65 remaining) [2025-01-10 00:59:48,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 65 remaining) [2025-01-10 00:59:48,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 65 remaining) [2025-01-10 00:59:48,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 65 remaining) [2025-01-10 00:59:48,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 65 remaining) [2025-01-10 00:59:48,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 65 remaining) [2025-01-10 00:59:48,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 65 remaining) [2025-01-10 00:59:48,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 65 remaining) [2025-01-10 00:59:48,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 65 remaining) [2025-01-10 00:59:48,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 65 remaining) [2025-01-10 00:59:48,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 65 remaining) [2025-01-10 00:59:48,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 65 remaining) [2025-01-10 00:59:48,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 65 remaining) [2025-01-10 00:59:48,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 65 remaining) [2025-01-10 00:59:48,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 65 remaining) [2025-01-10 00:59:48,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 65 remaining) [2025-01-10 00:59:48,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr14ASSERT_VIOLATIONMEMORY_LEAK (10 of 65 remaining) [2025-01-10 00:59:48,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 65 remaining) [2025-01-10 00:59:48,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 65 remaining) [2025-01-10 00:59:48,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 65 remaining) [2025-01-10 00:59:48,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 65 remaining) [2025-01-10 00:59:48,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 65 remaining) [2025-01-10 00:59:48,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 65 remaining) [2025-01-10 00:59:48,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 65 remaining) [2025-01-10 00:59:48,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 65 remaining) [2025-01-10 00:59:48,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 65 remaining) [2025-01-10 00:59:48,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 65 remaining) [2025-01-10 00:59:48,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:59:48,161 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:59:48,166 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:59:48,167 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 00:59:48,254 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-01-10 00:59:48,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 202 places, 231 transitions, 506 flow [2025-01-10 00:59:48,334 INFO L124 PetriNetUnfolderBase]: 147/845 cut-off events. [2025-01-10 00:59:48,334 INFO L125 PetriNetUnfolderBase]: For 72/89 co-relation queries the response was YES. [2025-01-10 00:59:48,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 934 conditions, 845 events. 147/845 cut-off events. For 72/89 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 6130 event pairs, 2 based on Foata normal form. 0/482 useless extension candidates. Maximal degree in co-relation 533. Up to 32 conditions per place. [2025-01-10 00:59:48,341 INFO L82 GeneralOperation]: Start removeDead. Operand has 202 places, 231 transitions, 506 flow [2025-01-10 00:59:48,350 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 202 places, 231 transitions, 506 flow [2025-01-10 00:59:48,351 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:59:48,351 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;@f75184c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:59:48,351 INFO L334 AbstractCegarLoop]: Starting to check reachability of 90 error locations. [2025-01-10 00:59:48,353 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:59:48,353 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-01-10 00:59:48,353 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:59:48,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:48,353 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 00:59:48,353 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2025-01-10 00:59:48,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:48,353 INFO L85 PathProgramCache]: Analyzing trace with hash 25882, now seen corresponding path program 1 times [2025-01-10 00:59:48,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:48,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660413680] [2025-01-10 00:59:48,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:48,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:48,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 00:59:48,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 00:59:48,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:48,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:48,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:59:48,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:48,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660413680] [2025-01-10 00:59:48,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660413680] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:48,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:48,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:59:48,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273471159] [2025-01-10 00:59:48,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:48,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:48,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:48,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:48,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:48,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 231 [2025-01-10 00:59:48,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 231 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:48,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:48,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 231 [2025-01-10 00:59:48,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand