./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:35:19,814 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:35:19,852 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:35:19,855 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:35:19,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:35:19,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:35:19,870 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:35:19,870 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:35:19,870 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:35:19,870 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:35:19,870 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:35:19,871 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:35:19,871 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:35:19,871 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:35:19,871 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:35:19,871 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:35:19,871 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:35:19,871 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:35:19,871 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:35:19,871 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:35:19,871 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:35:19,872 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:35:19,872 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:35:19,872 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:35:19,872 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:35:19,872 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:35:19,872 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:35:19,872 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:35:19,872 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:35:19,872 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:35:19,872 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:35:19,872 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:35:19,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:35:19,873 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:35:19,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:35:19,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:35:19,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:35:19,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:35:19,873 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:35:19,873 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:35:19,873 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:35:19,873 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:35:19,873 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:35:19,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:35:19,874 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:35:19,874 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:35:19,874 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:35:19,874 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:35:19,874 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 ! call(reach_error())) ) 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 -> 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba [2025-01-09 16:35:20,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:35:20,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:35:20,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:35:20,073 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:35:20,073 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:35:20,074 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_70-funloop_racefree.i [2025-01-09 16:35:21,270 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6bf43d4c1/4ed0927053de4887ad5e75218631a4be/FLAG84654f87b [2025-01-09 16:35:21,584 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:35:21,585 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2025-01-09 16:35:21,597 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6bf43d4c1/4ed0927053de4887ad5e75218631a4be/FLAG84654f87b [2025-01-09 16:35:21,607 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6bf43d4c1/4ed0927053de4887ad5e75218631a4be [2025-01-09 16:35:21,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:35:21,610 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:35:21,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:35:21,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:35:21,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:35:21,614 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:35:21" (1/1) ... [2025-01-09 16:35:21,615 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22a54b0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:21, skipping insertion in model container [2025-01-09 16:35:21,615 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:35:21" (1/1) ... [2025-01-09 16:35:21,638 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:35:21,977 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i[41323,41336] [2025-01-09 16:35:21,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:35:22,017 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:35:22,045 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i[41323,41336] [2025-01-09 16:35:22,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:35:22,103 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:35:22,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:22 WrapperNode [2025-01-09 16:35:22,104 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:35:22,105 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:35:22,106 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:35:22,106 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:35:22,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:22" (1/1) ... [2025-01-09 16:35:22,124 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:22" (1/1) ... [2025-01-09 16:35:22,149 INFO L138 Inliner]: procedures = 272, calls = 95, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 252 [2025-01-09 16:35:22,153 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:35:22,153 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:35:22,154 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:35:22,154 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:35:22,161 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:22" (1/1) ... [2025-01-09 16:35:22,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:22" (1/1) ... [2025-01-09 16:35:22,164 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:22" (1/1) ... [2025-01-09 16:35:22,184 INFO L175 MemorySlicer]: Split 79 memory accesses to 4 slices as follows [2, 5, 70, 2]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 5, 60, 0]. The 5 writes are split as follows [0, 0, 4, 1]. [2025-01-09 16:35:22,184 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:22" (1/1) ... [2025-01-09 16:35:22,184 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:22" (1/1) ... [2025-01-09 16:35:22,197 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:22" (1/1) ... [2025-01-09 16:35:22,197 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:22" (1/1) ... [2025-01-09 16:35:22,203 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:22" (1/1) ... [2025-01-09 16:35:22,204 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:22" (1/1) ... [2025-01-09 16:35:22,205 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:22" (1/1) ... [2025-01-09 16:35:22,207 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:35:22,211 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:35:22,211 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:35:22,211 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:35:22,212 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:22" (1/1) ... [2025-01-09 16:35:22,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:35:22,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:35:22,240 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-09 16:35:22,243 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-09 16:35:22,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 16:35:22,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 16:35:22,260 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 16:35:22,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:35:22,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:35:22,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 16:35:22,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 16:35:22,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:35:22,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:35:22,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 16:35:22,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 16:35:22,260 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 16:35:22,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:35:22,260 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 16:35:22,260 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 16:35:22,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:35:22,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:35:22,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 16:35:22,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 16:35:22,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:35:22,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:35:22,262 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:35:22,354 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:35:22,355 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:35:22,705 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:35:22,706 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:35:23,056 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:35:23,057 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2025-01-09 16:35:23,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:35:23 BoogieIcfgContainer [2025-01-09 16:35:23,058 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:35:23,060 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:35:23,060 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:35:23,063 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:35:23,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:35:21" (1/3) ... [2025-01-09 16:35:23,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59baaf7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:35:23, skipping insertion in model container [2025-01-09 16:35:23,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:22" (2/3) ... [2025-01-09 16:35:23,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59baaf7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:35:23, skipping insertion in model container [2025-01-09 16:35:23,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:35:23" (3/3) ... [2025-01-09 16:35:23,066 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2025-01-09 16:35:23,077 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:35:23,079 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_70-funloop_racefree.i that has 2 procedures, 69 locations, 1 initial locations, 15 loop locations, and 2 error locations. [2025-01-09 16:35:23,080 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:35:23,123 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 16:35:23,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 97 transitions, 201 flow [2025-01-09 16:35:23,207 INFO L124 PetriNetUnfolderBase]: 41/143 cut-off events. [2025-01-09 16:35:23,210 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:35:23,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 143 events. 41/143 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 547 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 90. Up to 8 conditions per place. [2025-01-09 16:35:23,216 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 97 transitions, 201 flow [2025-01-09 16:35:23,222 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 95 transitions, 194 flow [2025-01-09 16:35:23,230 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:35:23,240 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=LoopHeads, 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;@42972126, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:35:23,241 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:35:23,248 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:35:23,248 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2025-01-09 16:35:23,248 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:35:23,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:35:23,249 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-09 16:35:23,249 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 16:35:23,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:35:23,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1679628166, now seen corresponding path program 1 times [2025-01-09 16:35:23,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:35:23,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388268751] [2025-01-09 16:35:23,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:35:23,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:35:23,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 16:35:23,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 16:35:23,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:35:23,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:35:23,514 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-09 16:35:23,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:35:23,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388268751] [2025-01-09 16:35:23,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388268751] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:35:23,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:35:23,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:35:23,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257566533] [2025-01-09 16:35:23,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:35:23,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:35:23,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:35:23,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:35:23,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:35:23,544 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 97 [2025-01-09 16:35:23,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 95 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-09 16:35:23,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:35:23,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 97 [2025-01-09 16:35:23,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:35:23,820 INFO L124 PetriNetUnfolderBase]: 483/1328 cut-off events. [2025-01-09 16:35:23,820 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:35:23,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2242 conditions, 1328 events. 483/1328 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 8456 event pairs, 396 based on Foata normal form. 297/1456 useless extension candidates. Maximal degree in co-relation 2168. Up to 909 conditions per place. [2025-01-09 16:35:23,830 INFO L140 encePairwiseOnDemand]: 72/97 looper letters, 45 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2025-01-09 16:35:23,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 74 transitions, 246 flow [2025-01-09 16:35:23,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:35:23,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:35:23,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2025-01-09 16:35:23,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5189003436426117 [2025-01-09 16:35:23,841 INFO L175 Difference]: Start difference. First operand has 71 places, 95 transitions, 194 flow. Second operand 3 states and 151 transitions. [2025-01-09 16:35:23,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 74 transitions, 246 flow [2025-01-09 16:35:23,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 74 transitions, 246 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:35:23,847 INFO L231 Difference]: Finished difference. Result has 74 places, 74 transitions, 162 flow [2025-01-09 16:35:23,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=74, PETRI_TRANSITIONS=74} [2025-01-09 16:35:23,851 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, 3 predicate places. [2025-01-09 16:35:23,852 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 74 transitions, 162 flow [2025-01-09 16:35:23,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-09 16:35:23,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:35:23,852 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-09 16:35:23,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:35:23,853 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 16:35:23,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:35:23,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1202510364, now seen corresponding path program 1 times [2025-01-09 16:35:23,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:35:23,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968521694] [2025-01-09 16:35:23,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:35:23,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:35:23,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 16:35:23,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 16:35:23,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:35:23,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:35:23,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:35:23,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:35:23,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968521694] [2025-01-09 16:35:23,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968521694] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:35:23,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021647777] [2025-01-09 16:35:23,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:35:23,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:35:23,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:35:23,951 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:35:23,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:35:24,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 16:35:24,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 16:35:24,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:35:24,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:35:24,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:35:24,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:35:24,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:35:24,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:35:24,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:35:24,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021647777] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:35:24,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:35:24,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-09 16:35:24,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115245401] [2025-01-09 16:35:24,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:35:24,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:35:24,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:35:24,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:35:24,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:35:24,082 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 97 [2025-01-09 16:35:24,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 74 transitions, 162 flow. Second operand has 7 states, 7 states have (on average 28.571428571428573) internal successors, (200), 7 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:35:24,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:35:24,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 97 [2025-01-09 16:35:24,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:35:24,301 INFO L124 PetriNetUnfolderBase]: 483/1331 cut-off events. [2025-01-09 16:35:24,302 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:35:24,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2258 conditions, 1331 events. 483/1331 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 8451 event pairs, 396 based on Foata normal form. 0/1162 useless extension candidates. Maximal degree in co-relation 2246. Up to 909 conditions per place. [2025-01-09 16:35:24,309 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 45 selfloop transitions, 5 changer transitions 0/77 dead transitions. [2025-01-09 16:35:24,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 77 transitions, 274 flow [2025-01-09 16:35:24,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:35:24,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:35:24,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 215 transitions. [2025-01-09 16:35:24,311 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3694158075601375 [2025-01-09 16:35:24,311 INFO L175 Difference]: Start difference. First operand has 74 places, 74 transitions, 162 flow. Second operand 6 states and 215 transitions. [2025-01-09 16:35:24,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 77 transitions, 274 flow [2025-01-09 16:35:24,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 77 transitions, 270 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:35:24,313 INFO L231 Difference]: Finished difference. Result has 81 places, 77 transitions, 194 flow [2025-01-09 16:35:24,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=194, PETRI_PLACES=81, PETRI_TRANSITIONS=77} [2025-01-09 16:35:24,314 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, 10 predicate places. [2025-01-09 16:35:24,314 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 77 transitions, 194 flow [2025-01-09 16:35:24,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.571428571428573) internal successors, (200), 7 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:35:24,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:35:24,314 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2025-01-09 16:35:24,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:35:24,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:35:24,519 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 16:35:24,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:35:24,520 INFO L85 PathProgramCache]: Analyzing trace with hash 933445882, now seen corresponding path program 2 times [2025-01-09 16:35:24,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:35:24,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481623657] [2025-01-09 16:35:24,520 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:35:24,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:35:24,541 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-09 16:35:24,576 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 16:35:24,576 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:35:24,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:35:24,687 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:35:24,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:35:24,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481623657] [2025-01-09 16:35:24,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481623657] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:35:24,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494997168] [2025-01-09 16:35:24,688 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:35:24,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:35:24,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:35:24,692 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:35:24,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:35:24,783 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-09 16:35:24,814 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 16:35:24,814 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:35:24,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:35:24,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:35:24,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:35:24,833 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:35:24,833 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:35:24,884 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:35:24,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494997168] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:35:24,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:35:24,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-01-09 16:35:24,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541482650] [2025-01-09 16:35:24,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:35:24,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:35:24,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:35:24,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:35:24,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:35:24,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 97 [2025-01-09 16:35:24,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 77 transitions, 194 flow. Second operand has 13 states, 13 states have (on average 28.307692307692307) internal successors, (368), 13 states have internal predecessors, (368), 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-09 16:35:24,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:35:24,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 97 [2025-01-09 16:35:24,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:35:25,113 INFO L124 PetriNetUnfolderBase]: 483/1337 cut-off events. [2025-01-09 16:35:25,113 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-01-09 16:35:25,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2295 conditions, 1337 events. 483/1337 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 8455 event pairs, 396 based on Foata normal form. 6/1175 useless extension candidates. Maximal degree in co-relation 2237. Up to 909 conditions per place. [2025-01-09 16:35:25,120 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 45 selfloop transitions, 11 changer transitions 0/83 dead transitions. [2025-01-09 16:35:25,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 83 transitions, 342 flow [2025-01-09 16:35:25,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:35:25,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:35:25,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 386 transitions. [2025-01-09 16:35:25,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3316151202749141 [2025-01-09 16:35:25,122 INFO L175 Difference]: Start difference. First operand has 81 places, 77 transitions, 194 flow. Second operand 12 states and 386 transitions. [2025-01-09 16:35:25,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 83 transitions, 342 flow [2025-01-09 16:35:25,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 83 transitions, 328 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-09 16:35:25,124 INFO L231 Difference]: Finished difference. Result has 97 places, 83 transitions, 264 flow [2025-01-09 16:35:25,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=264, PETRI_PLACES=97, PETRI_TRANSITIONS=83} [2025-01-09 16:35:25,128 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, 26 predicate places. [2025-01-09 16:35:25,129 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 83 transitions, 264 flow [2025-01-09 16:35:25,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 28.307692307692307) internal successors, (368), 13 states have internal predecessors, (368), 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-09 16:35:25,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:35:25,129 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2025-01-09 16:35:25,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 16:35:25,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:35:25,330 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 16:35:25,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:35:25,331 INFO L85 PathProgramCache]: Analyzing trace with hash 627658170, now seen corresponding path program 3 times [2025-01-09 16:35:25,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:35:25,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806479170] [2025-01-09 16:35:25,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:35:25,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:35:25,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 6 equivalence classes. [2025-01-09 16:35:25,370 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 16:35:25,370 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-09 16:35:25,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:35:25,370 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:35:25,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 16:35:25,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 16:35:25,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:35:25,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:35:25,398 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:35:25,399 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:35:25,399 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-01-09 16:35:25,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-01-09 16:35:25,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-01-09 16:35:25,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-01-09 16:35:25,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:35:25,401 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-01-09 16:35:25,403 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:35:25,403 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 16:35:25,423 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 16:35:25,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 142 transitions, 300 flow [2025-01-09 16:35:25,439 INFO L124 PetriNetUnfolderBase]: 69/241 cut-off events. [2025-01-09 16:35:25,439 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 16:35:25,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 241 events. 69/241 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1109 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 145. Up to 12 conditions per place. [2025-01-09 16:35:25,440 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 142 transitions, 300 flow [2025-01-09 16:35:25,442 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 142 transitions, 300 flow [2025-01-09 16:35:25,443 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:35:25,443 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=LoopHeads, 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;@42972126, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:35:25,443 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-09 16:35:25,448 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:35:25,449 INFO L124 PetriNetUnfolderBase]: 5/47 cut-off events. [2025-01-09 16:35:25,449 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:35:25,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:35:25,449 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2025-01-09 16:35:25,449 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:35:25,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:35:25,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1023894896, now seen corresponding path program 1 times [2025-01-09 16:35:25,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:35:25,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733042363] [2025-01-09 16:35:25,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:35:25,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:35:25,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 16:35:25,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 16:35:25,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:35:25,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:35:25,484 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-09 16:35:25,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:35:25,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733042363] [2025-01-09 16:35:25,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733042363] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:35:25,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:35:25,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:35:25,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771449993] [2025-01-09 16:35:25,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:35:25,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:35:25,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:35:25,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:35:25,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:35:25,486 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 142 [2025-01-09 16:35:25,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 142 transitions, 300 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-09 16:35:25,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:35:25,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 142 [2025-01-09 16:35:25,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:35:27,791 INFO L124 PetriNetUnfolderBase]: 18464/36000 cut-off events. [2025-01-09 16:35:27,792 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-01-09 16:35:27,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62627 conditions, 36000 events. 18464/36000 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 1031. Compared 336649 event pairs, 15876 based on Foata normal form. 8816/40294 useless extension candidates. Maximal degree in co-relation 50794. Up to 26524 conditions per place. [2025-01-09 16:35:28,000 INFO L140 encePairwiseOnDemand]: 106/142 looper letters, 68 selfloop transitions, 2 changer transitions 0/110 dead transitions. [2025-01-09 16:35:28,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 110 transitions, 376 flow [2025-01-09 16:35:28,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:35:28,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:35:28,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2025-01-09 16:35:28,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5258215962441315 [2025-01-09 16:35:28,002 INFO L175 Difference]: Start difference. First operand has 105 places, 142 transitions, 300 flow. Second operand 3 states and 224 transitions. [2025-01-09 16:35:28,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 110 transitions, 376 flow [2025-01-09 16:35:28,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 110 transitions, 376 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:35:28,006 INFO L231 Difference]: Finished difference. Result has 108 places, 110 transitions, 246 flow [2025-01-09 16:35:28,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=108, PETRI_TRANSITIONS=110} [2025-01-09 16:35:28,008 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 3 predicate places. [2025-01-09 16:35:28,008 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 110 transitions, 246 flow [2025-01-09 16:35:28,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-09 16:35:28,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:35:28,009 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-01-09 16:35:28,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:35:28,009 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:35:28,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:35:28,009 INFO L85 PathProgramCache]: Analyzing trace with hash 357605276, now seen corresponding path program 1 times [2025-01-09 16:35:28,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:35:28,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477607447] [2025-01-09 16:35:28,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:35:28,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:35:28,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 16:35:28,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 16:35:28,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:35:28,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:35:28,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:35:28,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:35:28,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477607447] [2025-01-09 16:35:28,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477607447] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:35:28,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715860293] [2025-01-09 16:35:28,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:35:28,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:35:28,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:35:28,080 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:35:28,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 16:35:28,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 16:35:28,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 16:35:28,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:35:28,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:35:28,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:35:28,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:35:28,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:35:28,177 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:35:28,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:35:28,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715860293] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:35:28,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:35:28,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-09 16:35:28,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813150504] [2025-01-09 16:35:28,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:35:28,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:35:28,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:35:28,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:35:28,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:35:28,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 142 [2025-01-09 16:35:28,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 110 transitions, 246 flow. Second operand has 7 states, 7 states have (on average 41.714285714285715) internal successors, (292), 7 states have internal predecessors, (292), 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-09 16:35:28,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:35:28,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 142 [2025-01-09 16:35:28,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:35:30,124 INFO L124 PetriNetUnfolderBase]: 18464/36003 cut-off events. [2025-01-09 16:35:30,125 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-01-09 16:35:30,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62643 conditions, 36003 events. 18464/36003 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 1030. Compared 336592 event pairs, 15876 based on Foata normal form. 0/31481 useless extension candidates. Maximal degree in co-relation 62630. Up to 26524 conditions per place. [2025-01-09 16:35:30,300 INFO L140 encePairwiseOnDemand]: 139/142 looper letters, 68 selfloop transitions, 5 changer transitions 0/113 dead transitions. [2025-01-09 16:35:30,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 113 transitions, 404 flow [2025-01-09 16:35:30,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:35:30,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:35:30,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 316 transitions. [2025-01-09 16:35:30,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37089201877934275 [2025-01-09 16:35:30,302 INFO L175 Difference]: Start difference. First operand has 108 places, 110 transitions, 246 flow. Second operand 6 states and 316 transitions. [2025-01-09 16:35:30,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 113 transitions, 404 flow [2025-01-09 16:35:30,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 113 transitions, 400 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:35:30,304 INFO L231 Difference]: Finished difference. Result has 115 places, 113 transitions, 278 flow [2025-01-09 16:35:30,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=278, PETRI_PLACES=115, PETRI_TRANSITIONS=113} [2025-01-09 16:35:30,304 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 10 predicate places. [2025-01-09 16:35:30,305 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 113 transitions, 278 flow [2025-01-09 16:35:30,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 41.714285714285715) internal successors, (292), 7 states have internal predecessors, (292), 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-09 16:35:30,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:35:30,305 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1] [2025-01-09 16:35:30,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 16:35:30,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:35:30,506 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:35:30,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:35:30,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1566928784, now seen corresponding path program 2 times [2025-01-09 16:35:30,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:35:30,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181880477] [2025-01-09 16:35:30,507 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:35:30,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:35:30,514 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-01-09 16:35:30,522 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 16:35:30,523 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:35:30,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:35:30,616 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:35:30,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:35:30,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181880477] [2025-01-09 16:35:30,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181880477] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:35:30,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93820730] [2025-01-09 16:35:30,618 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:35:30,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:35:30,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:35:30,622 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:35:30,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 16:35:30,676 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-01-09 16:35:30,702 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 16:35:30,703 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:35:30,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:35:30,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:35:30,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:35:30,737 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:35:30,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:35:30,812 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:35:30,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93820730] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:35:30,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:35:30,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-01-09 16:35:30,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48311064] [2025-01-09 16:35:30,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:35:30,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:35:30,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:35:30,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:35:30,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:35:30,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 142 [2025-01-09 16:35:30,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 113 transitions, 278 flow. Second operand has 13 states, 13 states have (on average 41.38461538461539) internal successors, (538), 13 states have internal predecessors, (538), 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-09 16:35:30,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:35:30,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 142 [2025-01-09 16:35:30,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:35:33,066 INFO L124 PetriNetUnfolderBase]: 18464/36009 cut-off events. [2025-01-09 16:35:33,066 INFO L125 PetriNetUnfolderBase]: For 181/181 co-relation queries the response was YES. [2025-01-09 16:35:33,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62680 conditions, 36009 events. 18464/36009 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 1030. Compared 336475 event pairs, 15876 based on Foata normal form. 6/31494 useless extension candidates. Maximal degree in co-relation 62621. Up to 26524 conditions per place. [2025-01-09 16:35:33,225 INFO L140 encePairwiseOnDemand]: 139/142 looper letters, 68 selfloop transitions, 11 changer transitions 0/119 dead transitions. [2025-01-09 16:35:33,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 119 transitions, 472 flow [2025-01-09 16:35:33,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:35:33,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:35:33,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 565 transitions. [2025-01-09 16:35:33,228 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3315727699530516 [2025-01-09 16:35:33,228 INFO L175 Difference]: Start difference. First operand has 115 places, 113 transitions, 278 flow. Second operand 12 states and 565 transitions. [2025-01-09 16:35:33,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 119 transitions, 472 flow [2025-01-09 16:35:33,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 119 transitions, 458 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-09 16:35:33,231 INFO L231 Difference]: Finished difference. Result has 131 places, 119 transitions, 348 flow [2025-01-09 16:35:33,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=348, PETRI_PLACES=131, PETRI_TRANSITIONS=119} [2025-01-09 16:35:33,231 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 26 predicate places. [2025-01-09 16:35:33,231 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 119 transitions, 348 flow [2025-01-09 16:35:33,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 41.38461538461539) internal successors, (538), 13 states have internal predecessors, (538), 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-09 16:35:33,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:35:33,232 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 1, 1, 1, 1, 1] [2025-01-09 16:35:33,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 16:35:33,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-01-09 16:35:33,433 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:35:33,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:35:33,433 INFO L85 PathProgramCache]: Analyzing trace with hash -353763088, now seen corresponding path program 3 times [2025-01-09 16:35:33,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:35:33,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537030199] [2025-01-09 16:35:33,433 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:35:33,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:35:33,442 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 6 equivalence classes. [2025-01-09 16:35:33,464 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 16:35:33,464 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-09 16:35:33,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:35:33,464 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:35:33,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 16:35:33,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 16:35:33,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:35:33,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:35:33,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:35:33,481 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:35:33,482 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-01-09 16:35:33,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-01-09 16:35:33,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-01-09 16:35:33,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-01-09 16:35:33,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-01-09 16:35:33,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:35:33,482 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-01-09 16:35:33,483 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:35:33,483 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 16:35:33,503 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 16:35:33,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 187 transitions, 401 flow [2025-01-09 16:35:33,519 INFO L124 PetriNetUnfolderBase]: 100/350 cut-off events. [2025-01-09 16:35:33,519 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-09 16:35:33,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 350 events. 100/350 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1806 event pairs, 1 based on Foata normal form. 0/239 useless extension candidates. Maximal degree in co-relation 250. Up to 16 conditions per place. [2025-01-09 16:35:33,521 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 187 transitions, 401 flow [2025-01-09 16:35:33,523 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 187 transitions, 401 flow [2025-01-09 16:35:33,524 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:35:33,524 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=LoopHeads, 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;@42972126, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:35:33,524 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-09 16:35:33,528 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:35:33,528 INFO L124 PetriNetUnfolderBase]: 17/104 cut-off events. [2025-01-09 16:35:33,528 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 16:35:33,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:35:33,529 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:35:33,529 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 16:35:33,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:35:33,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1306587464, now seen corresponding path program 1 times [2025-01-09 16:35:33,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:35:33,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196830427] [2025-01-09 16:35:33,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:35:33,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:35:33,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 16:35:33,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 16:35:33,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:35:33,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:35:33,560 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-09 16:35:33,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:35:33,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196830427] [2025-01-09 16:35:33,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196830427] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:35:33,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:35:33,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:35:33,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594654591] [2025-01-09 16:35:33,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:35:33,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:35:33,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:35:33,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:35:33,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:35:33,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 187 [2025-01-09 16:35:33,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 187 transitions, 401 flow. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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-09 16:35:33,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:35:33,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 187 [2025-01-09 16:35:33,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand